3.拳王阿里

#include <iostream>
#include <unordered_map>
using namespace std;
int main()
{
    unordered_map<string, int> DAY{
        {"monday", 0},
        {"tuesday", 1},
        {"wednesday", 2},
        {"thursday", 3},
        {"friday", 4},
        {"saturday", 5},
        {"sunday", 6}}; //map映射字符串和星期的数字, 为了方便所以从零开始
    int n;
    cin >> n;
    for (int i = 0; i < n; i++)
    {
        int day1, day2, beg, end;
        string begOrig, endOrig;
        cin >> begOrig >> endOrig >> day1 >> day2;
        beg = DAY[begOrig];                //...
        end = DAY[endOrig];                //map的访问方式
        bool flag = true;                  //标志有没有找到结果
        for (int i = day1; i <= day2; i++) //从第day1天到day2天找end星期
        {
            int curr = (i + beg - 1) % 7; //这天是星期几
            if (curr == end)              //找到了end的星期
            {
                if ((day2 - i) >= 7) //说明之后的星期还有多个结果
                {
                    cout << "many" << endl;
                }
                else //唯一结果
                {
                    cout << i << endl;
                }
                flag = false;
                break;
            }
        }
        if (flag) //未找到
        {
            cout << "impossible" << endl;
        }
    }
    return 0;
}