判断一个长度最多为1e7的数串是否同时模73和137为0.
#include <set> #include <map> #include <stack> #include <queue> #include <deque> #include <cmath> #include <vector> #include <string> #include <cstdio> #include <cstdlib> #include <cstring> #include <iostream> #include <algorithm> using namespace std; #define L(i) i<<1 #define R(i) i<<1|1 #define INF 0x3f3f3f3f #define pi acos(-1.0) #define eps 1e-9 #define maxn 10000010 #define MOD 1000000007 int n,m; char s[maxn]; int main() { int t,C = 1; //scanf("%d",&t); while(scanf("%s",s) != EOF) { int num = 0; int len = strlen(s); for(int i = 0; i < len; i++) num = (num*10+s[i]-'0')%10001; printf("Case #%d: ",C++); if(num) printf("NO\n"); else printf("YES\n"); } return 0; }
