Problem Statistics
Solved Member: 13 Submission: 121 User Tried: 13Statement:
Task:
Input:Output:
HINT:
C/C++ | 回傳值 | stack | pot | 解釋 |
---|---|---|---|---|
n = Init(); | 15 | 0 | 1 | n=15 |
Alois(2); | - | 0 | 2 | 你將Pot * 2 |
Byteasar(); | 2 | 0 | 4 | 程式將 pot 變成2倍 |
Alois(3); | - | 0 | 12 | 你將 pot 變成 3 倍 |
Byteasar(); | 1 | 12 | 1 | 程式將 12 個石頭移到stack,pot只剩1顆石頭 |
Alois(2); | - | 12 | 2 | 你將 pot * 2 |
Byteasar(); | 3 | 12 | 6 | 程式將 pot 變成3倍 |
Alois(1); | - | 18 | 1 | Pot以及stack的石頭總數超過 15。你將pot的石頭移到stack |
Source:
POI 19 Stage 3Problem Setter
hanhan0912Testdata:
Test | Time | Memory | Score |
---|---|---|---|
0 | 1000ms | 131072kb | |
1-ocen | 1000ms | 131072kb | |
1 | 3000ms | 131072kb | 5 |
2-ocen | 1000ms | 131072kb | |
2 | 3000ms | 131072kb | 5 |
3-ocen | 5000ms | 131072kb | |
3 | 3000ms | 131072kb | 5 |
4 | 3000ms | 131072kb | 5 |
5 | 3000ms | 131072kb | 5 |
6 | 3000ms | 131072kb | 5 |
7 | 3000ms | 131072kb | 5 |
8 | 3000ms | 131072kb | 5 |
9 | 3000ms | 131072kb | 5 |
10 | 3000ms | 131072kb | 5 |
11 | 3000ms | 131072kb | 5 |
12 | 3000ms | 131072kb | 5 |
13 | 3000ms | 131072kb | 5 |
14 | 3000ms | 131072kb | 5 |
15 | 3000ms | 131072kb | 5 |
16 | 3000ms | 131072kb | 5 |
17 | 3000ms | 131072kb | 5 |
18 | 3000ms | 131072kb | 5 |
19 | 3000ms | 131072kb | 5 |
20 | 3000ms | 131072kb | 5 |
NeoHOJ — The new era of HOJ
頁面讀取時間: 0.0120 秒,使用記憶體: 0.46MB 。
GitHub