Chinese remainder theorem by rotary-o

a,b,m;main(n){for(;a%n-b&&~a?a+=a<m*n?m:~a:~scanf("%d%d%d%d",&a,&b,&m,&n,a&&printf("%d\n",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