Codeforces celebrates 10 years! We are pleased to announce the crowdfunding-campaign. Congratulate us by the link https://codeforces.com/10years. ×

HighHopes's blog

By HighHopes, history, 12 days ago, In English,

Can someone recommend me problems on Dp from Project Euler Hackerrank.

I couldn't find much on googling it.

Thanks in advance.

Read more »

 
 
 
 
  • Vote: I like it
  • +8
  • Vote: I do not like it

By HighHopes, history, 2 months ago, In English,

Yesterday, I was stress testing the solution of problem E of some random participants from recent Div 3, with my solution but i couldn't hack them. After a few hours, two solutions which i stress tested got hacked but my stress testing couldn't catch where their solution was failing.
So, how do people find such a test cases to hack other's solution? Any suggestions are appreciated. Thank you.

Read more »

 
 
 
 
  • Vote: I like it
  • +17
  • Vote: I do not like it

By HighHopes, history, 4 months ago, In English,

Given an array and a value Sum, we need to print any three indices i, j, k such that i != j and j != k and arr[i] + arr[j] + arr[k] = Sum. Can we do it in better than N^2, something like NlogN?

Read more »

 
 
 
 
  • Vote: I like it
  • +3
  • Vote: I do not like it