HDOJ1005: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.

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 #include int main(){     long a,b,n,i,func[100];     while(scanf(“%ld%ld%ld”,&a,&b,&n) && a!=0){         func[1]=func[2]=1;         for(i=3;i48)?n%48:n]);     }     return 0; }

发表评论

您的电子邮箱地址不会被公开。 必填项已用*标注