HDU 1005

Java 源码解读
Java 集合类源码,JUC 源码解读
wangxiaoming

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
1 1 3 1 2 10 0 0 0
 

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





wangxiaoming CSDN认证博客专家 架构 Spring Boot Redis
博客是很好的总结和记录工具,如果有问题,来不及回复,关注微信公众号:程序员开发者社区,获取我的联系方式,向我提问,也可以给我发送邮件,联系 1275801617@qq.com
©️2020 CSDN 皮肤主题: Age of Ai 设计师: meimeiellie 返回首页
实付0元
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、C币套餐、付费专栏及课程。

余额充值