UVA 10976(p183)----Fractions Again?!
来源:互联网 发布:qq for mac os x 10.8 编辑:程序博客网 时间:2024/05/22 04:42
#include<cstdio>#include<iostream>typedef struct{int x,y;}point;point ans[10000];int top,n;void output(){ printf("%d\n",top); for(int i=1;i<=top;i++) printf("1/%d = 1/%d + 1/%d\n",n,ans[i].x,ans[i].y);}int main(){ //freopen("out.out","w",stdout); while(scanf("%d",&n)==1&&n) { top=0; for(int i=n+1;i<=2*n;i++) if(i!=n) { int x=(n*i)/(i-n); if((double)(x*(i-n)==(i*n))) { top++; ans[top].x=x; ans[top].y=i; } } output(); } return 0;}
0 0
- UVA 10976(p183)----Fractions Again?!
- UVA 10976 - Fractions Again?!
- UVA 10976 - Fractions Again?!
- UVA-10976 - Fractions Again?!
- UVA - 10976 Fractions Again?!
- UVa 10976 - Fractions Again?!
- UVa 10976 - Fractions Again?!
- UVa 10976 - Fractions Again?!
- UVA - 10976 Fractions Again?!
- uva 10976 - Fractions Again?!
- UVa 10976 Fractions Again?!
- Uva - 10976 - Fractions Again?!
- UVA - 10976 Fractions Again?!
- uva 10976Fractions Again?!
- UVA 10976 - Fractions Again?!
- UVA 10976 Fractions Again?!
- UVA 10976 Fractions Again?!
- UVa 10976 Fractions Again?
- UVA 10868(p345)----Bungee Jumping
- u盘装RedHat linux系统图文教程
- 链表相交是否有环
- 从汇编指令细看计算机程序的运行过程
- 写一个函数,尽可能高效地从标准URL里取出文件的扩展名(新浪)
- UVA 10976(p183)----Fractions Again?!
- 基于 HashMap的三种输出方法
- android studio 对android app签名
- JavaWEB 核心编程视频教程 02
- UVA 11040(p342)----Add Bricks in the Wall
- 7.1 itertools--高效循环的创建函数
- 使用HashMap做一个缓存案例【缓存一张图片】
- poj Babelfish 2503 (字符串模拟)
- UVA 11054(p237)----Wine trading in Gergovia