Submission #2868525
Source Code Expand
d = list(map(int,input().split())) e = list(map(int,input().split())) f = list(map(int,input().split())) k =0 for i in range(0,2): if d[i+1]-d[i]==e[i+1]-e[i]==f[i+1]-f[i]: k = k + 1 #print(k) if d[0]-e[0]==d[1]-e[1]==d[2]-e[2] and d[0]-f[0] == d[1]-f[1] == d[2]-f[2]: k = k+1 #print(k) if d[0] + f[2] == d[2] + f[0]: k = k +1 #print(k) if k == 4: print('Yes') else: print('No')
Submission Info
Submission Time | |
---|---|
Task | C - Takahashi's Information |
User | juppy |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 457 Byte |
Status | AC |
Exec Time | 18 ms |
Memory | 3064 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt |
All | in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
in01.txt | AC | 17 ms | 3064 KB |
in02.txt | AC | 17 ms | 3064 KB |
in03.txt | AC | 17 ms | 3064 KB |
in04.txt | AC | 17 ms | 3064 KB |
in05.txt | AC | 17 ms | 3064 KB |
in06.txt | AC | 17 ms | 3064 KB |
in07.txt | AC | 17 ms | 3064 KB |
in08.txt | AC | 17 ms | 3064 KB |
in09.txt | AC | 17 ms | 3064 KB |
in10.txt | AC | 17 ms | 3064 KB |
in11.txt | AC | 17 ms | 3064 KB |
in12.txt | AC | 17 ms | 3064 KB |
in13.txt | AC | 17 ms | 3064 KB |
in14.txt | AC | 17 ms | 3064 KB |
in15.txt | AC | 17 ms | 3064 KB |
in16.txt | AC | 17 ms | 3064 KB |
in17.txt | AC | 17 ms | 3064 KB |
in18.txt | AC | 17 ms | 3064 KB |
in19.txt | AC | 17 ms | 3064 KB |
in20.txt | AC | 17 ms | 3064 KB |
sample_1.txt | AC | 17 ms | 3064 KB |
sample_2.txt | AC | 18 ms | 3064 KB |
sample_3.txt | AC | 17 ms | 3064 KB |
sample_4.txt | AC | 17 ms | 3064 KB |