题目如下:
Number Sequence
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.
(mod是取模的意思)
Given A, B, and n, you are to calculate the value of f(n).
给定A,B,和n,你要计算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.
输入由多个测试用例组成。每个测试用例在一行上包含3个整数A、B和n(1<=A、B<=1000、1<=n<=100000000)。三个零表示输入结束,不处理此测试用例。
Output
For each test case, print the value of f(n) on a single line.
对于每个测试用例,在一行上打印f(n)的值。
Sample Input
1 1 3
1 2
10
0 0 0
Sample Output
2
5
解析:我这里用的是递归法。
规律是f(n-1)和f(n-2)都是小于7的两个数字的组合周期为7*7=49。你可以用这个代码自己调试一下看看。
#include<stdio.h>
int f(int a,int b,int n){
if(n==1||n==2)
return 1;
return (a*f(a,b,n-1)+b*f(a,b,n-2))%7;
}
int main(){
int a=1,b=1,n,sum=0;//a,b和后面的n<100都可以调试一个一个来找规律
for(n=1;n<100;n++){
sum=f(a,b