A water problem
Time Limit: 5000/2500 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 177 Accepted Submission(s): 95
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
2016中国大学生程序设计竞赛 - 网络选拔赛
解题报告:大数问题,套模板就行。记住不要用cin;
code:
解题报告:大数问题,套模板就行。记住不要用cin;
code:
#include<iostream>
#include<algorithm>
#include<stdio.h>
#include<queue>
#include<math.h>
#include<string.h>
#include<stdlib.h>
using namespace std;
typedef long long ll;
const int N=10000005;
char s[N];
int main(){
// freopen("input.txt","r",stdin);
int k=1;
int n=10001;
while(~scanf("%s",s)){
int len=strlen(s);
if(s[0]=='0')
printf("Case #%d: YES\n",k++);
else{
int mod=0;
for(int i=0; i<len; i++)
{
mod=mod*10+s[i]-'0';
mod=mod%n;
}
if(mod==0)
printf("Case #%d: YES\n",k++);
else
printf("Case #%d: NO\n",k++);
}
}
return 0;
}