#include #include #include #include #include #include // Yukicoder №635 自然門松列 // https://yukicoder.me/problems/no/635 // *********************** // for debug #define DEBUGd // ----------- #define NOP do{}while(0) #ifdef DEBUG #define TRACE(...) do{printf(__VA_ARGS__);fflush(stdout);}while(0) #define TRACECR do{putchar_unlocked('\n');fflush(stdout);}while(0) #else #define TRACE(...) NOP #define TRACECR NOP #endif #define PRINCR putchar_unlocked('\n') #define NOCR(strig) do{char *p;p=strchr(strig,'\n');if(p)*p='\0';}while(0) // The out-of-date function #define asctime(...) asctime_s(...) #define ctime(...) ctime_s(...) #define strlen(a) mystr_len(a) //#define fopen(...) fopen_s(...) //#define freopen(...) freopen_s(...) //#define rewind(a) fseek(a,0L,SEEK_SET) //#define setbuf(a,b) setvbuf(a,b,_IOFBF,BUFSIZ) // for stdio #define GETLINE(str) do{char *p;fgets(str,sizeof(str),stdin);p=strchr(str,'\n');if(p)*p='\0';}while(0) #define mygc(c) (c)=getchar() static char *GETWORD( char* str ); static char *GETWORD(char* str) {char c;char *cp;cp=&str[0];c=getchar_unlocked();while( c != EOF ){if((c==' ')||( c=='\n')) break;*cp++=c;c=getchar_unlocked();}*cp='\0';return &str[0];} #define GETINTS(a,b) {char s[34];int *ap=a;REP(i,b){GETWORD(s);*ap++=atoi(s);}} static int GETLINEINT(void) {char s[34];GETLINE(s);return atoi(s);} static int GETWORDINT(void) {char s[34];GETWORD(s);return atoi(s);} #define SWAP(type,a,b) do{type _c;_c=a;a=b;b=_c;}while(0) static int max(int a,int b){if(a>b){return a;}return b;} static int min(int a,int b){if(a*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;} static int cmpint_desc(const void *a,const void *b){if(*(int *)a<*(int *)b){return 1;}if(*(int *)a==*(int *)b){return 0;}return -1;} static int cmpchar_asc(const void *a,const void *b){if(*(char *)a>*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;} static int cmpchar_desc(const void *a,const void *b){if(*(char *)a<*(char *)b){return 1;}if(*(char *)a==*(char *)b){return 0;}return -1;} static int mystr_len(char *str){int i=0;do{if(str[i]=='\0')break;i++;if(i>9999)break;}while(1);return i;} static int countchar(char str[],char c,int limit ) {int cnt = 0;for(int i=0;i c ) ) return 2; // 門松 if( ( a > b )&&( b < c ) ) return 2; // 門松 if( ( a > b )&&( b > c ) ) return 3; // 降順 return 0; // ??? } else { return 0; // 同じ数値がある } } // *********************** int main() { int query; double a1,a2,a3; int m1,m2,m3; int modef,model; query = GETLINEINT(); REP(i,query) { a1 = (double)GETWORDINT(); a2 = (double)GETWORDINT(); a3 = (double)GETWORDINT(); m1 = GETWORDINT(); m2 = GETWORDINT(); m3 = GETWORDINT(); modef = kadomatu( a1, a2, a3 ); TRACE(":%d",modef); if( modef == 2 ) { YES(1); PRINCR; } else { int i =0; do{ a1 += (double)m1/10.; a2 += (double)m2/10.; a3 += (double)m3/10.; model = kadomatu( a1, a2, a3 ); TRACE("%d %d %d %d\n", (int)a1, (int)a2, (int)a3,model); if( modef != model ) TRACE("->%d",model); if( model == 2 ) break; if( model == (4 - modef) ) break; if( a1 >= 50200 ) break; if( a2 >= 50200 ) break; if( a3 >= 50200 ) break; } while(++i < 2002000 ); model = kadomatu( a1, a2, a3 ); if( model == 2 ) { YES(1); PRINCR; } else { if( modef == (4 - model) ) { YES(1); PRINCR; } else { YES(0); TRACE(" %d->%d\n",modef,model); PRINCR; } } } } return 0; }