Hi :)
Can anybody please describe how to solve this problem? Codeforces.com/A_Simple_Task
thanks a lot
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 164 |
| 2 | adamant | 150 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
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 |
|---|


