how to solve equation ??

Revision en2, by sanket407, 2016-10-06 15:26:22

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 give 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

Tags equation, solve

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English sanket407 2016-10-06 15:26:22 5 Tiny change: 'ASH\nAlso a general' -> 'ASH\nAlso give a general'
en1 English sanket407 2016-10-06 15:25:52 403 Initial revision (published)