Submission #8799775

Source Code Expand

N, X = map(int, input().split())
ans = N
a, b = max(X, N-X), min(X, N-X)
while b:
    q, r = divmod(a, b)
    if r == 0:
        ans += b * (2 * q - 1)
    else:
        ans += b * 2 * q
    a, b = max(b, r), min(b, r)
print(ans)

Submission Info

Submission Time
Task B - Mysterious Light
User taq225
Language Python (3.4.3)
Score 500
Code Size 239 Byte
Status AC
Exec Time 17 ms
Memory 3064 KB

Judge Result

Set Name Sample Subtask All
Score / Max Score 0 / 0 300 / 300 200 / 200
Status
AC × 1
AC × 10
AC × 20
Set Name Test Cases
Sample sample-01.txt
Subtask sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt
All sample-01.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 02-01.txt, 02-02.txt, 02-03.txt, 02-04.txt, 02-05.txt, 02-06.txt, 02-07.txt, 02-08.txt, 02-09.txt, sample-01.txt
Case Name Status Exec Time Memory
01-01.txt AC 17 ms 3060 KB
01-02.txt AC 17 ms 2940 KB
01-03.txt AC 17 ms 3060 KB
01-04.txt AC 17 ms 2940 KB
01-05.txt AC 17 ms 2940 KB
01-06.txt AC 17 ms 2940 KB
01-07.txt AC 17 ms 3060 KB
01-08.txt AC 17 ms 3064 KB
01-09.txt AC 17 ms 2940 KB
02-01.txt AC 17 ms 3060 KB
02-02.txt AC 17 ms 2940 KB
02-03.txt AC 17 ms 3060 KB
02-04.txt AC 17 ms 2940 KB
02-05.txt AC 17 ms 3060 KB
02-06.txt AC 17 ms 3060 KB
02-07.txt AC 17 ms 3060 KB
02-08.txt AC 17 ms 3060 KB
02-09.txt AC 17 ms 3060 KB
sample-01.txt AC 17 ms 3060 KB