A - Calandar ZOJ - 4113

    xiaoxiao2025-04-19  22

    这个题嘛,和算时间的题差不多;

    #include <iostream> #define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); #include <cstdio> #include <string.h> using namespace std; char str[6][10]={"Monday","Tuesday","Wednesday","Thursday","Friday"}; typedef long long ll; int main() { ll t,n,k,res; scanf("%lld",&t); while(t--) { ll y1,m1,d1,y2,m2,d2; char s[10]; scanf("%lld%lld%lld%s",&y1,&m1,&d1,s); int tt=0; if(!strcmp(s,str[0])) { tt=0; } else if(!strcmp(s,str[1])) { tt=1; } else if(!strcmp(s,str[2])) { tt=2; } else if(!strcmp(s,str[3])) { tt=3; } else if(!strcmp(s,str[4])) { tt=4; } scanf("%lld%lld%lld",&y2,&m2,&d2); ll t1=y1*30*12+m1*30+d1; ll t2=y2*30*12+m2*30+d2; if(t1<=t2) { ll cha= t2-t1; cha =cha%5; tt=tt+cha; tt=tt%5; printf("%s\n",str[tt]); } else { ll cha= t2-t1; cha =cha%5; tt=tt+cha; tt=tt+5; tt=tt%5; printf("%s\n",str[tt]); } } // cout<<(-6%5)<<endl; return 0; }

     

    最新回复(0)