未解决
神探特斯拉
这个作者很懒,什么都没留下…
展开
-
蓝桥杯 入门训练 Fibonacci数列
问题描述Fibonacci数列的递推公式为:Fn=Fn-1+Fn-2,其中F1=F2=1。当n比较大时,Fn也非常大,现在我们想知道,Fn除以10007的余数是多少。输入格式输入包含一个整数n。输出格式输出一行,包含一个整数,表示Fn除以10007的余数。说明:在本题中,答案是要求Fn除以10007的余数,因此我们只要能算出这个余原创 2016-01-23 22:50:56 · 836 阅读 · 3 评论 -
HDOJ 1085 Holding Bin-Laden Captive!(母函数)(未解决)
Problem DescriptionWe all know that Bin-Laden is a notorious terrorist, and he has disappeared for a long time. But recently, it is reported that he hides in Hang Zhou of China! “Oh, God! How te原创 2016-01-27 23:50:05 · 254 阅读 · 0 评论 -
HDOJ 1006 Tick and Tick
Problem DescriptionThe three hands of the clock are rotating every second and meeting each other many times everyday. Finally, they get bored of this and each of them would like to stay away from原创 2016-02-17 21:52:35 · 939 阅读 · 0 评论