Hi guys, I never really wrapped my head around floating point precision standards(in the view of competitive programming). Can you guys suggest me a book or course for me to read for a c++ beginner?
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.
There are approximately 35 mid heroes in dota 2. You are given a matrix winprob, 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?
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).
Problem Link: https://codeforces.com/problemset/problem/877/D