Linear Congruences by nn

$0{a[++n]=$3
b[n]=+$5}!$0{for(m=b[j=1];j++<n;m=w/m)for(w=m*(z=b[j]);z;)z=m%(m=z)
for(i=-1;k<=n&&++i<m;)for(k=0;k++<n&&i%b[k]==a[k];);
k=n=0
print i<m?i" + "m"k":"no solutions"}

Note that non-ascii characters in the above source code will be escaped (such as \x9f).

download

return to the top page