It's Saturday today, what day is it after 11 + 22 + 33 + ... + NN days?
Input
There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:
There is only one line containing one integer N (1 <= N <= 1000000000).
Output
For each test case, output one string indicating the day of week.
Sample Input
2 1 2
Sample Output
Sunday Thursday
Hint
A week consists of Sunday, Monday, Tuesday, Wednesday, Thursday, Friday and Saturday.
底数%7 指数为1,2…时找到的循环
0 | | | 0 | |||||
1 | | | 1 | |||||
2 | | | 1 | 2 | 4 | |||
3 | | | 1 | 3 | 2 | 6 | 4 | 5 |
4 | | | 1 | 4 | 2 | |||
5 | | | 1 | 5 | 4 | 6 | 2 | 3 |
6 | | | 1 | 6 |
将(i^i)%7打表得到42一循环的数列
将ans打表转换为星期制输出
#include<stdio.h>
int t[300]={0,1,5,4,1,4,5,5,6,0,4,6,0,6,6,0,2,0,1,6,0,0,1,5,6,3,0,6,6,0,1,4,6,5,6,6,0,2,4,5,0,6,6,0,4,3,0,3,4,4,5,6,3,5,6,5,5,6,1,6,0,5,6,6,0,4,5,2,6,5,5,6,0,3,5,4,5,5,6,1,3,4,6,5,5,6,3,2,6,2,3,3,4,5,2,4,5,4,4,5,0,5,6,4,5,5,6,3,4,1,5,4,4,5,6,2,4,3,4,4,5,0,2,3,5,4,4,5,2,1,5,1,2,2,3,4,1,3,4,3,3,4,6,4,5,3,4,4,5,2,3,0,4,3,3,4,5,1,3,2,3,3,4,6,1,2,4,3,3,4,1,0,4,0,1,1,2,3,0,2,3,2,2,3,5,3,4,2,3,3,4,1,2,6,3,2,2,3,4,0,2,1,2,2,3,5,0,1,3,2,2,3,0,6,3,6,0,0,1,2,6,1,2,1,1,2,4,2,3,1,2,2,3,0,1,5,2,1,1,2,3,6,1,0,1,1,2,4,6,0,2,1,1,2,6,5,2,5,6,6,0,1,5,0,1,0,0,1,3,1,2,0,1,1,2,6,0,4,1,0,0,1,2,5,0,6,0,0,1,3,5,6,1,0,0};
int main()
{
int cas,n,ans;
scanf("%d",&cas);
while(cas--)
{
scanf("%d",&n);
ans=t[n%294];
if(ans==1)
printf("Sunday\n");
else if(ans==2)
printf("Monday\n");
else if(ans==3)
printf("Tuesday\n");
else if(ans==4)
printf("Wednesday\n");
else if(ans==5)
printf("Thursday\n");
else if(ans==6)
printf("Friday\n");
else
printf("Saturday\n");
}
return 0;
}