HDU 5912 【模拟，类连分数的计算】【2016中国大学生程序设计竞赛（长春）】

Fraction

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

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

   
   
   
    
  
  

 

Source

2016中国大学生程序设计竞赛（长春）-重现赛

原题链接：http://acm.hdu.edu.cn/showproblem.php?pid=5912

输入如图所示得到分数，计算其值。

模拟题也要技巧。

Matrix67: The Aha Moments 连分数：

2016中国大学生程序设计竞赛（长春）Rank:http://board.acmicpc.info/ccpc2016/jlu_onsite.php

AC代码：

#include <iostream>
#include <cstring>
#include <cstdio>
using namespace std;
int a[10];
int b[10];
int GCD(int x,int y)
{
    return y==0?x:GCD(y,x%y);
}
int main()
{
    int T,kase=0;
    //freopen("data/5912.txt","r",stdin);
    cin>>T;
    int n;
    while(T--)
    {
        cin>>n;
        for(int i=1;i<=n;i++)
            cin>>a[i];
        for(int i=1;i<=n;i++)
            cin>>b[i];
        int fz=b[n],fm=a[n];
        for(int i=n-1;i>0;i--)
        {
            fz+=a[i]*fm;
            fm*=b[i];
            swap(fz,fm);
        }
        int gcd=GCD(fz,fm);
        fz/=gcd,fm/=gcd;
        printf("Case #%d: %d %d\n",++kase,fz,fm);
    }
    return 0;
}

尊重原创，转载请注明出处： http://blog.csdn.net/hurmishine