HDOJ1005：Number Sequence

最新推荐文章于 2022-07-19 08:58:36 发布

编程白菜

最新推荐文章于 2022-07-19 08:58:36 发布

阅读量750

点赞数

分类专栏： HDOJ

本文链接：https://blog.csdn.net/bianchengbaicai/article/details/16822313

版权

HDOJ 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

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

Sample Output

2
5

Java Code：

import java.util.Scanner;


public class Main {
	
	public static void main(String[] args){
		Scanner sc=new Scanner(System.in);
		int a,b;
		int[] f=new int[50];
		Long n;
		a=sc.nextInt();
		b=sc.nextInt();
		n=sc.nextLong();
		
		while(a!=0 || b!=0 || n!=0){
			n=n%49;
			f[1]=1;f[2]=1;
			for(int i=3;i<=n;i++){
				f[i]=(a*f[i-1]+b*f[i-2])%7;
			}
			String str=n.toString();
			int m=Integer.parseInt(str);
			System.out.println(f[m]);
			
			a=sc.nextInt();
			b=sc.nextInt();
			n=sc.nextLong();
		}
	}
}