Fraction
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 913 Accepted Submission(s): 490
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≤8).
The second line contains n integers: a1,a2,⋯an(1≤ai≤10).
The third line contains n integers: b1,b2,⋯,bn(1≤bi≤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
//
// Created by Admin on 2017/3/12
//
#include<cstdio>
int gcd(int x,int y){
if(x<y){
int temp=x;
x=y;
y=temp;
}
return y==0?x:gcd(y,x%y);
}
int main(){
int t,n,a[10],b[10],count=0;
scanf("%d",&t);
while(t--){
scanf("%d",&n);
for(int i=1;i<=n;i++)
scanf("%d",&a[i]);
for(int i=1;i<=n;i++)
scanf("%d",&b[i]);
int mole=b[n],deno=a[n],temp,gc; //mole:分子 deno:分母
for(int i=n;i>1;i--){ //从最内层开始计算
temp=deno;
deno=a[i-1]*deno+mole;
mole=temp*b[i-1];
}
gc=gcd(mole,deno); //求最大公约数
deno/=gc; //约分
mole/=gc; //约分
printf("Case #%d: %d %d\n",++count,mole,deno);
}
return 0;
}