Submission #3414655
Source Code Expand
P = input().split() N = int(P[0]) M = int(P[1]) K = int(P[2]) for i in range(0,N+1): for j in range(0,M+1): if((M - j) * i + (N - i) * j == K): print("Yes") exit() print("No")
Submission Info
Submission Time | |
---|---|
Task | B - fLIP |
User | pyu666 |
Language | Python (3.4.3) |
Score | 200 |
Code Size | 224 Byte |
Status | AC |
Exec Time | 287 ms |
Memory | 3060 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt, s3.txt, s4.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, 11.txt, 12.txt, 13.txt, 14.txt, 15.txt, 16.txt, 17.txt, 18.txt, 19.txt, 20.txt, 21.txt, 22.txt, 23.txt, s1.txt, s2.txt, s3.txt, s4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 27 ms | 2940 KB |
02.txt | AC | 73 ms | 3060 KB |
03.txt | AC | 253 ms | 2940 KB |
04.txt | AC | 287 ms | 3060 KB |
05.txt | AC | 234 ms | 2936 KB |
06.txt | AC | 130 ms | 3060 KB |
07.txt | AC | 17 ms | 3060 KB |
08.txt | AC | 19 ms | 2940 KB |
09.txt | AC | 18 ms | 2940 KB |
10.txt | AC | 18 ms | 2940 KB |
11.txt | AC | 17 ms | 2940 KB |
12.txt | AC | 17 ms | 2940 KB |
13.txt | AC | 17 ms | 2940 KB |
14.txt | AC | 17 ms | 3060 KB |
15.txt | AC | 17 ms | 2940 KB |
16.txt | AC | 17 ms | 3060 KB |
17.txt | AC | 17 ms | 2940 KB |
18.txt | AC | 287 ms | 2940 KB |
19.txt | AC | 17 ms | 2940 KB |
20.txt | AC | 17 ms | 2940 KB |
21.txt | AC | 249 ms | 2940 KB |
22.txt | AC | 17 ms | 3060 KB |
23.txt | AC | 17 ms | 3060 KB |
s1.txt | AC | 17 ms | 2940 KB |
s2.txt | AC | 17 ms | 2940 KB |
s3.txt | AC | 17 ms | 2940 KB |
s4.txt | AC | 17 ms | 2940 KB |