Problem with solving Ax+B mod M = 0I checked that gcd(a,m) == 1 ensuring they are coprime...
Problem with solving Ax+B mod M = 0I tried changing the else statement to: [code] int inv = inverse(a, m); int x0 = (m-b...
Problem with solving Ax+B mod M = 0I switched the parameters but my output's still incorrect... any insight?
Problem with solving Ax+B mod M = 0I'm given A, B, M and have to solve for x in several equations. My output is constantly incorrect an...
need help for printing BFS node sourceI feel like maybe I'm outputting stuff in a wrong order. Using this, I got: -1 -> 0 0-> 25 0-> 22 0...
This user does not accept Private Messages