Number Sequence_hdu_1005(规律)
来源:互联网 发布:lol面具数据 编辑:程序博客网 时间:2024/06/05 07:37
9329854 2013-10-13 14:36:41Accepted 1005171MS 5072K654 B Javazhangyi
http://acm.hdu.edu.cn/showproblem.php?pid=1005
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 86162 Accepted Submission(s): 20434
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
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
http://acm.hdu.edu.cn/showproblem.php?pid=1005
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 86162 Accepted Submission(s): 20434
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
*/
import java.util.Scanner;public class Main{public static void main(String[] args) {Scanner input=new Scanner(System.in);while(true){int a=input.nextInt();int b=input.nextInt();long n=input.nextInt();if(a==0&&b==0&&n==0)break;int f[]=new int[1000];f[1]=f[2]=1;int s[][]=new int[7][7];s[1][1]=2;int i=0;for(i=3;i<60;i++){f[i]=(a*f[i-1]+b*f[i-2])%7;if(s[f[i-1]][f[i]]!=0){break;}s[f[i-1]][f[i]]=i;}int d=i-s[f[i-1]][f[i]];n-=s[f[i-1]][f[i]];n%=d;if(n==0)n+=d;n+=s[f[i-1]][f[i]];System.out.println(f[(int)n]);}}}
- Number Sequence_hdu_1005(规律)
- Number Sequence 找规律
- Number Sequence【规律】
- Number Sequence(规律)
- 数学找规律 number
- number number number (数字规律)
- HDU1005 Number Sequence(规律题)
- HDU 4279 Number 规律题
- zoj 3622 Magic Number 【规律】
- UVA Number Sequence(规律)
- HDUOJ Number Sequence找规律
- HDU 1005:Number Sequence【规律】
- HDOJ 1005-Number Sequence【规律】
- hdu1005 Number Sequence (思维+规律)
- hdoj1005 Number Sequence(找规律)
- hdu4952-规律&脑洞-Number Transformation
- HDU 4279Number (打表找规律)
- HDU-6198 number number number(打表找规律、矩阵快速幂)
- tinyxml 跨平台问题
- 委托心得
- Android TextView中文字设置超链接、颜色、字体 大杂烩
- 最新的Jhost 邀请码
- SCU 4313 把一棵树切成每段K个点 (n%k)剩下的点不管
- Number Sequence_hdu_1005(规律)
- undefined reference to 'pthread_create'
- Application Loader下载安装和上传app程序
- 动态规划——最大子段和问题
- Tutorial 12 - Perspective Projection
- CA证书服务器从2003迁移到2008 R2!
- 关键字volatile的含义及常见用法
- Eratosthenes筛选法
- 面试题-螺旋矩阵