We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
The Most Elegant Sequence
The Most Elegant Sequence
Sort by
recency
|
16 Discussions
|
Please Login in order to post a comment
Am I the only one who read the problem more than 10 times just to understand what the actual problem was?
When you have one hour to solve challenges, would help A LOT if it didn't take 20 minutes to read a understand what the problem is asking for. How about next time they send us on a scavenger hunt to find clues for each challenge, huh?
According to the editorial, the intended solution has time complexity of O((d^2 + n^2) * (2^n)), which means it is of the order 10^8. Does this always fit in the time limit?
Problem 3 is a way easier to understand than this...
Don't be task maker, if you cant describe it properly. Not every people have same intelligent like uwi or gennady, they even dont read the description :D