CRT Problem!!!

Правка en1, от Ismail_Alrifai, 2023-07-10 19:30:41

Hello codeforces!

I need help in 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)

So can you help me in this problem?

I believe that there is brute_force in it but i couldn't find it ):

Теги crt, number theory, brute force

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Ismail_Alrifai 2023-07-10 21:35:10 62
en1 Английский Ismail_Alrifai 2023-07-10 19:30:41 349 Initial revision (published)