UVa10976 - Fractions Again?!
来源:互联网 发布:笛子模仿软件 编辑:程序博客网 时间:2024/05/16 14:23
#include<iostream>#include<cstdio>#include<vector>using namespace std;int main(){ int k; while(cin >> k && k){ vector<int>a[2]; for(int i=k+1; i<=2*k; i++) if( k*i%(i-k)==0 ){ a[0].push_back(k*i/(i-k)); a[1].push_back(i); } cout << a[0].size() << "\n"; for(int i=0; i<a[0].size(); i++) printf("1/%d = 1/%d + 1/%d\n",k, a[0][i], a[1][i]); } return 0;}
0 0
- UVa10976 - Fractions Again?!
- UVa10976 - Fractions Again?!
- UVa10976 - Fractions Again?!
- UVA10976-Fractions Again?!
- UVA10976 Fractions Again?!
- UVa10976 - Fractions Again?!
- UVA10976 Fractions Again?!
- UVA10976 Fractions Again?!
- UVa10976-Fractions Again?!(枚举)
- UVA10976-Fractions Again?!
- Uva10976——Fractions Again?!
- 问题链接:UVA10976 Fractions Again?
- Uva10976 分数拆分 Fractions Again?!
- UVa10976 Fractions Agains?!
- Fractions Again?!
- Fractions Again?!
- UVA 10976 - Fractions Again?!
- UVA 10976 - Fractions Again?!
- linux的mount(挂载)命令详解
- BGP选路详解
- Myeclipse 中的自动输入问题
- Android中的GraphicBuffer同步机制-Fence
- Libevent:9Evbuffers缓存IO的实用功能
- UVa10976 - Fractions Again?!
- android开发之sdk利用国内镜像更新
- 典型的色彩空间介绍
- Linux内核分析(七)
- PHP中数组合并的两种方法
- CSDN终于改进了编辑器啦!!!
- 历届试题 矩阵翻硬币 蓝桥杯 大数开方 大数相乘
- newInstance()和new ()的区别
- RCU讲解