| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3831 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | gamegame | 3386 |
| 10 | ksun48 | 3373 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 164 |
| 1 | maomao90 | 164 |
| 3 | Um_nik | 163 |
| 4 | atcoder_official | 160 |
| 5 | -is-this-fft- | 158 |
| 6 | awoo | 157 |
| 7 | adamant | 156 |
| 8 | TheScrasse | 154 |
| 8 | nor | 154 |
| 10 | Dominater069 | 153 |
CRT Problem!!!
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 ):
| 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) |
