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
rajat_enzyme:
2018-08-20 19:58:32
Last edit: 2018-08-20 20:01:19 |
|
quannguyenlhp:
2018-08-18 06:27:54
AC in 1000000th go, 5 sec Last edit: 2018-08-18 06:28:15 |
|
harsh771:
2018-07-08 19:02:48
Easy to solve once you observe the pattern! |
|
vritta:
2018-06-18 13:16:25
1/1 1/2 1/3 1/4 1/5 ...
|
|
itachi_2016:
2018-06-12 10:57:50
Last edit: 2018-06-12 10:59:06 |
|
codesniper99:
2018-04-26 15:53:47
the sniper leaves his regards :3 |
|
abhinav__:
2018-04-02 11:03:39
chutiyo itna aasan sawal tha AC in 1 go likh ke khush kya ho rahe ho. |
|
lefthander:
2018-03-31 06:37:21
AC in 1 GO by Binary Search :v 0.0 sec Last edit: 2018-03-31 06:38:06 |
|
zephyr_96:
2018-02-25 15:33:07
AC in one go but took me 45 minutes to find the pattern. Once you find the pattern for numerator, finding the denominator is very easy. |
|
nidhi_061:
2018-02-13 19:17:38
Last edit: 2019-01-21 20:40:18 |
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 |