When Codeforces runs tests on your solution code for dynamic programming questions, what's the point of writing a dynamic programming algorithm when every time it runs your program none of the values from the previous cases are stored? I ran my Python dynamic programming algorithms and realized Codeforces conducts each test like the first one, with no values stored, so the time complexity is the same as if dynamic programming were not used. That also often causes the time limit for some of the tests to be exceeded although the program could be executed in 30 ms if previously stored values were used.

New contributor
user389532 is a new contributor to this site. Take care in asking for clarification, commenting, and answering. Check out our Code of Conduct.
  • 1
    \$\begingroup\$ Welcome to Code Golf! This site's for coding challenges themselves, or tips on solving them, rather than Q&A about related sites. Unfortunately, I don't think there's another site on the network where this question would be on topic. \$\endgroup\$ Jan 15 at 5:13
  • 3
    \$\begingroup\$ You should probably direct this to the CF forums. \$\endgroup\$
    – hyper-neutrino
    Jan 15 at 5:15