Chinese remainder theorem by hallvabo

while~0:a,b,m,n=map(int,raw_input().split());print min([c for c in range(a,m*n,m)if c%n==b]or[-1])

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