# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
22086 | 삼*전자 그린픽스 (#42) | 시간과 날짜 (KRIII5P_1) | C++98 | 3 ms | 1116 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<stdio.h>
int n, m;
int a[99] = { 0,31,29,31,30,31,30,31,31,30,31,30,31 };
int main() {
int t;
scanf("%d", &t);
while (t--) {
scanf("%d %d", &n, &m);
int r1, r2;
r1 = r2 = 0;
if (n >= 0 && n < 24)
if (m >= 0 && m < 60)
r1 = 1;
if (n > 0 && n <= 12)
if (m > 0 && m <= a[n])
r2 = 1;
printf("%s %s\n", r1 ? "Yes" : "No", r2 ? "Yes" : "No");
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |