Submission #2381787
Source Code Expand
states = list(map(int,input().strip().split(' '))) sortedlist = sorted(states) diff0 = (sortedlist[2]-sortedlist[0])//2 diff1 = (sortedlist[2]-sortedlist[1])//2 newlist = [sortedlist[0]+2*diff0, sortedlist[1]+2*diff1, sortedlist[2]] def patternMatch(s): if 1==2*s[2]-s[1]-s[0]: return 2 elif 2==2*s[2]-s[1]-s[0]: return 1 elif 0==2*s[2]-s[1]-s[0]: return 0 print(patternMatch(newlist)+diff0+diff1)
Submission Info
Submission Time | |
---|---|
Task | C - Same Integers |
User | timoni |
Language | Python (3.4.3) |
Score | 300 |
Code Size | 453 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 | s1.txt, s2.txt, s3.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, s1.txt, s2.txt, s3.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | AC | 17 ms | 3064 KB |
02.txt | AC | 17 ms | 3064 KB |
03.txt | AC | 17 ms | 3064 KB |
04.txt | AC | 17 ms | 3064 KB |
05.txt | AC | 17 ms | 3064 KB |
06.txt | AC | 17 ms | 3060 KB |
07.txt | AC | 17 ms | 3064 KB |
08.txt | AC | 17 ms | 3064 KB |
09.txt | AC | 17 ms | 3064 KB |
10.txt | AC | 17 ms | 3064 KB |
11.txt | AC | 17 ms | 3064 KB |
12.txt | AC | 17 ms | 3064 KB |
13.txt | AC | 17 ms | 3064 KB |
s1.txt | AC | 17 ms | 3064 KB |
s2.txt | AC | 17 ms | 3064 KB |
s3.txt | AC | 17 ms | 3064 KB |