Home STD Contest Notification Clarification Problems Ranklist Status Print Sign Out
1011:问题描述最后一行[l,r] [1,n]中少了一个符号,已修改。More...

Fraction

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 1045    Accepted Submission(s): 468


Problem Description
Mr. Frog recently studied how to add two fractions up, and he came up with an evil idea to trouble you by asking you to calculate the result of the formula below:


As a talent, can you figure out the answer correctly?
 

Input
The first line contains only one integer T, which indicates the number of test cases.

For each test case, the first line contains only one integer n ($n\leq 8$).

The second line contains n integers: $a_1, a_2,\cdots a_n (1\leq a_i \leq 10$).
The third line contains n integers: $b_1, b_2,\cdots ,b_n (1\leq b_i \leq 10)$.
 

Output
For each case, print a line “Case #x: p q”, where x is the case number (starting from 1) and p/q indicates the answer.

You should promise that p/q is irreducible.
 

Sample Input
1 2 1 1 2 3
 

Sample Output
Case #1: 1 2
 

Hint

Here are the details for the first sample:
2/(1+3/1) = 1/2
 

Statistic | Submit | Clarifications | Back