# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22134 | 2017-04-29T11:11:42 Z | 연습대회 팀 네임은 수정할 수 있을까?(#1024, qja0950) | None (KRIII5P_1) | C++14 | 0 ms | 1116 KB |
#include <stdio.h> #include <algorithm> #include <vector> #include <functional> #include <set> #include <map> #include <queue> #include <tuple> #include <string.h> using namespace std; #define rep(i,n) for(int (i)=0;(i)<(int)(n);(i)++) typedef long long ll; int day[13] = {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}; int main() { int TC; scanf("%d", &TC); while(TC--) { int x, y; scanf("%d%d", &x, &y); if(x >= 0 && x <= 23 && y >= 0 && y <= 59) printf("Yes "); else printf("No "); if(x >= 1 && x <= 12 && day[x] >= y) printf("Yes\n"); else printf("No\n"); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Partially correct | 0 ms | 1116 KB | Output is partially correct |