Submission #3602479
Source Code Expand
import math H, W = map(int, input().split()) if H % 3 == 0 or W % 3 == 0: print(0) exit() min_num = 100000000000 for i in range(1, H): a = i*W b = W//2 * (H-i) c = math.ceil(W/2) * (H-i) _max_num = max(a, max(b, c)) _min_num = min(a, min(b, c)) n = _max_num - _min_num if n < min_num: min_num = n for i in range(1, W): a = i*H b = H//2 * (W-i) c = math.ceil(H/2) * (W-i) _max_num = max(a, max(b, c)) _min_num = min(a, min(b, c)) n = _max_num - _min_num if n < min_num: min_num = n print(min_num)
Submission Info
Submission Time | |
---|---|
Task | C - Chocolate Bar |
User | taku689 |
Language | Python (3.4.3) |
Score | 0 |
Code Size | 611 Byte |
Status | WA |
Exec Time | 331 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt |
All | 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 0_04.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
0_00.txt | AC | 18 ms | 3064 KB |
0_01.txt | AC | 18 ms | 3064 KB |
0_02.txt | AC | 18 ms | 3064 KB |
0_03.txt | AC | 179 ms | 3064 KB |
0_04.txt | AC | 331 ms | 3064 KB |
1_00.txt | AC | 18 ms | 3064 KB |
1_01.txt | AC | 169 ms | 3064 KB |
1_02.txt | AC | 18 ms | 3064 KB |
1_03.txt | AC | 18 ms | 3064 KB |
1_04.txt | WA | 106 ms | 3064 KB |
1_05.txt | AC | 200 ms | 3064 KB |
1_06.txt | AC | 18 ms | 3064 KB |
1_07.txt | AC | 18 ms | 3064 KB |
1_08.txt | AC | 178 ms | 3064 KB |
1_09.txt | WA | 209 ms | 3064 KB |
1_10.txt | AC | 276 ms | 3064 KB |
1_11.txt | AC | 18 ms | 3064 KB |
1_12.txt | AC | 17 ms | 3064 KB |
1_13.txt | AC | 167 ms | 3064 KB |
1_14.txt | AC | 101 ms | 3064 KB |