| # | User | Rating |
|---|---|---|
| 1 | tourist | 3843 |
| 2 | jiangly | 3705 |
| 3 | Benq | 3628 |
| 4 | orzdevinwang | 3571 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | jqdai0815 | 3530 |
| 8 | ecnerwala | 3499 |
| 9 | gyh20 | 3447 |
| 10 | Rebelz | 3409 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 159 |
| 5 | maroonrk | 154 |
| 5 | nor | 154 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 147 |
| 9 | orz | 145 |
| 10 | pajenegod | 144 |
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) |
