AlexDmitriev's blog

By AlexDmitriev, history, 2 years ago, In English,

Tomorrow is GP of Dolgoprudny which is prepared by my colleagues and me.

Hope, you'll like the problems which we can discuss here after the contest.

Also, we've prepared mini-tutorial which I'll post here after the contest too.

Good luck!

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

»
2 years ago, # |
  Vote: I like it +14 Vote: I do not like it
»
2 years ago, # |
  Vote: I like it +22 Vote: I do not like it

My solutions for problems I had solutions.

A
B
C
D
E
F
G
H
J
K
»
2 years ago, # |
  Vote: I like it +18 Vote: I do not like it

Nice problem set. May I ask why do you make B with n = 104? I think it's more fair to have n = 5, 000 for O(n2) solution.

With n = 104, we should be extremely careful with the constant involved in the computation.

  • »
    »
    2 years ago, # ^ |
    Rev. 2   Vote: I like it +5 Vote: I do not like it

    It was made to prevent solutions with complexity. Sorry if you had to spend much time optimizing your solution.

»
2 years ago, # |
  Vote: I like it +15 Vote: I do not like it

Can you provide the contest link please?