河南理工的ACMer要開始組隊了
Time Limit : 3000/1000ms (Java/Other) Memory Limit : 65535/32768K (Java/Other)
Total Submission(s) : 37 Accepted Submission(s) : 10
Font: Times New Roman | Verdana | Georgia
Font Size: ← →
Problem Description
Input
接下來T行,每行一個正整數N。(1<=N<=1000)
Output
Sample Input
1 2
Sample Output
73
Author
#include<stdio.h>
#define N 1002
int f[N];
int main()
{int n,t,i,T;
f[1]=8;f[2]=73;t=90;
for(i=3;i<=N;i++)
{
f[i]=(f[i-1]*8+t)%12345;
t=((t*10)%12345);
}
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
printf("%d\n",f[n]);
}
return 0;
}
這個問題有待探索。先保存一下代碼。