Result: Accepted
Time: 6ms
Memory: 1092kB
#include <stdio.h>
#include <ctype.h>
#include <string.h>
#include <math.h>
#include <stdlib.h>
/*
struct wo
{
char num[6];
int score[3],all;
};
int cmp(const void *p,const void *q)
{
return (*(struct wo *)q)->all-(*(struct wo *)p)->all;
}
int main()
{
struct wo p[10000];
int n,i;
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%s %d %d %d",p[i].num,&p[i].score[0],&p[i].score[1],&p[i].score[2]);
p[i].all=p[i].score[0]+p[i].score[1]+p[i].score[2];
}
qsort(p,n,sizeof(struct wo),cmp);
int q;
scanf("%d",&q);
while(q--)
{
}
}*/
int main()
{
int a[3],b[3],i,t;
for(i=0;i<3;i++)scanf("%d",&a[i]);
for(i=0;i<3;i++)scanf("%d",&b[i]);
if(b[0]-a[0]==1||(a[0]-b[0]==6))
{
t=24*3600-a[1]*3600-a[2]+b[1]*3600+b[2];
if(t<=24*3600)printf("Y e s\n");
else printf("N o\n");
}
else if(b[0]==a[0])
{
if(a[1]>b[1])printf("N o\n");
else if(a[1]==b[1])
{
if(a[2]>b[2])printf("N o\n");
}
else printf("Y e s\n");
}
else printf("N o\n");
}