### codeforces2k19's blog

By codeforces2k19, history, 12 months ago, ,

Hello,can any one tell me where I am doing wrong in my code to solve the problem:

https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=650&page=show_problem&problem=3102

CODE:

https://rextester.com/QHGO40661

My code is failing 2 of the 53 test cases.

• -3

By codeforces2k19, history, 12 months ago, ,

I came across the solution to the problem:

http://codeforces.com/problemset/problem/189/A

can anyone explain me what is the approach to get this recursive relation(I am a beginner):

ll fun(ll n)

{

if(n<0)

return INT_MIN;

if(n==0)

return 0;

if(dp[n]!=-1)

return dp[n];

dp[n]=max(fun(n-a)+1,max(fun(n-b)+1,fun(n-c)+1));

return dp[n];

}

• -3

By codeforces2k19, history, 12 months ago, ,

Please explain me how to approach this problem(I am a beginner): http://codeforces.com/contest/1167/problem/C

• +4

By codeforces2k19, history, 13 months ago, ,

Hi everyone, I am kind of new to Code forces but I have a doubt in regards of my submission to Problem 2A. Winner, the code always fail on test 10 returning a wrong answer.I am not able to resolve the problem.I think i am misinterpreting the problem....someone please explain the problem in detail especially this-> "if two or more players have the maximum number of points (say, it equals to m) at the end of the game, than wins the one of them who scored at least m points first"

Submission: 54014572 Submission: http://codeforces.com/contest/2/submission/54014572

Would appreciate any help I can get in regards of this issue ^^. Thanks in advance.