『杭电1005』Number Sequence

最新推荐文章于 2024-08-07 14:16:33 发布
最新推荐文章于 2024-08-07 14:16:33 发布
阅读量279 收藏 1
点赞数
CC 4.0 BY-SA版权
分类专栏： # 杭电题库 文章标签： 算法 c++ 程序设计
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.youkuaiyun.com/weixin_43349929/article/details/105874118
这道题目定义了一个数列f(n)，其中f(1)=1，f(2)=1，之后的项由A乘以前一项加上B乘以前前一项模7得到。给定A、B和n，需要计算f(n)的值。输入包含多个测试用例，每个用例有3个整数A、B和n，输出f(n)的结果。

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

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.

了解本专栏 订阅专栏 解锁全文
『杭电1711』Number Sequence
漠宸离若的博客
09-29 172
Problem Description Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b[1], a[K + 1] = b[2], ...... , a[K + M - 1]
Number Sequence（杭电1005）
My Castle
08-08 804
/*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
杭电1005 Number Sequence
skyfengye的博客
09-28 226
#include <iostream> using namespace std; /* int main() { int a,b,n; int f[50]; while (cin >> a >> b >> n) { if (a==0&&b==0&&n==0)break; f[1] = 1; f[2] = 1;
杭电1005—Number Sequence
PiKa__Qiu的博客
01-07 381
循环节，求模规律。
C语言解题——Number Sequence
Xa_L
07-19 981
数字序列定义如下给定A、B和n，您需要计算f（n）的值。
Number Sequence
章鱼鱼的ACM之路
04-02 390
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 co...
杭电oj-1005（Number Sequence）
最新发布
weixin_51670979的博客
08-07 413
由于每次的结果都要对7取余，f(n)的结果只有0、1、2、3、4、5、6，七种可能，所以f(n-1)与f(n-2)的各自的取值也有7种可能，组合最多有7*7=49种可能，即最大的周期是49，在n>49时，f(n) = f(n%49)，所以只要算出第一个周期的所有值，再利用周期规律，直接求f(n)即可。f(1) = 1，f(2) = 1，f(n) = (A * f(n-1) + B * f(n-2)) % 7，根据输入的A，B，n，计算f(n)的值。个人学习经验，欢迎各位指导。
HDU-1005 Number Sequence
鱼头的水题之路
05-20 216
水题 HDU-1005 Number Sequence 题目链接：杭电1005 题目大意：按公式求下一项 类似于斐波那契数列 解题思路：按普通递归迭代方式求解完美超时 多打印点数据发现数据每48项为一个周期（如图所示） 所以最多只要求48项即 代码块： #include<iostream> using namespace std; int main() { int a, b,...
Number Sequence 杭电ACM
关关难过关关过
01-17 273
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
杭电ACM刷题（2）：1005，Number Sequence ...
weixin_30537451的博客
05-11 258
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 o...
HDOJ 1005 Number Sequence 超详细
qascetic的博客
03-20 438
HDOJ 1005 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
杭电1005题
chaideyipi
04-21 536
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
Number Sequence 当f[i]==f[2]&&f[i-1]==f[1],周期=i-2
u013476670的专栏
01-18 1441
 Number Sequence Time Limit: 1000MS Memory limit: 65536K 题目描述 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, an
杭电oj1005c语言,杭电oj-1005(Number Sequence)
weixin_33560311的博客
05-19 170
Problem DescriptionA 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).InputThe input consi...
1005 Number Sequence
Sinhaeng_Hhjian
11-02 230
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).   I
杭电acm 1005
dujiajun95的专栏
05-01 717
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).  
杭电OJ 1005 Number Sequence
言小溪 的博客
01-27 402
Number Sequence 页面数据来自(this page from)： http://acm.hdu.edu.cn/showproblem.php?pid=1005 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) =
掌握Number Sequence的使用方法
标题“NumberSequence”和描述“how to use ax Number Sequence”暗示本文件可能是一份关于如何使用某种“Number Sequence”（数字序列）功能的教程或指南，该功能可能与编程或软件应用有关。由于文档的标题和描述...
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

当前余额3.43元 前往充值 >
需支付：10.00元
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包

打赏作者

漠宸离若

你的鼓励将是我创作的最大动力

¥1 ¥2 ¥4 ¥6 ¥10 ¥20
扫码支付：¥1
获取中
扫码支付

您的余额不足，请更换扫码支付或充值

打赏作者

实付元
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明：

1.余额是钱包充值的虚拟货币，按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载，可以购买VIP、付费专栏及课程。

余额充值