Submission #4042794
Source Code Expand
c = [] for i in range(3): c.append(list(map(int, input().split()))) flag = 1 for i in range(1, 3): if (c[0][0] - c[0][1] != c[i][0] - c[i][1]): flag = 0 if (c[0][1] - c[0][2] != c[i][1] - c[i][2]): flag = 0 if (c[0][2] - c[0][1] != c[i][2] - c[i][1]): flag = 0 if flag == 1: print("Yes") else: print("No")
Submission Info
Submission Time | |
---|---|
Task | C - Takahashi's Information |
User | ochikei |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 373 Byte |
Status | AC |
Exec Time | 17 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 | 3060 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 | 17 ms | 3064 KB |
sample_3.txt | AC | 17 ms | 3064 KB |
sample_4.txt | AC | 17 ms | 3064 KB |