### GuralTOO's blog

By GuralTOO, history, 3 years ago, ,

I am glad to remind you that this Saturday will be held 3-rd round of Croatian contest.
I strongly recommend you to participate, as coci is one of the best IOI style competitions.
Hope for discussion of the problems after the round!

• +73

 » 3 years ago, # |   +45 6 tasks, 3 hours, no-feedback IOI style!
•  » » 3 years ago, # ^ |   +10 PROBLEMS (the main part of each contest) are IOI stylish
 » 3 years ago, # |   +3 Oh no contest is clashing with Codechef Lunch time :(
•  » » 3 years ago, # ^ |   +10 Yes, I also feel really sad about that.
 » 3 years ago, # |   +10 Just reminder.2 hours left, enjoy the contest and try to have fun ;)
 » 3 years ago, # |   +1 How to apply DP+BITMASK for C problem?
•  » » 3 years ago, # ^ |   +5 my solution:the state is dp[mask] where mask value is at most (2^n)-1 (I started counting form 0)in this mask if the iTH bit was ON this means the iTH glass is not empty.if the number of the turned on bits is k the answer is zero.or you will apply two "for" loops on this mask..let's say: for(int i=0;(1<
•  » » » 3 years ago, # ^ |   0 It seems to me something like (2^n)*(2^n). How about 2^n*n^2 solution?
•  » » » » 3 years ago, # ^ |   0 It's actually n*n*(2^n) because you will do the operation for every mask once and every operation is O(n^2) and the number of masks is 2^n :D(Note that I used an array to store results so I don't have to calculate the answer for every mask more than one time).
•  » » 3 years ago, # ^ |   +1 My really easy solution:http://pastebin.com/4v3sZvk7
•  » » » 3 years ago, # ^ | ← Rev. 3 →   0 What did you mean, when you wrotevector < int> bit; // bits of our num?Is num, i?
•  » » » » 3 years ago, # ^ |   +1 Yes