Redirecting to
NADOS

Extended Euclidean Algorithm

You have been given two Integers a and b. you need to find an integral solution of x and y such that a*x + b*y= gcd(a,b).
It can be proven that solution always exist.
Input Format
The first line contains 2 integer a and b
Output Format
output integral value of x and y in a single line.
Question Video
Constraints
1 <= a, b <= 10^6
Sample Input
34
24
Sample Output
5 -7


  • Asked in Companies
  • Related Topics






Video Solution

Code Solution

Run
 
Run
Id Name