问题
Can someone tell me the efficient way to solve this problem ?
abc mod m a, b, c, and m are 32 bit int
where m is not a prime number and a is not coprime to m?I've looking for the answer, but haven't found it
There are some answered questions that familiar with this question, but none of them can explain my problem. Remember if
abc mod m != abc mod m
来源：https://stackoverflow.com/questions/26891957/how-to-calculate-abc-mod-n