【FOJ】Problem 1605 Enjoy celebration

Problem 1605 Enjoy celebration.

题意

• 计算离福大校庆还剩多久，1958年建校，10月25日是校庆
• 输入：
  测试数据的数量N（0<N <= 2000）
  接下来的N行：Y，M，D，年，月，日，（1958 <= Y <= 3000 ）
• 输出：
  M days left for celebrating the Nth anniversary of the founding of Fuzhou University!
  M-剩余天数，N-第几次校庆

思路

• 年-1958，如果超过10.25号，就得多等一周年
• 累加天数即可

代码

#include<cstdio>
using namespace std;

int every_m_d[13][2] = {{-1,-1}, {31,31}, {28,29}, {31,31}, {30,30}, {31,31}, {30,30}, {31,31}, {31,31}, {30,30}, {31,31}, {30,30}, {31,31}};

int count_day(int y, int m1, int d1, int m2, int d2){	//计算一年在前的m1.d1到m2.d2的天数
    int count = 0, k;
    if(m1==m2)
        return d2-d1;
    ((y%4==0 && y%100!=0) || y%400==0) ? k=1 : k=0;
    count += every_m_d[m1][k] - d1;
    for(int i=m1+1; i<m2; i++)
        count += every_m_d[i][k];
    count += d2;
    return count;
}

int left_day(int y, int m, int d){
    if(m==10 && d==25)
        return 0;
    int k, count;
    if((m<10) || (m==10 && d<25))
        count = count_day(y, m, d, 10, 25);
    else{
        count = count_day(y, m, d, 12, 31);
        count++;	//12.31-1.1
        count += count_day(y+1, 1, 1, 10, 25);
    }
    return count;
}

int main(){
    int t, year, mon, day, m, n;
    scanf("%d", &t);
    while(t--){
        scanf("%d%d%d", &year, &mon, &day);
        n = year - 1958;
        if((mon>10) || (mon==10 && day>25))
            n++;
        m = left_day(year, mon, day);
        printf("%d days left for celebrating the %dth anniversary of the founding of Fuzhou University!\n", m, n);
    }
	return 0;
}