中国剩余定理模数互质的情况模板（poj1006

http://poj.org/problem?id=1006

#include <iostream>
#include <cstdio>
#include <queue>
#include <algorithm>
#include <cmath>
#include <cstring>
#define inf 2147483647
#define N 1000010
#define p(a) putchar(a)
#define For(i,a,b) for(long long i=a;i<=b;++i)
//by war
//2019.8.8
using namespace std;
long long p,e,i,d,ans,m,x,y,cnt;
long long a[],b[];
void in(long long &x){
    long long y=;char c=getchar();x=;
    while(c<''||c>''){if(c=='-')y=-;c=getchar();}
    while(c<=''&&c>=''){ x=(x<<)+(x<<)+c-'';c=getchar();}
    x*=y;
}
void o(long long x){
    if(x<){p('-');x=-x;}
    if(x>)o(x/);
    p(x%+'');
}

void exgcd(long long a,long long b,long long &x,long long &y){
    if(!b){
        x=;y=;
        return ;
    }
    exgcd(b,a%b,y,x);
    y-=a/b*x;
}

signed main(){
    a[]=;a[]=;a[]=;
    a[]=a[]*a[]*a[];
    while(cin>>b[]>>b[]>>b[]>>d&&(b[]!=-)){
        ans=;
        For(i,,){
            m=a[]/a[i];
            exgcd(m,a[i],x,y);
            x=(x%a[i]+a[i])%a[i];
            ans=(ans+b[i]*m*x)%a[];
        }
        ans=((ans-d)%a[]+a[])%a[];
        if(ans==)
            ans=a[];
        cout<<"Case "<<++cnt<<": the next triple peak occurs in "<<ans<<" days."<<endl;
    }
    return ;
}