| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3880 |
| 2 | jiangly | 3669 |
| 3 | ecnerwala | 3654 |
| 4 | Benq | 3627 |
| 5 | orzdevinwang | 3612 |
| 6 | Geothermal | 3569 |
| 6 | cnnfls_csy | 3569 |
| 8 | jqdai0815 | 3532 |
| 9 | Radewoosh | 3522 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | adamant | 156 |
| 4 | maroonrk | 153 |
| 5 | -is-this-fft- | 148 |
| 5 | atcoder_official | 148 |
| 5 | SecondThread | 148 |
| 8 | Petr | 147 |
| 9 | nor | 144 |
| 9 | TheScrasse | 144 |
problem link here :- https://www.codechef.com/COOK97A/problems/GUZAC
for test case :- n=3 k=1 x=2 p1=999999999 the resultant answer is 3000000000(1000000000 + 1000000001+999999999) (as per all accepted codes), but should it not be 2999999997 (999999998+1000000000+999999999) as clearly given pi<=1000000000. I tried hard to understand but couldnt ! can anyone explain me this question ?
Recently, I read about treap and found it really amazing. But, from most of the sources im unable to understand its working . can anyone give me good link to understand treap and a list of some good questions so i get good drip over treap. thanks in advance.
