### Rezwan.Arefin01's blog

By Rezwan.Arefin01, history, 7 years ago,

The problems are now added in GYM — Bangladesh Olympiad in Informatics 2016 by rubabredwan The problems are pretty interesting. Those who are preparing for IOI should give a try.
If interested the standings of the main contest can be found here — BdOI 2016 Standings

• +24

| Write comment?
 » 7 years ago, # |   0 Problem B is pretty nice, albeit fairly easy. I remember seeing Problem C on an old COCI, like 2006/2007 or so. Thanks rubabredwan for taking the time to put the contest on Codeforces, it's interesting to see what other countries' olympiads look like. Is this the olympiad that chooses the IOI team?
 » 7 years ago, # | ← Rev. 3 →   +10 Unfortunately, I don't see any bounds for joy values on E :(Also, F is a version of this problem with lower bounds.
 » 7 years ago, # |   +5 i can't figure out solution of problem C.can someone give hints.
•  » » 7 years ago, # ^ | ← Rev. 2 →   +1 dp[i][j] — how many permutations with elements from 1 to i have exactly j inversions.The answer is .
 » 7 years ago, # |   0 Is editorial going to be published?
 » 7 years ago, # |   0 A memory limit of 32 MB on Problem E. Is there any specific reason for doing so ? I have a NlogN solution (time and memory), but it just fails to fit into the memory limits.
 » 7 years ago, # |   0 Can Problem D be solved using greedy by picking the best point every time? I keep getting wrong answer not sure if it can be solved in such a way or do I have a mistake in code. My code: https://ideone.com/NkRObU
•  » » 7 years ago, # ^ | ← Rev. 2 →   +1 I assume it is ideally meant to be a DP problem that can be solved only this way. The fact that K is as small as 50 gives a good hint, doesn't it ?
 » 5 years ago, # | ← Rev. 3 →   0 implementing a deque in problem a causes TLE in test 5. what can i do?