Prime Modular Inverse by teebee

import java.util.*;enum P{P;System z;{for(Scanner s=new Scanner(;s==s;)z.out.println(s.nextBigInteger().modInverse(s.nextBigInteger()));}}

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)


return to the top page