Prime Modular Inverse by xnor

while 1:a,m=map(int,raw_input().split());print pow(a,m-2,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