CRT Problem!!!

Правка en2, от Ismail_Alrifai, 2023-07-10 21:35:10

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, 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)