It's Saturday today, what day is it after 1^1 + 2^2+ 3^3 + ... + N^N 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.
题意:今天是周六,输入N,输出 1^1 + 2^2+ 3^3 + ... + N^N 天后是周几。
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<cstdio>
#include<cstdlib>
#include<queue>
#include<cmath>
#include<cctype>
#include<stack>
#include<cstring>
#include<set>
#include<map>
#include<list>
const int INF = 0x3f3f3f3f;
const int maxn = 20000 + 10;
int c[300];
void x()
{
int t;
long long ans = 1, a = 0;
//找出规律,294为一个周期;
for (int i = 1; i <= 294; i++)
{
ans = 1;
//在n的n次方的过程中,每次乘n的时候都要模7;
for (int j = 1; j <= i; j++)
ans = ans*i%7;
//从1的1次方加到n的n次方;
a = a + ans;
c[i] = a % 7;//把一个周期的存入数组c中;
}
}
int main()
{
int t;
char s[][20]= { "Sunday", "Monday", "Tuesday", "Wednesday", "Thursday", "Friday", "Saturday" };
long long n;
scanf("%d", &t);
x();
while (t--)
{
scanf("%lld", &n);
int p = n % 294;//计算n为周期中的第几个;
int q = c[p] + 6;//因为今天时周六;
printf("%s\n", s[q % 7]);//计算今天是周几;
}
return 0;
}