Hi :)
Can anybody please describe how to solve this problem? Codeforces.com/A_Simple_Task
thanks a lot
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
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 |
---|