HDU6030-Happy Necklace
来源:互联网 发布:论文 知乎 编辑:程序博客网 时间:2024/06/05 23:43
Happy Necklace
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0
Problem Description
Little Q wants to buy a necklace for his girlfriend. Necklaces are single strings composed of multiple red and blue beads.
Little Q desperately wants to impress his girlfriend, he knows that she will like the necklace only if for every prime length continuous subsequence in the necklace, the number of red beads is not less than the number of blue beads.
Now Little Q wants to buy a necklace with exactlyn beads. He wants to know the number of different necklaces that can make his girlfriend happy. Please write a program to help Little Q. Since the answer may be very large, please print the answer modulo 109+7 .
Note: The necklace is a single string, {not a circle}.
Little Q desperately wants to impress his girlfriend, he knows that she will like the necklace only if for every prime length continuous subsequence in the necklace, the number of red beads is not less than the number of blue beads.
Now Little Q wants to buy a necklace with exactly
Note: The necklace is a single string, {not a circle}.
Input
The first line of the input contains an integer T(1≤T≤10000) , denoting the number of test cases.
For each test case, there is a single line containing an integern(2≤n≤1018) , denoting the number of beads on the necklace.
For each test case, there is a single line containing an integer
Output
For each test case, print a single line containing a single integer, denoting the answer modulo 109+7 .
Sample Input
223
Sample Output
34
题意:一个项链有n个珠子,这个项链是个链,不是一个环,项链上连续素数个珠子中红色珠子个数要大于等于蓝色珠子
解题思路:找出前面几个,发现存在递推关系f[i]=f[i-1]+f[i-3],然后构造矩阵,矩阵快速幂
#include <iostream>#include <cstdio>#include <cstring>#include <string>#include <algorithm>#include <cmath>#include <map>#include <cmath>#include <set>#include <stack>#include <queue>#include <vector>#include <bitset>#include <functional>using namespace std;#define LL long longconst int INF=0x3f3f3f3f;#define mod 1000000007LL n;struct Matrix{ LL v[5][5]; Matrix() { memset(v,0,sizeof v); }}dan;Matrix mul(Matrix a,Matrix b,int d){ Matrix ans; for(int i=1; i<=d; i++) { for(int j=1; j<=d; j++) { for(int k=1; k<=d; k++) { ans.v[i][j]+=a.v[i][k]*b.v[k][j]; ans.v[i][j]%=mod; } } } return ans;}Matrix pow(Matrix a,LL k,int d){ Matrix ans=dan; while(k) { if(k&1) ans=mul(ans,a,d); k>>=1; a=mul(a,a,d); } return ans;}int main(){ int t; scanf("%d",&t); while(t--) { scanf("%lld",&n); if(n==2) {printf("3\n");continue;} if(n==3) {printf("4\n");continue;} if(n==4) {printf("6\n");continue;} Matrix ans,a; a.v[1][1]=a.v[3][1]=a.v[1][2]=a.v[2][3]=1; dan.v[1][1]=6,dan.v[1][2]=4,dan.v[1][3]=3; ans=pow(a,n-4,3); printf("%lld\n",ans.v[1][1]); } return 0;}
0 0
- HDU6030-Happy Necklace
- HDU6030 Happy Necklace[矩阵快速幂]
- HDU6030 Happy Necklace(矩阵快速幂)
- HDU6030-Happy Necklace-找规律+矩阵快速幂
- 【HDU6030】Happy Necklace(找规律+矩阵快速幂)
- HDU6029 Happy Necklace
- HDU 6030 Happy Necklace
- hdu 6030 Happy Necklace
- hdoj 6030 Happy Necklace
- hdu 6030 Happy Necklace
- HDU 6030 Happy Necklace (DP)
- HDU 6030 Happy Necklace【矩阵快速幂】
- HDU 6030 Happy Necklace【矩阵快速幂】
- 2017 CCPC-WFinal&&HDOJ 6030 Happy Necklace(矩阵快速幂)
- HDU 6030 Happy Necklace[找规律][矩阵快速幂]
- 2017CCPC女生赛 hdu 6030 Happy Necklace
- HDU 6030 Happy Necklace (递推+矩阵快速幂)
- Hdu 6030 Happy Necklace【Dp+矩阵快速幂】
- View如何加载到窗口
- 老夏书单第一弹——吉祥纹莲花楼
- 使用字符映射完成简单的对称加密
- floyg最短路径算法
- 雷神:视音频数据处理入门——001
- HDU6030-Happy Necklace
- Android下的事件分发机制(结合源码分析)
- c++实验5—数组分离
- 如何指定输入框能输入的字符
- [Android编译(二)] 从谷歌官网下载android 6.0源码、编译并刷入nexus 6p手机
- Android mkdirs或mkdir一直返回false(createNewFile也失败)
- 统计学基础概念【未完待续】
- 关于java 的InputStream和OutputStream的理解
- Civilization CodeForces