uva 7096 A Rational Sequence（思维）

7096 A Rational Sequence
An infinite full binary tree labeled by positive rational numbers is defined by:
• The label of the root is 1/1.
• The left child of label p/q is p/(p+q).
• The right child oflabel p/q is (p+q)/q.

The top of the tree is shown in the following figure:
A rational sequence is defined by doing a level order (breadth first) traversal of the tree (indicated by the light dashed line). So that: F(1) = 1/1, F(2) = 1/2, F(3) = 2/1, F(4) = 1/3, F(5) = 3/2, F(6) = 2/3, . . .
Write a program which takes as input a rational number, p/q, in lowest terms and finds the next rational number in the sequence. That is, if F(n) = p/q, then the result is F(n + 1).
Input
The first line of input contains a single integer P, (1 ≤ P ≤ 1000), which is the number of data sets that fol