POJ1006、hdu1370

思路：中国剩余定理。纯粹的用暴力求逆元。

#include<iostream>
#include<string.h>
#include<string>
#include<algorithm>
#include<stdio.h>
#include<iomanip>
#include<cmath>
#include<map>
using namespace std;
void Find(int &x,int &y,int &z){
    while(23*28*x%33!=1){
        x++;
    }
    while(23*33*y%28!=1){
        y++;
    }
    while(28*33*z%23!=1){
        z++;
    }
}
int main(){
    int x,y,z;
    x=y=z=1;
    Find(x,y,z);
    int p,e,i,d,times;
    times=1;
    //int T;
    //cin>>T;  //hdu需要多这两行
    while(cin>>p>>e>>i>>d){
        if(p==-1&&e==-1&&i==-1&&d==-1){
            break;
        }
        int ans=(z*33*28*p+y*23*33*e+x*23*28*i-d+23*28*33)%(28*23*33);
        if(ans==0) ans=28*23*33;
        cout<<"Case "<<times++<<": the next triple peak occurs in "<<ans<<" days."<<endl;
    }
    return 0;
}