Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×

VoolDD5's blog

By VoolDD5, 10 years ago, In English

Hi :)
Can anybody please describe how to solve this problem? Codeforces.com/A_Simple_Task
thanks a lot

Full text and comments »

  • Vote: I like it
  • +3
  • Vote: I do not like it

By VoolDD5, 10 years ago, In English

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

Full text and comments »

  • Vote: I like it
  • -6
  • Vote: I do not like it

By VoolDD5, 10 years ago, In English

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

Full text and comments »

Tags bit
  • Vote: I like it
  • +3
  • Vote: I do not like it

By VoolDD5, 10 years ago, In English

Hi!
can you please tell me why people use vector while deque do the same with much more features :(

Full text and comments »

  • Vote: I like it
  • +12
  • Vote: I do not like it

By VoolDD5, 10 years ago, In English

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?


thanks in advance x)

Full text and comments »

  • Vote: I like it
  • -4
  • Vote: I do not like it

By VoolDD5, 10 years ago, In English
  • Hi:)
  • Can anyone please tell me what is Z-Algorithms? is it Important to know it for IOI?
  • thanks in advance :-) :-) :-)
  • BTW: how to go new line in codeforces blog?

Full text and comments »

  • Vote: I like it
  • +4
  • Vote: I do not like it