UVA10976 分数拆分 Fractions Again?!

2
1/2 = 1/6 + 1/3
1/2 = 1/4 + 1/4
8
1/12 = 1/156 + 1/13
1/12 = 1/84 + 1/14
1/12 = 1/60 + 1/15
1/12 = 1/48 + 1/16
1/12 = 1/36 + 1/18
1/12 = 1/30 + 1/20
1/12 = 1/28 + 1/21
1/12 = 1/24 + 1/24

#include<iostream>
using namespace std;
int k,y,a[5000],b[5000],cnt;//定义两个数组存储所有的可能性. 
int main()
{
  //y<=2*k   x = k*y / (y-k)==> y >k
  while(cin>>k){
    //memset(a,0,sizeof(a));
    cnt = 0;//用于计数 
    for(int y = k+1; y <= 2*k;y++){//枚举y,同时枚举x   
      if(!(k*y % (y-k)) && k*y / (y-k) >=y){//当 k*y 对 (y-k)求余为0,并且x >=y 则说明满足题意. 
        a[cnt] = k*y / (y-k);
        b[cnt] = y;
        cnt++;
      }
    }
    cout<<cnt<<endl;
    for(int i = 0;i < cnt;i++){
      printf("1/%d = 1/%d + 1/%d\n",k,a[i],b[i]);
    } 
  }
  return 0;
}

#include<iostream>
#include<cstdio>
#include<vector>
using namespace std;
int main()
{
  int k;
  while(scanf("%d",&k)==1&&k){
    vector<int> X,Y;
    for(int y = k+1;y<=2*k;y++){
      if(k*y %(y-k)==0){
        X.push_back(k*y /(y-k));
        Y.push_back(y); 
      }
    }
    printf("%d\n",X.size());
    for(int i = 0;i < X.size();i++){
      printf("1/%d = 1/%d + 1/%d\n",k,X[i],Y[i]);
    }
  }
  return 0;
}