杭电题ACM1005

最新推荐文章于 2018-10-03 20:57:02 发布

laymenISmouse

最新推荐文章于 2018-10-03 20:57:02 发布

阅读量810

点赞数

分类专栏： ACM 文章标签：杭电ACM 1005 C++

本文链接：https://blog.csdn.net/u010343650/article/details/51059450

版权

ACM 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

Number Sequence

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

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

我这样写的，结果报wrong error!

#include "iostream"
using namespace std ;
int A;
int B;
int f(int n){
	if(n==2||n==1)return 1;
	else
	return (A*f(n-1)+B*f(n-2))%7;
}

int main(){  
	
	int n;
	while (cin>>A>>B>>n)
	{
		if (A==0&&B==0&&n==0)break;
		cout<<f(n)<<endl;

	}
		system("pause");
        return 0;  
    }

关于m=n%49 这是因为f(n-1)有取值只能有0,1,2,3,4，5，6 这7个数，同理f(n-2)也是这样，故有7*7=49,即49次一循环。如果不对请指正，谢谢

#include "iostream"
using namespace std ;
int A;
int B;
int f(int n){
	if(n==2||n==1)return 1;
	else
	return (A*f(n-1)+B*f(n-2))%7;
}

int main(){  
	
	int n;
	int m;
	while (cin>>A>>B>>n)
	{
		if (A==0&&B==0&&n==0)break;
		m=n%49;
		cout<<f(m)<<endl;

	}
		system("pause");
        return 0;  
    }