标签：occurs etc using logs 注意 pac ash esc 计算
本文版权归ljh2000和博客园共有，欢迎转载，但须保留此声明，并给出原文链接，谢谢合作。
本文作者：ljh2000
作者博客：http://www.cnblogs.com/ljh2000-jump/
转载请注明出处，侵权必究，保留最终解释权！
Description
Input
Output
Sample Input
0 0 0 0
0 0 0 100
5 20 34 325
4 5 6 7
283 102 23 320
203 301 203 40
-1 -1 -1 -1
Sample Output
Case 1: the next triple peak occurs in 21252 days.
Case 2: the next triple peak occurs in 21152 days.
Case 3: the next triple peak occurs in 19575 days.
Case 4: the next triple peak occurs in 16994 days.
Case 5: the next triple peak occurs in 8910 days.
Case 6: the next triple peak occurs in 10789 days.
Source
//It is made by ljh2000
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <ctime>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <string>
using namespace std;
typedef long long LL;
const int MOD = 21252;
int p,e,i,d,Case,ans;
inline int getint(){
int w=0,q=0; char c=getchar(); while((c<‘0‘||c>‘9‘) && c!=‘-‘) c=getchar();
if(c==‘-‘) q=1,c=getchar(); while (c>=‘0‘&&c<=‘9‘) w=w*10+c-‘0‘,c=getchar(); return q?-w:w;
}
inline void work(){
while(1) {
p=getint(); e=getint(); i=getint(); d=getint();
if(p==-1 || e==-1) break;
ans=5544*p+14421*e+1288*i; ans-=d; ans+=MOD; ans%=MOD;
if(ans==0) ans=MOD; Case++;
printf("Case %d: the next triple peak occurs in %d days.\n",Case,ans);
}
}
int main()
{
work();
return 0;
}
标签：occurs etc using logs 注意 pac ash esc 计算
原文地址：http://www.cnblogs.com/ljh2000-jump/p/6347762.html
