|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||512 MB||213||29||16||9.195%|
Euclid’s algorithm is one of the oldest algorithms known to mankind. It is used to find greatest common divisor of two given numbers. Your program should also take two numbers and find a greatest common divisor. And may Euclid be with you.
I give you two positive integers d and k. Your task is to find the largest integer that divides (a + d)k − ak for every positive integer a.
The only line contains two integers d and k (1 ≤ d, k < 10100).
Print a single integer — the largest integer that divides (a + d)k − ak for every positive integer a.