HDOJ 题目1005 Number Sequence（剩余定理）

最新推荐文章于 2018-03-18 18:08:42 发布

Jogging_Clown

最新推荐文章于 2018-03-18 18:08:42 发布

阅读量508

点赞数

分类专栏：数学

本文链接：https://blog.csdn.net/yu_ch_sh/article/details/38126135

版权

数学专栏收录该内容

164 篇文章 0 订阅

订阅专栏

Number Sequence

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

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

Author

CHEN, Shunbao

Source

ZJCPC2004

http://acm.hdu.edu.cn/showproblem.php?pid=1005

每49次循环一次，被坑

ac代码

#include<stdio.h>
int f[10000];
int main()
{
	int a,b,n;
	while(scanf("%d%d%d",&a,&b,&n)!=EOF&&a||b||n)
	{
		int i,tc,k=3;
		f[1]=1,f[2]=1;
		for(i=3;i<=49;i++)
		{
			f[i]=(a*f[i-1]%7+b*f[i-2]%7)%7;
		}
		printf("%d\n",f[n%49]);
	}
}