# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
71723 | 2018-08-25T13:37:12 Z | 유애나(#2242, kdh9949) | 천사의 모래시계 (FXCUP3_hourglass) | C++17 | 3 ms | 740 KB |
#include <bits/stdc++.h> using namespace std; int main(){ int n, dp[5001]; scanf("%d", &n); dp[0] = 0; dp[1] = dp[2] = dp[4] = 9999; dp[3] = 1; for(int i = 5; i <= n; i++) dp[i] = min(dp[i - 3], dp[i - 5]) + 1; printf("%d\n", dp[n] > n ? -1 : dp[n]); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 520 KB | Output is correct |
2 | Correct | 3 ms | 520 KB | Output is correct |
3 | Correct | 3 ms | 356 KB | Output is correct |
4 | Correct | 2 ms | 248 KB | Output is correct |
5 | Correct | 2 ms | 520 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 740 KB | Output is correct |
2 | Correct | 2 ms | 604 KB | Output is correct |
3 | Correct | 3 ms | 740 KB | Output is correct |
4 | Correct | 2 ms | 740 KB | Output is correct |
5 | Correct | 3 ms | 740 KB | Output is correct |
6 | Correct | 2 ms | 524 KB | Output is correct |
7 | Correct | 2 ms | 740 KB | Output is correct |
8 | Correct | 3 ms | 740 KB | Output is correct |
9 | Correct | 3 ms | 740 KB | Output is correct |
10 | Correct | 3 ms | 740 KB | Output is correct |
11 | Correct | 2 ms | 740 KB | Output is correct |
12 | Correct | 2 ms | 740 KB | Output is correct |
13 | Correct | 2 ms | 740 KB | Output is correct |
14 | Correct | 3 ms | 520 KB | Output is correct |
15 | Correct | 2 ms | 740 KB | Output is correct |
16 | Incorrect | 2 ms | 616 KB | Output isn't correct |
17 | Correct | 3 ms | 740 KB | Output is correct |
18 | Correct | 3 ms | 548 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 740 KB | Output is correct |
2 | Correct | 3 ms | 740 KB | Output is correct |
3 | Correct | 3 ms | 740 KB | Output is correct |
4 | Correct | 2 ms | 740 KB | Output is correct |
5 | Correct | 2 ms | 740 KB | Output is correct |
6 | Correct | 2 ms | 740 KB | Output is correct |
7 | Correct | 3 ms | 740 KB | Output is correct |
8 | Correct | 3 ms | 740 KB | Output is correct |
9 | Correct | 3 ms | 740 KB | Output is correct |
10 | Correct | 2 ms | 740 KB | Output is correct |
11 | Correct | 2 ms | 740 KB | Output is correct |
12 | Correct | 2 ms | 740 KB | Output is correct |