my own was plain on first three contests, it was interesting graph

category of people "I will never read Div2D"

it's easier, in D u've used approach from editorial?

lol, really.... solution of tourist and poor text description for Div2D have nothing in common.. except both are dp

I think programmers don't understand jokes if there are so many downvotes here under the announcement.

Good luck and have fun everyone!

it is a power of k from descending order

adedalic, sorry, but I really don't know how you can write such a complicated code in c++, but thank you for kotlin sample, although maybe some people don't know this language

why do we do strategyAns = min(strategyAns, caseAns); and not max pls help(Div2C)

lol, am I only one who solved C Div 2 using map<pair<int,int>,set<pair<int,int>>>?)) https://mirror.codeforces.com/contest/1293/submission/69836530

If someone looks for linear solution of D here it is https://ideone.com/nJhASn

https://mirror.codeforces.com/blog/entry/70779?#comment-556121 see this test case

I had same fail try test case 4 2 4 1 20 2 2 1 but still I have fail in this test.If you solved it pls help

yeah, nice solution, thx

http://ideone.com/5bc3Ib code if you don't understand any solutions and explanations of Div2 C problem like me(just brute force which shows you valid sequences)

even 5 ways: a1-a2, a1-a2(+-)1,a1-a2(+-)2