UVa 264 Count on Cantor （waater ver.）

UVa 264 Count on Cantor （waater ver.）2014-07-14 csdn博客 synapse7264 - Count on Cantor

Time limit: 3.000 seconds

http://uva.onlinejudge.org/index.php？option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=200

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 and Output

You are to write a program that will read a list of numbers in the range from 1 to

and will print for each number the corresponding term in Cantor"s enumeration as given below. No blank line should appear after the last number.

The input list contains a single number per line and will be terminated by end-of-file.

Sample input

Sample output

TERM 3 IS 2/1TERM 14 IS 2/4TERM 7 IS 1/4

完整代码：

/*0.016s*/#include<cstdio>#include<cmath>int main（void）{int n, k, s;while （~scanf（"%d", &n））{k = （int）floor（（sqrt（（n << 3） + 1） - 1） / 2 - 1e-9） + 1;///减少一点再上取整s = k * （k + 1） >> 1;if （k & 1）printf（"TERM %d IS %d/%d
", n, s - n + 1, k - s + n）;elseprintf（"TERM %d IS %d/%d
", n, k - s + n, s - n + 1）;}return 0;}