A water problem
Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 2269 Accepted Submission(s): 817
Problem Description
Two planets named Haha and Xixi in the universe and they were created with the universe beginning.
There is 73 days in Xixi a year and 137 days in Haha a year.
Now you know the days N after Big Bang, you need to answer whether it is the first day in a year about the two planets.
There is 73 days in Xixi a year and 137 days in Haha a year.
Now you know the days N after Big Bang, you need to answer whether it is the first day in a year about the two planets.
Input
There are several test cases(about
5
huge test cases).
For each test, we have a line with an only integer N(0≤N) , the length of N is up to 10000000 .
For each test, we have a line with an only integer N(0≤N) , the length of N is up to 10000000 .
Output
For the i-th test case, output Case #i: , then output "YES" or "NO" for the answer.
Sample Input
10001 0 333
Sample Output
Case #1: YES Case #2: YES Case #3: NO
Author
UESTC
Source
解题思路:模拟,算出n是否是73和137的倍数
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <cmath>
#include <map>
#include <cmath>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <bitset>
#include <functional>
using namespace std;
#define LL long long
const int INF = 0x3f3f3f3f;
char ch[10000009];
int main()
{
int cas = 0;
while (~scanf("%s", ch))
{
printf("Case #%d: ", ++cas);
int len = strlen(ch);
int k = 0,kk=0;
for (int i = 0; i < len; i++)
{
k = k * 10 + ch[i]-'0';
kk = kk * 10 + ch[i] - '0';
k %= 73;
kk %= 137;
}
if (!k && !kk) printf("YES\n");
else printf("NO\n");
}
return 0;
}