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
- Count valid pairs in the array satisfying given conditions
- Check if elements of an array can be arranged satisfying the given condition
- 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 2^(2^A) % B
- Find value of (1^n + 2^n + 3^n + 4^n ) mod 5
- Find value of (n^1 + n^2 + n^3 + n^4) mod 5 for given n
- Find (a^b)%m where 'b' is very large
- Find the sum of the series 2, 5, 13, 35, 97...
- Find gcd(a^n, c) where a, n and c can vary from 1 to 10^9
- Find sum of the series 1-2+3-4+5-6+7.......
- Given two numbers a and b find all x such that a % x = b
- Find maximum value of x such that n! % (k^x) = 0
- Find two numbers whose sum and GCD are given
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to firstname.lastname@example.org. 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