tjut 5912

来源:互联网 发布:灰姑娘网络语什么意思 编辑:程序博客网 时间:2024/05/27 20:33
#include<iostream>  #include<cstdio>  #include<cmath>  #include<cstring>  #include<climits>  #include<string>  #include<queue>  #include<stack>  #include<set>  #include<map>  #include<algorithm>  using namespace std;  #define rep(i,j,k)for(i=j;i<k;i++)  #define per(i,j,k)for(i=j;i>k;i--)  #define MS(x,y)memset(x,y,sizeof(x))  #define max(a,b) a>b?a:b  #define min(a,b) a<b?a:b  #define lson l,m,rt<<1  #define rson m+1,r,rt<<1|1  typedef long long LL;  const int INF=0x7ffffff;    const int M=100+1;  int a[M],b[M];  int i,j,k,n,m;  int fz,fm;    int gcd(int x,int y)  {    return y?gcd(y,x%y):x;  }    int main()  {    int T;    scanf("%d",&T);    int Case=1;    while(T--){      scanf("%d",&n);      for(i=1;i<=n;i++)scanf("%d",&a[i]);      for(i=1;i<=n;i++)scanf("%d",&b[i]);      int fz=b[n],fm=a[n];      for(i=n-1;i;i--){        fz+=a[i]*fm;        fm*=b[i];        swap(fz,fm);      }      int t=gcd(fz,fm);      printf("Case #%d: %d %d\n",Case++,fz/t,fm/t);    }    return 0;  } 

0 0