217人阅读 评论(0)

# Number Sequence

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

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
1 1 3
1 2 10
0 0 0

Sample Output
2
5

Author
CHEN, Shunbao

Source

Recommend
JGShining

#include<stdio.h>

#define M 49

int A;
int B;

int n;

int f[M];

int main(void)
{
f[1]=1;
f[2]=1;
while(scanf("%d%d%d",&A,&B,&n),n){
for(int i=3;i<49;i++)
f[i]=(A*f[i-1]+B*f[i-2])%7;
printf("%d\n",f[n%48]);
}
return 0;
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：50953次
• 积分：1522
• 等级：
• 排名：千里之外
• 原创：0篇
• 转载：0篇
• 译文：112篇
• 评论：0条
阅读排行
评论排行