A - Calandar 2019 省赛补题

A - Calandar

简单的模拟，找日期，签到题
五个一循环

#include<stdio.h>
#include<iostream>
#include<string>
using namespace std;
typedef long long ll;
const string day[] = {"Monday", "Tuesday", "Wednesday", "Thursday", "Friday"};
int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        ll y1, m1, d1, y2, m2, d2, cur;
        string week;
        cin >> y1 >> m1>> d1 >> week >> y2 >> m2 >>d2;
        ll sub =  ((y2 - y1) * 360 + (m2 - m1) * 30 + d2 - d1) % 5;
        if(sub < 0)
        {
            sub += 5;
        }
        for(int i = 0; i < 5; i++)
            if(day[i] == week)
                cur = i;
cout<<day[(cur + sub) % 5]<<endl;
    }
    return 0;
}