| # | User | Rating |
|---|---|---|
| 1 | tourist | 3757 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | maomao90 | 171 |
| 2 | awoo | 165 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | maroonrk | 155 |
| 6 | nor | 154 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 147 |
| 9 | orz | 146 |
| 10 | pajenegod | 145 |
Question here: https://www.codechef.com/practice/course/4-star-difficulty-problems/DIFF1900/problems/ICL1901?tab=statement
1st submission with just while True: https://www.codechef.com/viewsolution/1055683164
2nd submission running the same code just twice: https://www.codechef.com/viewsolution/1055683982
Why is it so that all combinations are exhausted in only 2 iterations?
Extra doubt:
Why and how does this solution work?: https://www.codechef.com/viewsolution/89676081
Question here: https://www.codechef.com/practice/course/4-star-difficulty-problems/DIFF1900/problems/SEGDIV?tab=statement
I'm intrigued about this submission over here: https://www.codechef.com/viewsolution/82916450
I have no idea why it works. The poster also just left out the proof part and simply wrote, "It's difficult to prove it". Is there any proof of this or is just conveniently satisfies for the given question's constraints? (n <= 500)
