Equation is ax — by = k Find non negative integers a,b such that above eq is satisfied and (a+b) is minimum possible. x,y,k are given non negative integers. Problem for reference :: https://www.codechef.com/problems/FLASH Also a general method for solving such equations . Note: I know the gcd logic which checks the soln exists. I bruteforced values of a but got TLE