【Jason's_ACM_解题报告】Fractions Again?!

Fractions Again?!

It is easy to see that for every fraction in the form 1/k (k > 0), we can always find two positive integers x and y, x >= y, such that: 
.
Now our question is: can you write a program that counts how many such pairs of x and y there are for any given k?

Input
Input contains no more than 100 lines, each giving a value of k (0 < k <= 10000).

Output
For each k, output the number of corresponding (x, y) pairs, followed by a sorted list of the values of x and y, as shown in the sample output.

Sample Input
2
12

Sample Output
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

由于x>=y。所以推倒后得y<=2*k，而且y>k。所以枚举y，并计算出x，其中x的计算公式为 x=(k*y)/(y-k)。

附代码如下：

#include<cstdio>
#include<vector>

using namespace std;

struct E{
	int x,y;
	bool operator < (const E& eq) const {return y<eq.y;}
};

int k;
vector<E> ans;

int main(){
	while(scanf("%d",&k)==1){
		ans.clear();
		for(int y=k+1;y<=2*k;y++){
			int fz=k*y,fm=y-k;
			if(fz%fm==0)ans.push_back((E){fz/fm,y});
		}
		printf("%d\n",ans.size());
		for(int i=0;i<ans.size();i++)printf("1/%d = 1/%d + 1/%d\n",k,ans[i].x,ans[i].y);
	}
	return 0;
}