Submission #3025165


Source Code Expand

N = int(input())
a = list(map(int, input().split()))

def gcd(a, b):
  if b == 0:
    return a
  return gcd(b, a%b)

def lcm(a, b):
  return a*b//gcd(a,b)

alcm = a[0]
for i in a[1:]:
  alcm = lcm(alcm, i)

res = 0

for i in range(N):
  res += (alcm-1) % a[i]

print(int(res))

Submission Info

Submission Time
Task C - Modulo Summation
User aki85
Language Python (3.4.3)
Score 300
Code Size 296 Byte
Status AC
Exec Time 161 ms
Memory 3316 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 3
AC × 18
Set Name Test Cases
Sample sample_01, sample_02, sample_03
All 1_small_rand_0, 1_small_rand_1, 1_small_rand_2, 2_rand_0, 2_rand_1, 2_rand_2, 3_max_0, 3_max_1, 3_max_2, 4_prime_0, 4_prime_1, 4_prime_2, 5_hand_0, 5_hand_1, 5_hand_2, sample_01, sample_02, sample_03
Case Name Status Exec Time Memory
1_small_rand_0 AC 17 ms 3060 KB
1_small_rand_1 AC 17 ms 3060 KB
1_small_rand_2 AC 17 ms 2940 KB
2_rand_0 AC 26 ms 3060 KB
2_rand_1 AC 30 ms 3060 KB
2_rand_2 AC 20 ms 3060 KB
3_max_0 AC 71 ms 3316 KB
3_max_1 AC 69 ms 3316 KB
3_max_2 AC 69 ms 3316 KB
4_prime_0 AC 120 ms 3316 KB
4_prime_1 AC 108 ms 3316 KB
4_prime_2 AC 121 ms 3316 KB
5_hand_0 AC 161 ms 3316 KB
5_hand_1 AC 20 ms 3060 KB
5_hand_2 AC 20 ms 3316 KB
sample_01 AC 17 ms 3060 KB
sample_02 AC 17 ms 2940 KB
sample_03 AC 17 ms 3060 KB