Hello codeforces!↵
↵
I need helpinwith this problem: [UVa_11754](https://onlinejudge.org/external/117/11754.pdf)↵
↵
If all Ki = 1, we can use Chinese Remainder Theorem directly,Bbut the number of possible states is (Π Ki = 100^9)↵
↵
So can you help me in this problem?↵
↵
I believe that there isI believe there is a brute_force in itsolution but i couldn't find it ):
↵
I need help
↵
If all Ki = 1, we can use Chinese Remainder Theorem directly,
↵
↵
I believe that there is
