Submission #9619845
Source Code Expand
def gcd(a,b):
if a == 0:
return b
return gcd(b % a, a)
def lcm(a,b):
return (a*b) // gcd(a,b)
n = int(input())
arr = input() # takes the whole line of n numbers
a = list(map(int,arr.split(' ')))
l = a[0]
ans = 0
for i in range(n):
l = lcm(l, a[i])
for i in range(n):
ans = ans + l//a[i]
print(ans%1000000007)
Submission Info
| Submission Time | |
|---|---|
| Task | E - Flatten |
| User | ummretard |
| Language | Python (3.4.3) |
| Score | 500 |
| Code Size | 369 Byte |
| Status | AC |
| Exec Time | 1890 ms |
| Memory | 4084 KiB |
Judge Result
| Set Name | Sample | All | ||||
|---|---|---|---|---|---|---|
| Score / Max Score | 0 / 0 | 500 / 500 | ||||
| Status |
|
|
| Set Name | Test Cases |
|---|---|
| Sample | sample_01, sample_02, sample_03 |
| All | hand_01, hand_02, hand_03, max_01, max_02, max_03, max_04, random_01, random_02, random_03, random_04, random_05, random_06, random_07, random_08, sample_01, sample_02, sample_03 |
| Case Name | Status | Exec Time | Memory |
|---|---|---|---|
| hand_01 | AC | 17 ms | 3060 KiB |
| hand_02 | AC | 17 ms | 3060 KiB |
| hand_03 | AC | 17 ms | 3060 KiB |
| max_01 | AC | 920 ms | 4084 KiB |
| max_02 | AC | 1890 ms | 4084 KiB |
| max_03 | AC | 30 ms | 4084 KiB |
| max_04 | AC | 27 ms | 4084 KiB |
| random_01 | AC | 21 ms | 3060 KiB |
| random_02 | AC | 299 ms | 3700 KiB |
| random_03 | AC | 318 ms | 3700 KiB |
| random_04 | AC | 46 ms | 3188 KiB |
| random_05 | AC | 537 ms | 3956 KiB |
| random_06 | AC | 152 ms | 3444 KiB |
| random_07 | AC | 33 ms | 3060 KiB |
| random_08 | AC | 21 ms | 3060 KiB |
| sample_01 | AC | 17 ms | 3064 KiB |
| sample_02 | AC | 17 ms | 3060 KiB |
| sample_03 | AC | 17 ms | 3060 KiB |