POJ1006

来源:互联网 发布:java 圆周率算法 编辑:程序博客网 时间:2024/04/28 05:54
#include<iostream>#include<string>#include<math.h>using namespace std;int main(){int i,j,k,ncase;int p,e,intell,date;cin>>p>>e>>intell>>date;ncase=0;while(p!=-1){ncase++;for(i=p%23;i<=21252;i=i+23)if(abs(i-e)%28==0) if(abs(i-intell)%33==0){ cout<<"Case "<<ncase; cout<<": the next triple peak occurs in "; if(i>date) cout<<i-date; else       cout<<i-date+21252;         cout<< " days.\n"; cin>>p>>e>>intell>>date; break;}}return 0;}

0 0