#programing

Chinese Remainder Theorem

We have Two arrays ans[0,1,----(n-1)] and rem[0,1,----(n-1)]. We have to find minimum value of x such that x%ans[0] = rem[0], x%ans[1] = rem[1], and so on. Chinese Remainder Theorem states that there always exist x which satisfy the given congruenc...