UVa 10976----Fractions Again?!(枚举)

It is easy to see that for every fraction in the form  (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 givenk?

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

结果输出是按y值的大小算的，求出y的取值范围是（k,2*k】.

求1/x,  1/x=1/k-1/y=(y-k)/k*y.但是这样会造成精度丢失，所以取倒数！！！

#include<bits/stdc++.h>
using namespace std;
int a[10010],b[10010];
int main()
{
	int k,count,i;
	while(~scanf("%d",&k))
	{
		count=0;
		for(i=k+1;i<=2*k;i++)
		{
			if(!(k*i%(i-k)))    //如判断条件为k*i/(i-k)则不对，因为x>y,所以y*k/x不一定是整数 
			{
				a[count]=k*i/(i-k);
				b[count]=i;
				count++;
			}	
		}
		
		printf("%d\n",count);   //当count=0时也输出 
		for(i=0;i<count;i++) printf("1/%d = 1/%d + 1/%d\n",k,a[i],b[i]);
	}
	return 0;
}