HDU-5912 Fraction（迭代）-CSDN博客

本文介绍了一个分数迭代计算的问题，包括输入输出格式、示例输入输出及解答思路。通过递归方式计算给定公式的结果，并确保输出为最简分数形式。

Fraction

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

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

Sample Output

  
   Case #1: 1 2


   
    
     Hint
    
Here are the details for the first sample:
2/(1+3/1) = 1/2

Source

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

就是分子和分母依此迭代啊，貌似以前见过式子，不知道名字是什么。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int N = 10;
int a[N],b[N];
int gcd(int a,int b)
{
    return b == 0 ? a : gcd(b,a%b);
}
int main()
{
    int t,n;
    cin >> t;
    for(int ca = 1;ca <= t;ca++)
    {
        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]);
        printf("Case #%d: ",ca);
        int fz = b[n],fm = a[n];
        for(int i = n-1;i >= 1;i--)
        {
            fz += a[i]*fm;
            fm *= b[i];
            swap(fz,fm);
        }

        int g = gcd(fz,fm);
        printf("%d %d\n",fz/g,fm/g);
    }
    return 0;
}