大数取模。
#pragma comment(linker, "/STACK:1024000000,1024000000") #include<cstdio> #include<cstring> #include<cmath> #include<algorithm> #include<vector> #include<map> #include<set> #include<queue> #include<stack> #include<iostream> using namespace std; typedef long long LL; const double pi=acos(-1.0),eps=1e-8; void File() { freopen("D:\in.txt","r",stdin); freopen("D:\out.txt","w",stdout); } template <class T> inline void read(T &x) { char c = getchar(); x = 0;while(!isdigit(c)) c = getchar(); while(isdigit(c)) { x = x * 10 + c - '0'; c = getchar(); } } const int maxn=10000010; char s[maxn]; int main() { int cas=1; while(~scanf("%s",s)) { int p1=0,p2=0; for(int i=0;s[i];i++) { p1=(p1*10+s[i]-'0')%73; p2=(p2*10+s[i]-'0')%137; } int ans=1; if(p1==0&&p2==0) ans=1; else ans=0; printf("Case #%d: ",cas++); if(ans) printf("YES "); else printf("NO "); } return 0; }