### Yuki726's blog

By Yuki726, history, 3 months ago, ,

Whomever are willing, comment their wannabe color and the time before they are gonna achieve it.

Note: Post the color you are actually practicing for past days. Please don't just spam red.

• +17

By Yuki726, history, 5 months ago, ,

Is there any plugin that hides number of submissions in contests BUT SORTS THE PROBLEMS BASED ON SUBMISSIONS? During contests If I see number of submissions I either lose confidence or get over confident, so I just want to see the order in which I need to solve.

• -8

By Yuki726, history, 6 months ago, ,

Can anyone tell me where can I find good list of adhoc competitive programming problems? I want to practice problems which doesn't contain textbook algorithms.

• +31

By Yuki726, history, 6 months ago, ,

There are approximately 35 mid heroes in dota 2. You are given a matrix winprob[35][35], where winprob[i][j] denotes the probability of ith hero winning against jth hero in midlane (matrix is derived from previously played games).
Problem : What's the minimum cardinal subset of heroes (to learn) such that when the opponent picks a mid hero, we can always pick a hero from our subset and get the probability of winning atleast (60%).

I can only think of bruteforce. Is there any better algorithm?

• +40

By Yuki726, history, 7 months ago, ,

Are Ladders still consistent with their corresponding ratings?

• +7

By Yuki726, history, 8 months ago, ,

In this submission for the problem 31660028 the author used if(ans[ni][nj] < ans[v.fi][v.se] + 1) break; condition. Can anyone guide me in proving that this algorithm with the break condition produces shortest paths and its complexity is O(n*m).