Construct a Matrix FZU
来源:互联网 发布:1024邀请码淘宝怎么搜 编辑:程序博客网 时间:2024/06/06 13:23
题目链接:点我
There is a set of matrixes that are constructed subject to the following constraints:1. The matrix is a S(n)×S(n) matrix;2. S(n) is the sum of the first n Fibonacci numbers modulus m, that is S(n) = (F1 + F2 + … + Fn) % m;3. The matrix contains only three kinds of integers ‘0’, ‘1’ or ‘-1’;4. The sum of each row and each column in the matrix are all different.Here, the Fibonacci numbers are the numbers in the following sequence: 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, …By definition, the first two Fibonacci numbers are 1 and 1, and each remaining number is the sum of the previous two.In mathematical terms, the sequence Fn of Fibonacci numbers is defined by the recurrence relation Fn = Fn-1 + Fn-2, with seed values F1 = F2 = 1.Given two integers n and m, your task is to construct the matrix.
Input
The first line of the input contains an integer T (T <= 25), indicating the number of cases. Each case begins with a line containing two integers n and m (2 <= n <= 1,000,000,000, 2 <= m <= 200).
Output
For each test case, print a line containing the test case number (beginning with 1) and whether we could construct the matrix. If we could construct the matrix, please output “Yes”, otherwise output “No” instead. If there are multiple solutions, any one is accepted and then output the S(n)×S(n) matrix, separate each integer with an blank space (as the format in sample).
Sample Input
22 35 2
Sample Output
Case 1: Yes-1 10 1Case 2: No
题意:
构造一个Sn * Sn 的矩阵,矩阵只能包含0, 1, -1 三个数字,并且矩阵的每一行每一列都是不一样的.Sn是斐波那契数列前n项和 mod m, 问是否能构造这样的矩阵
代码:
#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>#include<iostream>#include<queue>using namespace std;typedef long long LL;LL n, m;struct mat{ LL a[3][3]; mat(){memset(a, 0, sizeof(a)); } mat operator *(const mat q){ mat c; for (int i = 1; i <= 2; ++i) for(int k = 1;k <= 2; ++k) if(a[i][k]) for(int j = 1; j <= 2; ++j){ c.a[i][j] += a[i][k] * q.a[k][j]; if (c.a[i][j] >= m) c.a[i][j] %= m; }return c; }};mat qpow(mat x, LL n){ mat ans; ans.a[1][1] = ans.a[2][2] = 1; while(n){ if (n&1) ans =ans * x; x = x * x; n >>= 1; }return ans;}void construct(int r){ printf("Yes\n"); int ans[205][205]; memset(ans,-1,sizeof(ans)); int k = r / 2; for(int i = k + 1; i <= r; ++i) ans[i][i-k] = 0; for(int i = k+2; i <= r; ++i) for(int j = 1; j <= i-k-1; ++j) ans[i][j] = 1; for(int i = 1; i <= k; ++i) for(int j = 1;j<=i; ++j) ans[i][r-j+1] = 1; for(int i = k+1; i <=r; ++i) for(int j = k+1; j<= r; ++j) ans[i][j] = 1; for(int i = 1; i <= r; ++i){ for(int j = 1; j < r; ++j) printf("%d ",ans[i][j]); printf("%d\n",ans[i][r]); }}int main(){ int t; scanf("%d", &t); int kase = 0; while( t--){ scanf("%lld %lld", &n, &m); printf("Case %d: ", ++kase); mat ans; ans.a[1][1] = ans.a[1][2] = ans.a[2][1] = 1; ans = qpow(ans,n); int r = (ans.a[1][1] - 1 + ans.a[1][2] ) % m; if (r & 1|| r == 0) printf("No\n"); else construct(r); }return 0;}
阅读全文
0 0
- Construct a Matrix FZU
- FZU 1911 Construct a Matrix
- FZU 1911Construct a Matrix
- fzu 1911 C. Construct a Matrix
- fzu 1911 Construct a Matrix(矩阵快速幂+规律)
- FZU 1911 Construct a Matrix(矩阵快速幂+构造)
- FZU 1911 Construct a Matrix(矩阵快速幂+找规律)
- foj 1911 Construct a Matrix
- FZU1911-Construct a Matrix(矩阵快速幂+规律)
- fzu1911 (Construct a Matrix) 矩阵快速幂+构造
- (矩阵快速幂)fzu1911 Construct a Matrix
- sgu151 Construct a triangle
- sgu151:Construct a triangle
- sgu151: Construct a triangle
- FZU A-B problem
- Another a+b FZU
- FZU 1301 Matrix(深度优先搜索)
- How to construct a DiamondOfNumbers
- Mysql Cluster7.4.6安装与配置
- MySIAM与Innodb引擎
- mysql报错序号对应的错误
- mysql日常维护
- 连接查询详解
- Construct a Matrix FZU
- raid5故障回放
- Vim的使用提高篇
- 生产环境下搭建 nagios+nconf+cacti+npc的整合
- 使用函数封装-公司自动化处理文件备份管理脚本
- web安全的学习路线
- 域名过期提前通知脚本
- linux 系统被入侵之后你要做什么
- puppet安装常遇见的问题