简单模拟 | 北邮OJ | 87. 日期

https://vpn.bupt.edu.cn/http/10.105.242.80/problem/p/87/
逗号打成句号wa了半天, 可以说是相当惊人了

/*
USER_ID: test#shizhuxiniubi
PROBLEM: 87
SUBMISSION_TIME: 2019-01-25 20:53:39
*/
#include <bits/stdc++.h>
#define FF(a,b) for(int a=0;a<b;a++)
#define F(a,b) for(int a=1;a<=b;a++)
#define LEN 510000
#define INF 1000000
#define bug(x) cout<<#x<<"="<<x<<endl;
 
using namespace std;
typedef long long ll;
 
int md[]={31,28,31,30,31,30,31,31,30,31,30,31};
 
int main()
{
//    freopen("./in","r",stdin);
    int N;
    scanf("%d",&N);
    while(N--){
        int y,m,d;
        scanf("%d:%d:%d",&y,&m,&d);
        bool rn=0;
        if(y%400==0 || (y%100!=0 && y%4==0) ){
            md[1]=29;
        }else md[1]=28;
        int ans=0;
        FF(i,m-1){
            ans+=md[i];
        }
        ans+=d;
        printf("%d\n",ans);
    }
    return 0;
}