Given a, b and n. Find x and y that satisfies ax + by = n. Print any of the x and y satisfying the equation
Input : n=7 a=2 b=3 Output : x=2, y=1 Explanation: here x and y satisfies the equation Input : 4 2 7 Output : No solution
We can check if any solutions exists or not using Linear Diophantine Equations, but here we need to find out the solutions for this equation, so we can simply iterate for all possible values from 0 to n as it cannot exceed n for this given equation. So solving this equation with pen and paper gives y=(n-ax)/b and similarly we get the other number to be x=(n-by)/a.If none of the values satisfies the equation, at the end we print “no solution”
x = 2, y = 1
- Count of numbers satisfying m + sum(m) + sum(sum(m)) = N
- Check if elements of an array can be arranged satisfying the given condition
- Count valid pairs in the array satisfying given conditions
- Find value of (n^1 + n^2 + n^3 + n^4) mod 5 for given n
- Find 2^(2^A) % B
- Find the value of f(n) / f(r) * f(n-r)
- Find the value of max(f(x)) - min(f(x)) for a given F(x)
- Find value of (1^n + 2^n + 3^n + 4^n ) mod 5
- Find (1^n + 2^n + 3^n + 4^n) mod 5 | Set 2
- Find gcd(a^n, c) where a, n and c can vary from 1 to 10^9
- Find the value of N when F(N) = f(a)+f(b) where a+b is the minimum possible and a*b = N
- Find larger of x^y and y^x
- Find the sum of all multiples of 2 and 5 below N
- Find (a^b)%m where 'b' is very large
- Find the sum of series 3, 7, 13, 21, 31....
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : vt_m