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
gourav: 2012-12-20 14:13:30

awesome pattern... took much time so as to get this... :-) worth it.. :-)

eliminator: 2012-10-26 21:12:26

pattern is like orbital filling ... ;)

Meraj Ahmed: 2012-10-18 14:27:12

interesting play with numbers....AC :)

:): 2012-08-05 05:46:54

ah...the most logical i have seen on spoj
very difficult to move on correct path

Last edit: 2012-08-05 05:48:08
vipul sharma: 2012-07-29 16:47:15

what if the number is not in range...??

Chandan Singh: 2012-07-02 13:50:40

no anand its a zig zag series at one tym its strtng frm top and another tym it strtng frm the end bro :)

Tapan Anand: 2012-06-29 14:31:24

Shouldn't the 14th term be 4/2??

Hawk_3: 2012-06-26 16:56:47

Precomputing helps,@Murali: 2844/1629

Muralidhar Reddy: 2012-06-07 04:15:06

What is the ans for 10000000 ?

Soumabha Ray Chaudhuri: 2012-06-05 18:23:10

I got WA because i was writing "is" instead of "IS". This extra verbiage is reqd take care!!!


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