The replay of the LU Inter-University contest is going to start on August 2nd, 2017 at 7PM BDT and will run for 5 hours.
Contest link: Link
Problem setters for the contest are: jAckAL_1586 Tanzir5 fsshakkhor TarifEzaz Spider004 tahmedge nurlansofiyev Punter I_See_You Kitorp
We hope everyone will find the problems very interesting to solve. Good luck and have fun.
Thanks. Contest Is Over.
Top 3 are:
1) lexuanan
2) sahedsohel
3) Matrix.code
Auto comment: topic has been updated by the_badcoder (previous revision, new revision, compare).
Auto comment: topic has been updated by the_badcoder (previous revision, new revision, compare).
Clash with CS Academy.
sorry for inconvenience.
Auto comment: topic has been updated by the_badcoder (previous revision, new revision, compare).
Was F(Yet Another Update Query) sqrt decompostion?
It can be solved using sqrt decomposition+ bitset(I did not implement it). idk if that is the intended solution.
I tried using sqrt decomposition. But wa :/
And the solutions are not open, So cant see others.
oops, sorry. bitset can't be used here
sqrt root decomposition should do the job. I was thinking complex.
Double_O Yes its sqrt decompo . Here is my solution (https://paste.ubuntu.com/25228360/) Although authors solution included BIT .
Just stumbled onto this while searching for something. I was the author of this problem. I am pretty sure I did not use BIT in the solution. Why do you think so? I_See_You
Bhaia I don't really remember why I said that. Probably a mistake. :/ Tanzir5
whats the fault in my code? problem C: https://toph.co/p/maximum-sum my solution link: http://ideone.com/0kJEbo yet I haven't found any counter case or any reason why it shows wrong answer. it is a convenience for me if one share one's code. Thanks in advance.
I have found it out.
Any Hint for problem H. Thanks in Advance
https://paste.ubuntu.com/25228371/ Code written by I_See_You