The rating related problem is still there.

Someone said, " Dynamic Programming is easy to learn, but difficult to master. And by "learn" I mean that you know some basic theory and have solved a DP problem. If you know how to find Fibonacci numbers in O(n) time, then yes, you know DP ".

I was wondering that Fibonacci is so easy that should it be even considered a DP problem ?

Like, when I was given the formula fib[i] = fib[i-1] + fib[i-2] , I was not even told that this is DP.

What are your thoughts ?

P.S.: If someone can suggest how to master DP, it would be helpful.

I got TLE with GNU C++20 (64) : 158299729

And AC with GNU C++17 : 158299827

You can check that both the submissions are exactly same.

Also, I custom tested 158299729 and found out that it is taking 3 seconds.

Can anyone tell the main difference between these two versions?

I am getting WA on test 2 on 1584th token, so I can't see the test case, also cfstress is also not able to find any failing test case.

Can anyone tell where my code is wrong or on which test case it fails.

Problem : 1680C - Двоичная строка Submission : 157821797

Please Help!!

I recently found out how the friends system work on Codeforces.

First I thought there would be some friend request and then accept system, but there is not.

It's simply a way to stalk someone ;)

Gentle Suggestion to MikeMirzayanov : The "Friend of" should be changed to "Followers" . So that it will show something like "Followers : 43,611 users" . As "Friend of: 43,611 users" is giving wrong interpretation that tourist is friend of that many users ;)

What are your thoughts ?

How to view the test cases which come after ...

It's very annoying that the cases on which the code fails are not on top and are too down that they are not visible.

Please help if there is some way.