Hello codeforces!
I need help with this problem: UVa_11754
If all Ki = 1, we can use Chinese Remainder Theorem directly, but the number of possible states is (Π Ki = 100^9)
I believe there is a brute_force solution but i couldn't find it ):
CRT Problem!!!
Hello codeforces!
I need help with this problem: UVa_11754
If all Ki = 1, we can use Chinese Remainder Theorem directly, but the number of possible states is (Π Ki = 100^9)
I believe there is a brute_force solution but i couldn't find it ):
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en2 | Ismail_Alrifai | 2023-07-10 21:35:10 | 62 | |||
en1 | Ismail_Alrifai | 2023-07-10 19:30:41 | 349 | Initial revision (published) |