《程序设计与算法（二）算法基础》《第一周》生理周期

向右看齐 2023-08-17 16:23 150阅读 0赞

![1234085-20190812222714366-834525248.png][]

![1234085-20190812222743854-1057081964.png][]

![1234085-20190812222806728-1770936568.png][]

![1234085-20190812222820440-367529443.png][]

#include<iostream>
    #include<cstdio>
    
    using namespace std;
    #define N 21252
    int main()
    {
        int p, e, i, d, caseNo = 0;
        // -1 代表输入结束
        while (cin >> p >> e >> i >> d && p != -1)
        {  
            ++caseNo;
            int k;
            for (k = d+1;(k - p) % 23;k++);
            for (;(k - e) % 28;k+=23); // 跳着取数，确保是p的倍数
            for (;(k - i) % 33;k+=28*23); // 跳着取数，确保是p和e的倍数
            cout << "Case" << caseNo << 
                ": the next triple peak occurs in " << (k - d) << " days " << endl;
        }
        return 0;
    }

转载于:https://www.cnblogs.com/focus-z/p/11343063.html

[1234085-20190812222714366-834525248.png]: /images/20230810/d6175a239f4d4693ab12a3e63a73920f.png
[1234085-20190812222743854-1057081964.png]: /images/20230810/ce2fbf182e2c4cc79a69919e51225357.png
[1234085-20190812222806728-1770936568.png]: /images/20230810/75dbce3382c54dfcb3f7cfbdd95d4c73.png
[1234085-20190812222820440-367529443.png]: /images/20230810/494ac9e3468e4c58b13c7f6b4239f1a7.png