Can anyone suggest how can I approach this problem:-
https://www.codechef.com/FFC22019/problems/FFC219A
I have looked at few submissions, most of them are using the similar type of approach, but I'm not able to understand the concept behind it. Any help is appreciated.
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 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 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 155 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | BledDest | 145 |
It was a copied question from codeforces. Just take a look at this:-
https://codeforces.com/contest/622/problem/F .
Look at it's editorial if you want the slution approach.
Thanks
have you understood, I still haven't understood, can you please explain it in easy way if possible
I also got only the part when n < k+2, and trying to understand the part for n > k+1.
I tried lagrange interpolation (see geeksforgeeks or CP algorithm), as a similar problem appeared some months back in a long challenge(June challenge, 2019 i believe, div.1 6th problem), but to no avail as I couldn't get rid of TLE due to such tight constraints.... :(
https://www.hackerrank.com/contests/infinitum-mar14/challenges/summing-the-k-n-series/editorial