Write a program that takes as input four integers (b, m, c, n) with gcd(m, n) = 1 and computes an integer x with 0 ≤ x
x ≡ b (mod m) and x ≡ c (mod n).
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.