计算一个前缀数组,注意
以及闰年的定义
四年一闰;百年不闰,四百年再闰
好多年没写过switch,我还是直接用数组处理来得直接一点
#include<iostream>
#include<string>
#include<string.h>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<map>
#include<queue>
using namespace std;
#define ll int
#define MAX 250
#define inf 10000000
int main() {
ll a, b, c;
ll bb[12] = { 0,31,28,31,30,31,30,31,31,30,31,30 }, d[12];
d[0] = 0;
for (int i = 1; i < 12; i++)
d[i] = d[i - 1] + bb[i];
while (cin >> a >> b >> c) {
ll sign = 0, days = 0;//sign=1 即闰年
if (a % 400 == 0 || (a % 4 == 0 && a % 100 != 0))sign = 1; //四年一闰;百年不闰,四百年再闰
if (sign&&b > 2)days = d[b - 1] + 1 + c;
else days = d[b - 1] + c;
cout << days << endl;
}
}