# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
71665 | 2018-08-25T10:29:41 Z | team(#2232, comfile) | 천사의 모래시계 (FXCUP3_hourglass) | C++ | 4 ms | 676 KB |
#include <bits/stdc++.h> #define INF 100000000 using namespace std; int main(){ int n;scanf("%d",&n); int ans=INF; int i=0; while(1){ if((3*i)>n) break; if(!((n-3*i)%5)){ ans=min(ans,i+(n-3*i)/5); } i++; } if(ans>=INF) ans=-1; printf("%d\n",ans); return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 3 ms | 568 KB | Output is correct |
2 | Correct | 2 ms | 248 KB | Output is correct |
3 | Correct | 2 ms | 568 KB | Output is correct |
4 | Correct | 2 ms | 568 KB | Output is correct |
5 | Correct | 3 ms | 360 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 632 KB | Output is correct |
2 | Correct | 3 ms | 632 KB | Output is correct |
3 | Incorrect | 2 ms | 620 KB | Output isn't correct |
4 | Correct | 2 ms | 632 KB | Output is correct |
5 | Correct | 3 ms | 676 KB | Output is correct |
6 | Correct | 2 ms | 568 KB | Output is correct |
7 | Correct | 2 ms | 676 KB | Output is correct |
8 | Correct | 2 ms | 632 KB | Output is correct |
9 | Correct | 3 ms | 676 KB | Output is correct |
10 | Correct | 3 ms | 632 KB | Output is correct |
11 | Correct | 3 ms | 632 KB | Output is correct |
12 | Correct | 3 ms | 568 KB | Output is correct |
13 | Correct | 2 ms | 568 KB | Output is correct |
14 | Correct | 2 ms | 676 KB | Output is correct |
15 | Correct | 2 ms | 568 KB | Output is correct |
16 | Correct | 2 ms | 676 KB | Output is correct |
17 | Correct | 3 ms | 632 KB | Output is correct |
18 | Correct | 2 ms | 676 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 676 KB | Output is correct |
2 | Correct | 4 ms | 676 KB | Output is correct |
3 | Correct | 2 ms | 676 KB | Output is correct |
4 | Correct | 3 ms | 676 KB | Output is correct |
5 | Correct | 2 ms | 676 KB | Output is correct |
6 | Correct | 2 ms | 676 KB | Output is correct |
7 | Correct | 3 ms | 676 KB | Output is correct |
8 | Correct | 2 ms | 676 KB | Output is correct |
9 | Correct | 3 ms | 676 KB | Output is correct |
10 | Correct | 2 ms | 676 KB | Output is correct |
11 | Correct | 2 ms | 676 KB | Output is correct |
12 | Correct | 3 ms | 676 KB | Output is correct |