Hello cf, i can not submit any code. it gives unexpected error. plzz fix it
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 5 | Um_nik | 141 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 133 |
| 8 | maroonrk | 133 |
| 10 | qwexd | 129 |
Hello cf, i can not submit any code. it gives unexpected error. plzz fix it
Name: Range Updates and Sums
problem link : https://cses.fi/problemset/task/1735
code link : https://ideone.com/1wU6WV
What is wrong with my code ??
I was trying a sparse table problem in spoj called Miraculous. The link is: https://www.spoj.com/problems/TNVFC1M/
I was thinking to solve the problem using sparse table . But did not find an idea. So, can anyone help me to solve it or share the main idea of the problem?? Thanks in advance.
UCV2013B — Alice in Amsterdam, I mean Wonderland
This is a graph problem from spoj
Can anyone tell me how to solve it??
Link :https://www.spoj.com/problems/UCV2013B/
Thanks in advance
Hi folks!!! I am learning dynamic programming.I am a newbie. I am learning dp in recursive way. But i find great difficulty in iterative way. And sometimes i face tle or runtime error in recursive specially in cses problem set. So i want to learn dp in iterative way. But don't know how to. Can you guys tell me how to learn dp in iterative way as a beginner?? Thanks in advance.
problem statement: cses grid paths https://cses.fi/problemset/task/1638/ What is wrong with my code?? code: Link to this code: https://cses.fi/paste/d5d85fe7f661fdba3fd8f3/
I have started learning dijkstra algorithm but i can not solve any problem on any ojs. I don't know how to find second shortest path or these kinda problem . I just can figure out shortest path. How can i be an expert on dijkstra algo?
| Название |
|---|


