Number Sequence

最新推荐文章于 2024-08-07 14:16:33 发布

beyondjhf_2008

最新推荐文章于 2024-08-07 14:16:33 发布

阅读量123

点赞数

CC 4.0 BY-SA版权

分类专栏： ACM 文章标签： F#

本文链接：https://blog.youkuaiyun.com/beyondjhf_2008/article/details/83373117

ACM 专栏收录该内容

8 篇文章

订阅专栏

本文介绍了一个递推数列的计算方法，该数列基于模7运算，并提供了高效的算法实现来快速计算第n项的值。输入包括整数A、B及n，通过特定的递推公式和模运算进行计算。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

[size=medium]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

#include<stdio.h>
int main()
{
int a,b,n,i,x1,x2,x;
while(scanf("%d%d%d",&a,&b,&n),a||b||n)
{
x1=x2=1;
n%=49;
for(i=3;i<=n;i++)
{
x=(x2*a+x1*b)%7 ;
x1=x2;
x2=x;
}
if(n==1||n==2)printf("%d\n",1);
else printf("%d\n",x);
}
return 0;
}[/size]