## CANTON - Count on Cantor

no tags

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
 < Previous 1 2 3 4 5 6 7 8 9 10 11 Next > 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 I don't get it why people post here "AC in one go" ??? why ? who wants to know? if you have something meaningful then post it. rajanjaiswal: 2018-01-29 09:44:14 AC in 1 go, 0.00 sec bradyawn: 2018-01-23 01:05:47 LOL memory limit allows you to store 2d array metahost: 2018-01-19 17:08:02 AC in a go! sayasaiteja: 2017-12-22 14:00:49 ac in one go!!! saurabhsunil95: 2017-12-08 08:05:45 AC in 1 GO. yead_025: 2017-11-15 15:04:53 O(1)

 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