| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | Um_nik | 3396 |
| # | User | Contrib. |
|---|---|---|
| 1 | Um_nik | 162 |
| 2 | cry | 161 |
| 3 | maomao90 | 160 |
| 4 | -is-this-fft- | 159 |
| 5 | awoo | 158 |
| 6 | atcoder_official | 157 |
| 7 | nor | 155 |
| 7 | adamant | 155 |
| 9 | maroonrk | 152 |
| 10 | Dominater069 | 149 |
In last night's contest, I didn't come up with the correct solution to problem C. I used many large integers, instead of the least common multiple. But it really worked!
Can anyone hack it?
English is not my native language; please excuse typing errors.
Auto comment: topic has been updated by weily (previous revision, new revision, compare).
Your solution is correct. Clearly your solution never prints a solution when there is none, so the only interesting question is whether your solution ever prints $$$-1$$$ when a solution exists.
As mentioned in the editorial, there is a solution if and only if $$$\sum_{i = 1}^n \frac{1}{k_i} < 1$$$. There are only 24269653 such arrays under the constraints of the problem ($$$k_i \le 20$$$). I simply ran your program on all those arrays and found no countertest. So it seems that trying 200 values is sufficient under the constraints of this problem.