mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-11-27 20:56:37 +00:00
28 lines
550 B
C++
28 lines
550 B
C++
#include <iostream>
|
|
|
|
using std::cin;
|
|
using std::cout;
|
|
const char endl = '\n';
|
|
|
|
int t, p, e, i, d;
|
|
|
|
int gcd(int a, int b) {
|
|
return b ? gcd(b, a % b) : a;
|
|
}
|
|
|
|
int lcm(int a, int b) {
|
|
return a / gcd(a, b) * b;
|
|
}
|
|
|
|
int main() {
|
|
std::ios::sync_with_stdio(false);
|
|
|
|
while (cin >> p >> e >> i >> d, ~p && ~e && ~i && ~d) {
|
|
int l = 21252,
|
|
ans = (5544 * p + 14421 * e + 1288 * i - d + l) % l;
|
|
cout << "Case " << ++t << ": the next triple peak occurs in " << (ans ? ans : l) << " days." << endl;
|
|
}
|
|
|
|
return 0;
|
|
}
|