Modular Inverse by Mr. Xcoder

while 1:
 a,n=map(int,raw_input().split());p,r=1,0;m=n
 while n:a,n,p,r=n,a%n,r,p-a/n*r
 print p%m

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

To protect the system from spam, please input your favorite sport (hint: I believe its name must start with 'g', case insensitive)

download

return to the top page