Submission #4051532


Source Code Expand

n, x = map(int, input().split())
A = [int(i) for i in input().split()]
D = []

for i in range(n):
    D.append(abs(x - A[i]))
    
def gcd(x, y):
    while y != 0:
        x, y = y, x % y
    return x

for i in range(n - 1):
    D[i + 1] = gcd(D[i], D[i + 1])
    
print(D[-1])

Submission Info

Submission Time
Task C - Skip
User Asymmetry
Language Python (3.4.3)
Score 300
Code Size 292 Byte
Status AC
Exec Time 117 ms
Memory 14224 KB

Judge Result

Set Name All Sample
Score / Max Score 300 / 300 0 / 0
Status
AC × 22
AC × 3
Set Name Test Cases
All hand_1, large_1, large_2, large_3, large_4, large_5, large_6, large_7, large_8, max_1, max_2, max_3, min_1, min_2, sample_01, sample_02, sample_03, small_1, small_2, small_3, small_4, small_5
Sample sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
hand_1 AC 17 ms 3064 KB
large_1 AC 32 ms 4660 KB
large_2 AC 38 ms 5264 KB
large_3 AC 34 ms 4864 KB
large_4 AC 17 ms 2940 KB
large_5 AC 17 ms 3064 KB
large_6 AC 17 ms 3064 KB
large_7 AC 17 ms 3060 KB
large_8 AC 17 ms 3060 KB
max_1 AC 115 ms 14224 KB
max_2 AC 117 ms 14224 KB
max_3 AC 116 ms 14224 KB
min_1 AC 17 ms 3064 KB
min_2 AC 17 ms 3064 KB
sample_01 AC 18 ms 3060 KB
sample_02 AC 17 ms 3060 KB
sample_03 AC 18 ms 3064 KB
small_1 AC 17 ms 3064 KB
small_2 AC 17 ms 3064 KB
small_3 AC 17 ms 2940 KB
small_4 AC 17 ms 3064 KB
small_5 AC 17 ms 3060 KB