Contests Virtual Contests Problems Submit Runs Status Rank List Forum

2798.   Farey Sequence
Time Limit: 3.0 Seconds   Memory Limit: 65536K
Total Runs: 1595   Accepted Runs: 444    Multiple test files

The Farey Sequence Fn for any integer n with n ≥ 2 is the set of irreducible rational numbers a/b with 0 < a < bn and gcd(a,b) = 1 arranged in increasing order. The first few are

F2 = {1/2}
F3 = {1/3, 1/2, 2/3}
F4 = {1/4, 1/3, 1/2, 2/3, 3/4}
F5 = {1/5, 1/4, 1/3, 2/5, 1/2, 3/5, 2/3, 3/4, 4/5}

Now, your task is to print Farey Sequence given the value of n.

### Input

There are several test cases. The first line is an integer giving the number of cases. Each test case has only one line, which contains a positive integer n.

### Output

For each test case, you should output one line, which contains the corresponding Farey Sequence. Adjacent terms are separated by a single ',' and there can't be any white spaces in your output. See Sample Output for more clarifications on the output format.

2 ≤ n ≤ 3000

### Sample Input

4
2
3
4
5


### Sample Output

1/2
1/3,1/2,2/3
1/4,1/3,1/2,2/3,3/4
1/5,1/4,1/3,2/5,1/2,3/5,2/3,3/4,4/5


### Note

Do Not use cout to produce the output for this problem, since it is inefficient.

Source: The 5th UESTC Programming Contest
Submit   List    Runs   Forum   Statistics

Tianjin University Online Judge v1.3.0
Maintance:Fxz. Developer: SuperHacker, G.D.Retop, Fxz