CANTON - Count on Cantor
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 starts with a line containing a single integer t <= 20, the number of test cases. t test cases follow.
Then, it contains a single number per line.
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.
Example
Input: 3 3 14 7 Output: TERM 3 IS 2/1 TERM 14 IS 2/4 TERM 7 IS 1/4
hide comments
try2catch:
2016-01-17 11:47:52
My 1st to be AC in 1st go :) easy though!
|
|
abc_c:
2016-01-06 15:43:29
My 22nd...AC in 1 go :) |
|
rocode0001:
2015-12-04 12:03:59
Awesome!!! |
|
aloochaat1998:
2015-11-28 03:35:22
observe the pattern very carefully and use the formula for sum of n numbers.AC in 1 go! :) |
|
jack_jay:
2015-11-23 09:48:38
simple.....but observe the pattern....dont noe y 5s... |
|
sumit dwivedi:
2015-10-29 13:26:44
nice problem 20th:) spoj problem
|
|
garmel:
2015-10-29 10:49:15
great problem, simple but teach you to think, if you get stuck think about triangular numbers.... |
|
ANIKET:
2015-10-22 19:45:35
Nice problem
|
|
vishals:
2015-10-18 12:12:24
Nice one.. observe the pattern , AC in 1 go :) |
|
nonushikhar:
2015-10-01 17:02:37
my 20th!..! easy one......ac in one go |
Added by: | Thanh-Vy Hua |
Date: | 2005-02-27 |
Time limit: | 5s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: NODEJS PERL6 VB.NET |
Resource: | ACM South Eastern European Region 2004 |