Run ID:108944
提交时间:2025-01-23 17:16:26
#include <iostream> using namespace std; int main() { int p, e, i, d; cin >> p >> e >> i >> d; // 从d + 1开始搜索 int day = d + 1; while (true) { // 检查是否满足三个同余条件 if ((day - p) % 23 == 0 && (day - e) % 28 == 0 && (day - i) % 33 == 0) { break; // 找到满足条件的日子 } day++; } // 输出结果 cout << "the next triple peak occurs in " << (day - d) << " days." << endl; return 0; }