#include<bits/stdc++.h>
using namespace std;
long long k,x,y,bb,ans;
int main(){
while(scanf("%lld",&k)==1){
ans=0;
for(y=1;y<=2*k;y++)
if(k!=y){
x=(k*y)/(y-k);
if(x>0&&y>0&&k>0&&(x*y)%(x+y)==0&&(x*y)/(x+y)==k&&x>=y)ans++;
}
printf("%lld\n",ans);
for(y=1;y<=2*k;y++)
if(k!=y){
x=(k*y)/(y-k);
if(x>0&&y>0&&k>0&&(x*y)%(x+y)==0&&(x*y)/(x+y)==k&&x>=y)
printf("1/%lld = 1/%lld + 1/%lld\n",k,x,y);
}
}
return 0;
}
UVA 10976 Fractions Again?!
最新推荐文章于 2023-10-27 19:11:30 发布