1005Number

HDU 1005Number Sequence(循环节)

NumberSequenceTimeLimit:2000/1000MS(Java/Others)MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):182573AcceptedSubmission(s):45387ProblemDescriptionAnumbersequenceisdefinedasfollows:f(1)=1,f(2)
寒萧北决风·2017-11-12 19:31

HDU——1005Number Sequence（模版题 二维矩阵快速幂+操作符重载）

NumberSequenceTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):148003    AcceptedSubmission(s):35976ProblemDescriptionAnumbersequenceisdefinedasfollows:f(1
a88770202·2016-05-12 16:00

杭电1005Number Sequence

NumberSequenceTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):126495    AcceptedSubmission(s):30758ProblemDescriptionAnumbersequenceisdefinedasfollows:f(1
GoodLuckAC·2015-07-20 22:00

1005Number Sequence

考察鸽巢原理的应用，数字的取值有k种可能的话，这样的数字取n位组成的n位序列有k^n中可能的排列，任取n+k^n位数字组成一个序列，里面有k^n+1个n位排列，其中一定有重复的。好比有10种颜色的玻璃球，放在11个盒子里，必定有两个球的颜色一样。这里取值范围是0~6共7个，在f的序列中任取两个数的排列有49种（带入公式得51=2+7^2）那么在f[51]的时候必定已经有了循环。因为51个数字需要5
u013827143·2014-07-21 15:00

1005Number Sequence

//第一次错误尝试/*#include usingnamespacestd; unsignedf(unsigneda,unsignedb,unsignedn) { if(n==1||n==2) return1; return(a*f(a,b,n-1)+b*f(a,b,n-2))%7; } intmain() { unsigneda,b,n; while(cin>>a>>b>>n,a!=0&&b!
xuexiacm·2012-10-28 21:00

hdu 1005Number Sequence 看高手如何找规律

NumberSequenceTimeLimit:2000/1000MS(Java/Others)    MemoryLimit:65536/32768K(Java/Others)TotalSubmission(s):63052    AcceptedSubmission(s):14475ProblemDescriptionAnumbersequenceisdefinedasfollows:f(1)
hnust_xiehonghao·2012-09-01 22:00
上一页 1 下一页
按字母分类： ABCDEFGHIJKLMNOPQRSTUVWXYZ其他