poj 1969 Count on Canton
2011-11-21 23:27
274 查看
Count on Canton
Description
One of the famous proofs of modern mathematics is Georg Cantor's demonstration that the set of rational numbers is enumerable. The proof works by using an explicit enumeration of rational numbers as shown in the diagram below.
In the above diagram, the first term is 1/1, the second term is 1/2, the third term is 2/1, the fourth term is 3/1, the fifth term is 2/2, and so on.
Input
The input list contains a single number per line and will be terminated by endof-file.
Output
You are to write a program that will read a list of numbers in the range from 1 to 10^7 and will print for each number the corresponding term in Cantor's enumeration as given below.
Sample Input
Sample Output
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 8107 | Accepted: 4733 |
One of the famous proofs of modern mathematics is Georg Cantor's demonstration that the set of rational numbers is enumerable. The proof works by using an explicit enumeration of rational numbers as shown in the diagram below.
1/1 1/2 1/3 1/4 1/5 ... 2/1 2/2 2/3 2/4 3/1 3/2 3/3 4/1 4/2 5/1
In the above diagram, the first term is 1/1, the second term is 1/2, the third term is 2/1, the fourth term is 3/1, the fifth term is 2/2, and so on.
Input
The input list contains a single number per line and will be terminated by endof-file.
Output
You are to write a program that will read a list of numbers in the range from 1 to 10^7 and will print for each number the corresponding term in Cantor's enumeration as given below.
Sample Input
3 14 7
Sample Output
TERM 3 IS 2/1 TERM 14 IS 2/4 TERM 7 IS 1/4
#include <iostream> using namespace std; int main() { int n,flag,position; while (cin >> n) { flag=0; position=n; while (n>flag)//定位,确定分子分母 { n-=flag; flag++; } if (flag%2==0) cout << "TERM " <<position << " IS "<<n<<"/" << flag-n+1<< endl; else cout << "TERM " <<position << " IS "<<flag-n+1<<"/" << n << endl; } }
相关文章推荐
- POJ 1969---Count on Canton【数学问题】
- 算法思考: poj 1969 Count on Canton
- poj 1969 Count on Canton
- poj 1969 Count on Canton 摘规律
- POJ 1969 Count on Canton 笔记
- POJ 1969 Count on Canton(数学题,找规律)
- (解题报告)POJ1969--Count on Canton(利用蛇形矩阵知识)
- POJ-1969-Count on Canton
- [POJ1969]Count on Canton
- zoj 2185 || poj 1969 Count on Canton
- hdoj 1969 (poj 3122&&acm)Pie
- No.1969 Count on Canton (ACM)
- POJ 1969 S型排列
- POJ 1969
- zoj 2185||poj 1969||(数学)
- POJ&nbsp;1969
- EOJ 1424/FOJ 1171/POJ 2572/ZOJ 1969/Ulm Local 2001 Hard to Believe, but True!
- poj1969---找规律
- Who's in the Middle--POJ 2388
- poj1226(kmp算法,后缀数组)