Hi :)
Can anybody please describe how to solve this problem? Codeforces.com/A_Simple_Task
thanks a lot
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 153 |
| 2 | nik_exists | 151 |
| 3 | maroonrk | 150 |
| 4 | maspy | 149 |
| 5 | AmShZ | 146 |
| 6 | Um_nik | 143 |
| 7 | Errichto | 139 |
| 8 | adamant | 135 |
| 9 | BledDest | 134 |
| 10 | cry | 130 |
Hi :)
Can anybody please describe how to solve this problem? Codeforces.com/A_Simple_Task
thanks a lot
Hi!
Please look at my code HHHEEERRREEE I found two wonders in my code:
1- I didn't include vector but didn't got COMPILATION ERROR <<
2- $@#%!%^ (OK)
How situation 1 is possible?
thanks a lot
hi :)
is it possible make all this operations with BIT?
1- add(l, r, val) >add a[l..r] value of val
2- sum(l, r) >calculate sum of a[l..r]
I thought it is impossible until saw this comment
I didn't understand it correctly :( can anybody explain the approach:)
Tks a lot
Hi!
can you please tell me why people use vector while deque do the same with much more features :(
Hello :-)
how can count total different path between one vertex to any other in GOOD ORDER
also how to count total paths between one vertex to an other vertex?
| Name |
|---|


