杭电1005-Number Sequence
来源:互联网 发布:mysql安装步骤 编辑:程序博客网 时间:2024/06/05 18:32
Number Sequence
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 130991 Accepted Submission(s): 31832
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).
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 31 2 100 0 0
Sample Output
25
这个题最后输出的数要针对7取余,必定是有规律的,找出循环节即可!
AC代码:
#include<cstdio>int f[1000];int main(){long long n;int a,b,i;while(scanf("%d%d%lld",&a,&b,&n),a||b||n){f[0]=1;f[1]=1;for(i=2;i<200;i++){f[i]=(a*f[i-1]+b*f[i-2])%7;if(f[i]==1&&f[i-1]==1)break; }int x=(n-1)%(i-1);printf("%d\n",f[x]); } return 0; }
0 0
- 杭电1005 Number Sequence
- 杭电 1005 Number Sequence
- 杭电 1005 Number Sequence
- 杭电1005 Number Sequence
- 杭电1005Number Sequence
- 杭电1005-Number Sequence
- 【杭电1005】Number Sequence
- 【杭电】 1005 Number Sequence
- 杭电1005 Number Sequence
- 杭电1005 Number Sequence
- [杭电]Number Sequence
- 杭电ACM 1005 Number Sequence
- 杭电OJ 1005:Number Sequence
- 杭电 1005 Number Sequence()
- Number Sequence(杭电1005)
- 杭电1005 Number Sequence(规律)
- 杭电1005 Number Sequence问题
- 杭电acm 1005 Number Sequence
- Fragment与Activity之间传递数据
- 柔性数组
- 基于c# 类、接口、结构的联系与区别详解
- poj 2299Ultra-QuickSort
- 连载《一个程序猿的生命周期》- 30、争取内蒙区的市场销售
- 杭电1005-Number Sequence
- ubuntu grub引导
- equinox的框架的类加载器
- 背景图编辑
- JVM调优总结 -Xms -Xmx -Xmn -Xss
- Android 起步之路
- 嵌套循环连接(Nested Loops), 合并联接(Merge), 哈希联接(Hash)的适用情况
- Servlet 的生命周期
- 如何根治安卓卡顿短板 三星这次有办法