Chinese remainder theorem by xnor

while 1:
 a,b,m,n=map(int,raw_input().split())
 while~a*(a%n-b):a=0-a/m/n|a+m
 print a

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