Prime Modular Inverse by mitchs

n,p;main(r){for(;n<2?r=!printf(""-n*3,r)<scanf("%u%u\n",&n,&p):1;n=p%n)r=p-p/n*1LL*r%p;}

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