Hello Everyone, I am trying to submit problems here, but unfortunately i am not able to submit. When i click the submit button, the page keeps connecting/loading and i am not redirected to any page and finally "Page not found" message is printed on the screen ! I am trying from last 2 days but not able to submit any problems ! Please anyone help me resolving the issue ! I have tried using the different browser as well but that does'nt works too ! All other pages are working fine on codeforces but only "submit page is not working" ! Thanks !

I am not getting idea on the problem of dynamic programming. I am posting the link of question. Someone please help. Thnaks in advamce.Here is the link

Can anyone help me on the following problem of dynamic programming.Problem statement is as follows: Given a number n find the least number of perfect square numbers sum needed to get n. E.g.

n = 12, return 3 (4 + 4 + 4) = (2^2 + 2^2 + 2^2) NOT (3^2 + 1 + 1 + 1)

n =6, return 3(4 + 1 + 1) = (2^2 + 1^2 + 1^2)

Can anyone help me in dp problem. problem statement is as following. Find how many numbers of length n are there such that each number is at least 4 smaller/greater than the number before and after it.

E.g. if n = 5, such numbers are 39518, 15951, etc.

Hello codeforces, I am not able to understand the solution of this problem. Problem link is [http://mirror.codeforces.com/contest/479/problem/E]. Solution is not very clear. In solution it is mentioned that dp[i][j] can be calculated in O(1) using famous technique called "partial sums". I googled it but I could not find anything. Please help me in solution and also mention about that technique. Thanks in advance.