杭电ACM 1005 Number Sequence

最新推荐文章于 2021-02-24 23:52:37 发布

SimonHu-real

最新推荐文章于 2021-02-24 23:52:37 发布

阅读量291

点赞数

分类专栏：修炼之路文章标签： ACM 个人学习笔记个人记录

本文链接：https://blog.csdn.net/hsm159/article/details/70474198

版权

修炼之路专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Number Sequence

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 170412 Accepted Submission(s): 42042

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

Author

CHEN, Shunbao

Source

ZJCPC2004

Recommend

JGShining | We have carefully selected several similar problems for you: 1008 1021 1019 1002 1001

#include<iostream>
using namespace std;
typedef long long ll;
const int mod=7;
#define N 2
struct matrix
{
	ll a[2][2];
};
matrix multiple(matrix x, matrix y, int n)
{
	matrix tmp;
	memset(tmp.a, 0, sizeof(tmp.a));
	for (int i = 0; i < n; i++)
		for (int j = 0; j < n; j++)
			for (int k = 0; k < n; k++)
				tmp.a[i][j] = (tmp.a[i][j] + (x.a[i][k] * y.a[k][j]) % mod) % mod;
	return tmp;
}
int main(void)
{
	matrix res;
	int a, b, n;
	cin >> a >> b >> n;
	while (a != 0 && b != 0 && n != 0)
	{
		memset(res.a, 0, sizeof(res.a));
		for (int i = 0; i<2; i++) {
			res.a[i][i] = 1;
		}
		if (n == 1 || n == 2)
			cout << 1 << endl;
		else
		{
			n -= N;
			matrix tmp = { a,b,
				           1,0 };
			while (n)
			{
				if (n & 1) res= multiple(res, tmp, N);
				n >>= 1;
				tmp=multiple(tmp, tmp, N);
				
			}
			cout << (res.a[0][0] + res.a[0][1]) % mod << endl;
		}
		cin >> a >> b >> n;
	}
}

知识来源：
http://www.cnblogs.com/CXCXCXC/p/4641812.html

http://blog.csdn.net/wust_zzwh/article/details/52058209