tjut 5912

版權聲明：本文爲博主原創文章，未經博主允許不得轉載。 https://blog.csdn.net/luozhong11/article/details/53038352

#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;  
}