HDU 1005

最新推荐文章于 2020-02-05 19:49:19 发布

wangxiaoming

最新推荐文章于 2020-02-05 19:49:19 发布

阅读量642

点赞数

本文链接：https://blog.csdn.net/wangming520liwei/article/details/17303927

版权

New~ 本学期最后一次入选"ACM校队"的机会——12月份月赛(赶快报名吧~)

Number Sequence

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 89480 Accepted Submission(s): 21333

Problem Description

A number sequence is defined as follows:

f(1) = 1, f(2) = 1, f(n) = (A * f(n - 1) + B * f(n - 2)) mod 7.

Given A, B, and n, you are to calculate the value of f(n).

Input

The input consists of multiple test cases. Each test case contains 3 integers A, B and n on a single line (1 <= A, B <= 1000, 1 <= n <= 100,000,000). Three zeros signal the end of input and this test case is not to be processed.

Output

For each test case, print the value of f(n) on a single line.

Sample Input

Sample Output

2
5

这个题最怕的就是超时对于这个问题，还有待解决：

先附上一段超时代码：

#include<iostream>
using namespace std;

int f(int a, int b, int n)
{
    if(n == 1 )
     return 1;
    else if(n == 2)
    return 1;
    else return (a*f(a , b,n - 1) + b*f(a, b,n - 2))%7 ;
}
int main()
{
    int a, b, n;
    while(cin>>a>>b>>n)
    {
        if(a == 0 && b == 0 && n ==0)
        {
             return 0;
        }
        cout<<f(a, b, n)<<endl;
    }
    return 0;
}