vudduu's blog

Codeforces Beta Round #67 (Div. 2), my solutions
By vudduu, 14 years ago, In English
Solution of the problem Problem A Life Without Zeros  (Math, Simulation, C++)
Solution of the problem Problem B Facetook Priority Wall (Strings, C++)
Solution of the problem Problem C Modified GCD (Math, C++)
Solution of the problem Problem D Big Maximum Sum (Interval Tree, DP, C++)
  • Vote: I like it
  • -18
  • Vote: I do not like it

14 years ago, # |
  Vote: I like it +4 Vote: I do not like it
Well, if u want to show some skills in a language, so why not to use its algorithms and features?
E.g. this is solution for C
→ Reply
14 years ago, # |
← Rev. 2   Vote: I like it 0 Vote: I do not like it
Got Runtime Error in Problem D, for the size of my array T (is a Interval Tree).
But, How many nodes will have? exists a function?
→ Reply
  • 14 years ago, # ^ |
      Vote: I like it +3 Vote: I do not like it
    Yes, it's provided that if you implement segment tree on an array, then you'll have no more than 4 * n  used elements in array. 
    → Reply
»
7 months ago, # |
  Vote: I like it 0 Vote: I do not like it

well well wel vv

→ Reply