HDU 5912 Fraction

水题，队友还用递归写的……个人感觉迭代随便做

【代码】

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <complex>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <cassert>
#define ll long long

using namespace std;

int a[100];
int b[100];
int n;

int gcd(int a,int b) {return b?gcd(b,a%b):a;}

int digui(int &x,int &y,int t)
{
if(t==1)
{
x=b[n-t+1];
y=a[n-t+1];
return 0;
}
else{
digui(x,y,--t);
t++;
int q=b[n-t+1]*y;
int p=a[n-t+1]*y+x;
x=q;
y=p;
return 0;
}

}

int main()
{
//freopen("in.txt","r",stdin);
//freopen("out.txt","w",stdout);
int t;
cin>>t;
int ans=1;
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 x,y;
digui(x,y,n);
int l=gcd(x,y);
printf("Case #%d: %d %d\n",ans++,x/l,y/l);
}

return 0;
}