HDU 1005 Number Sequence （寻找循环节）

最新推荐文章于 2024-07-18 12:00:00 发布

原创最新推荐文章于 2024-07-18 12:00:00 发布 · 470 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

思维

本文介绍了一道关于数列求值的问题，通过寻找数列的循环节来高效计算第n项的值。该数列由初始条件f(1)=1,f(2)=1开始，并遵循递推公式f(n)=(A*f(n-1)+B*f(n-2))%7。文章提供了完整的代码实现，展示了如何检测循环节并利用它进行快速计算。

Number Sequence

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

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

Recommend

JGShining | We have carefully selected several similar problems for you: 1008 1021 1019 1012 1071

思路：很明显这道题会存在规律，注意是对7取模，结果最多有49种情况，那么应该会存在循环，找出循环

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<algorithm>
using namespace std;
int f[1100],num[100];
int main()
{
	int a,b,n,i,j,k,l,r;
	while(scanf("%d%d%d",&a,&b,&n),a+b+n)
	{
		f[1]=1;
		f[2]=1;
		k=0;
		int flag=0;
		for(i=3;i<=n;i++)
		{
			f[i]=(a*f[i-1]+b*f[i-2])%7;
		    for(j=2;j<i;j++)//找出循环节 
		    {
		    	if(f[j]==f[i]&&f[j-1]==f[i-1]) 
		    	{
		    		l=j;
		    		r=i;
		    		flag=1;
		    		break;
				}
			}
			if(flag==1)
			  break;
		}
		if(flag)
		printf("%d\n",f[l+(n-r)%(r-l)]);
		else
		printf("%d\n",f[n]);
	}
	return 0;
}