ZOJ 3785 What day is that day?法則を求める
2511 ワード
1、http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=3785
2、テーマ:
What day is that day?
Time Limit:2 Seconds
メモリLimit:65536 KB
It's Saturday today,what day it after 11+22+33+…+NN days?
Input
The re are multiple test cases.The first line of input contains an integer T indicating the number of test cases.For each test case:
The e e e is only one line containing one integer N(1<=N==100000万円)。
Output
For each test case,output one string indicating the day of week.
Sample Input
A week consists of Sunday、Monday、Tuesday、Wedness day、Thursday、Friday and Saturday.
3、考え方:
表iのi乗%7以降の値を押すと、42サイクルが見つかります。
そして結果を数式で計算します。
4、ACコード:
2、テーマ:
What day is that day?
Time Limit:2 Seconds
メモリLimit:65536 KB
It's Saturday today,what day it after 11+22+33+…+NN days?
Input
The re are multiple test cases.The first line of input contains an integer T indicating the number of test cases.For each test case:
The e e e is only one line containing one integer N(1<=N==100000万円)。
Output
For each test case,output one string indicating the day of week.
Sample Input
2
1
2
Sample OutputSunday
Thursday
ベントA week consists of Sunday、Monday、Tuesday、Wedness day、Thursday、Friday and Saturday.
3、考え方:
表iのi乗%7以降の値を押すと、42サイクルが見つかります。
そして結果を数式で計算します。
int ans=(n/42%7*(s[42]%7)%7+s[n%42]%7)%7;
最後の出力str[ans]
すぐできます4、ACコード:
#include<stdio.h>
int s[45];
char str[7][10]={"Saturday","Sunday","Monday","Tuesday","Wednesday","Thursday","Friday"};
int main()
{
s[0]=0;
for(int i=1;i<=44;i++)
{
int flag=i%7;
int ans=1;
for(int j=1;j<=i;j++)
ans=(ans*flag)%7;
s[i]=ans;
}
for(int i=1;i<=44;i++)
{s[i]+=s[i-1];}
int t;
while(scanf("%d",&t)!=EOF)
while(t--)
{
int n;
scanf("%d",&n);
int ans=(n/42%7*(s[42]%7)%7+s[n%42]%7)%7;
printf("%s
",str[ans]);
}
}