On vovuh → Codeforces Round #575 (Div. 3), 5 years ago 0 there are only two condition of "NO" let n=no of odds 1)if nk and n-k is odd
 On netman → Codeforces Round #260 — Editorial, 5 years ago 0 it is wrong , it should be dp[i][0]=i*b[i]+dp[i-1][1]; dp[i][1]=max(dp[i-1][0],dp[i-1][1]); because if you do not select i , then you have both option to choose i-1 or not and who ever is max take the ans
 On repeating → Which IDE do you use?, 5 years ago 0 any solution for windows?? anyone please
 On gop2024 → Codeforces Round #569, 5 years ago -11 good luck
 On vovuh → Codeforces Round #565 (Div. 3), 5 years ago 0 thanks buddy for helping me!! i change that and it got ACCEPTED!!! thanks
 On vovuh → Codeforces Round #565 (Div. 3), 5 years ago 0 https://codeforces.com/contest/1176/submission/55374222 i have done the same !! why it giving me tle ?
 On vovuh → Codeforces Round #565 (Div. 3), 5 years ago 0 why it gives tle in E ? https://codeforces.com/contest/1176/submission/55374222
 On awoo → Educational Codeforces Round 59 [Rated for Div. 2], 5 years ago -6 thanks!!
 On scanhex → Codeforces Round #534, 5 years ago -8 YA I ALSO THINK SO PLEASE I REQUEST THE SETTERS TO UPLOAD IT SOON BECAUSE I EAGERLY WANT TO KNOW ABOUT THE DIV2D PROBLEM SOLUTION
 On scanhex → Codeforces Round #534, 5 years ago -27 how to solve div2 d problem ??
 On Morphy → CodeChef January Cook-Off 2019, 5 years ago 0 codechef server down in middle of the contest causes my rank to float to 600
 On MikeMirzayanov → New Year Gifts 2019!, 5 years ago 0 thanks mike for giving us such a wonderfull platform.
 On 300iq → Codeforces Round #530, 5 years ago 0 when editorial will come ??
 On the_silliest → Can't Solve C(Div.2) Still, 5 years ago 0 thanks for that
 On vovuh → Codeforces Round #529 (Div. 3), 5 years ago 0 i cannot understand why u use k-=mn; then func( x, min(k+1,x) ) in your code can you eloborate please