#include<stdio.h>
int Gcd(int a, int b)
{
return b == 0 ? a : Gcd(b, a%b);
}
int main()
{
int k, x, y;
while(scanf("%d" ,&k) != EOF)
{
int cnt = 0;
int kkk[1000];
for(int y = k + 1; y <= 2 * k; ++y)
{
int kk = k * y;
int xx = y - k;
int gcd = Gcd(kk, xx);
kk /= gcd;
xx /= gcd;
if(xx == 1)
{ kkk[cnt++] = kk;kkk[cnt++] = y;}
}
printf("%d\n", cnt/2);
for(int i = 0; i < cnt; i+=2)
printf("1/%d = 1/%d + 1/%d\n", k, kkk[i], kkk[i+1]);
}
return 0;
}
UVA - 10976 Fractions Again?!
最新推荐文章于 2021-06-14 19:05:50 发布