1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
|
#include <cstdlib>
#include <algorithm>
#include <cstring>
#include <cctype>
#define INF 2000000000
using namespace std;
typedef long long ll;
int (){
int f=1,x=0;char c=getchar();
while(c<'0'||c>'9'){if(c=='-')f=-f;c=getchar();}
while(c>='0'&&c<='9')x=x*10+c-'0',c=getchar();
return f*x;
}
char dp[200][13][40]={0};
int days[]={0,31,28,31,30,31,30,31,31,30,31,30,31};
int run(int x,int y){
return (y==2&&x&&x%4==0);
}
void init(){
dp[101][11][3]=1;
int r1=0,r2=0;
for(int i=101;i>=0;i--)
for(int j=12;j>=1;j--)
for(int d=31;d>=1;d--){
if(i==101&&(j==12||(j==11&&d>=3)))continue;
if(d>days[j]+run(i,j))continue;
if(i==101&&(j>=11||(j==10&&d>4)))r1=-1;
else{
if(j==12)r1=dp[i+1][1][d];
else if(d<=days[j+1]+run(i,j+1))r1=dp[i][j+1][d];
else r1=-1;
}
if(d==days[j]+run(i,j)){
if(j==12)r2=dp[i+1][1][1];
else r2=dp[i][j+1][1];
}else r2=dp[i][j][d+1];
if(!r1||!r2)dp[i][j][d]=1;
else dp[i][j][d]=0;
}
}
void solve(){
int T=read(),yy,mm,dd;
while(T--){
yy=read(),mm=read(),dd=read();
printf("%sn",dp[yy-1900][mm][dd]==1?"YES":"NO");
}
}
int main(){
init();
solve();
return 0;
}
|
近期评论