# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
71802 | 2018-08-25T16:12:55 Z | 내일_개학이다_ㅠㅠ(#2253, mAng0) | 천사의 모래시계 (FXCUP3_hourglass) | C++17 | 3 ms | 656 KB |
#include<bits/stdc++.h> using namespace std; int main(){ int n; scanf("%d", &n); if(n == 4) printf("-1\n"); else if(n == 7) printf("-1\n"); else if(n%5 == 0) printf("%d\n", n/5); else if(n%5 == 1) printf("%d\n", n/5+1); else if(n%5 == 2) printf("%d\n", n/5+2); else if(n%5 == 3) printf("%d\n", n/5+1); else if(n%5 == 4) printf("%d\n", n/5+2); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 476 KB | Output is correct |
2 | Correct | 3 ms | 476 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 3 ms | 520 KB | Output is correct |
5 | Correct | 2 ms | 476 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 656 KB | Output is correct |
2 | Correct | 2 ms | 656 KB | Output is correct |
3 | Correct | 2 ms | 656 KB | Output is correct |
4 | Correct | 3 ms | 656 KB | Output is correct |
5 | Correct | 2 ms | 656 KB | Output is correct |
6 | Correct | 3 ms | 656 KB | Output is correct |
7 | Correct | 2 ms | 656 KB | Output is correct |
8 | Correct | 3 ms | 656 KB | Output is correct |
9 | Correct | 2 ms | 656 KB | Output is correct |
10 | Correct | 3 ms | 656 KB | Output is correct |
11 | Correct | 2 ms | 656 KB | Output is correct |
12 | Correct | 2 ms | 656 KB | Output is correct |
13 | Incorrect | 2 ms | 656 KB | Output isn't correct |
14 | Correct | 3 ms | 656 KB | Output is correct |
15 | Correct | 2 ms | 656 KB | Output is correct |
16 | Correct | 2 ms | 656 KB | Output is correct |
17 | Correct | 3 ms | 656 KB | Output is correct |
18 | Correct | 2 ms | 656 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 656 KB | Output is correct |
2 | Correct | 3 ms | 656 KB | Output is correct |
3 | Correct | 2 ms | 656 KB | Output is correct |
4 | Correct | 2 ms | 656 KB | Output is correct |
5 | Correct | 3 ms | 656 KB | Output is correct |
6 | Correct | 2 ms | 656 KB | Output is correct |
7 | Correct | 2 ms | 656 KB | Output is correct |
8 | Correct | 2 ms | 656 KB | Output is correct |
9 | Correct | 3 ms | 656 KB | Output is correct |
10 | Correct | 2 ms | 656 KB | Output is correct |
11 | Correct | 3 ms | 656 KB | Output is correct |
12 | Correct | 3 ms | 656 KB | Output is correct |