Link: click here
Test instructions
Describe
One day,jiameier is tidying up the Room,and find some coins. Then she throws the coin to play. Suddenly,she thinks of a problem, that if throw n times coin, what many situations of no-continuous up of the coin. Hey,let ' s solve the problem.
-
-
Input
-
The first of input is a
-
integer T which stands for the number of test cases. For each test case, there was one integer n (1<=n<=1000000000) in a line, indicate the times of throwing coins.
Output
the number of all situations of no-continuous up of the coin, moduled by 10000.
Sample input
3123
Sample output
235
Source
SCU Programming Contest Preliminary
idea: A large number of Fibonacci.
Code:
#include <stdio.h>int main () { int i; int a[15010]; a[0]=0,a[1]=2,a[2]=3; for (i=3;i<15010;i++) a[i]= (a[i-1]+a[i-2])%10000; int n; scanf ("%d", &n); while (n--) { int m; scanf ("%d", &m); printf ("%d\n", a[m%15000]%10000); } return 0;}
When you want to give up, think of what you persist until now!
Nyoj 698 A Coin problem (Fibonacci)
