Submission #3769176

Source Code Expand

from fractions import gcd


def gcd_array(a):
    gg = gcd(a[0],a[1])

    for i in range(2, len(a)):
        gg = gcd(gg, a[i])
    return gg


n, x = (int(i) for i in input().split())

b = [abs(int(k) - x) for k in input().split()]

if len(b) == 1:
    print(b[0])
else:
    print(gcd_array(b))

Submission Info

Submission Time
Task C - Skip
User hirokizaka46
Language Python (3.4.3)
Score 300
Code Size 316 Byte
Status AC
Exec Time 98 ms
Memory 16280 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 36 ms 5052 KB
large_1 AC 46 ms 6696 KB
large_2 AC 49 ms 7316 KB
large_3 AC 47 ms 6924 KB
large_4 AC 36 ms 5052 KB
large_5 AC 37 ms 5052 KB
large_6 AC 37 ms 5052 KB
large_7 AC 37 ms 5052 KB
large_8 AC 36 ms 5052 KB
max_1 AC 96 ms 16280 KB
max_2 AC 98 ms 16080 KB
max_3 AC 98 ms 16256 KB
min_1 AC 37 ms 5052 KB
min_2 AC 37 ms 5052 KB
sample_01 AC 37 ms 5052 KB
sample_02 AC 37 ms 5052 KB
sample_03 AC 37 ms 5052 KB
small_1 AC 37 ms 5052 KB
small_2 AC 38 ms 5052 KB
small_3 AC 37 ms 5052 KB
small_4 AC 37 ms 5052 KB
small_5 AC 36 ms 5052 KB