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.

# | User | Rating |
---|---|---|

1 | Benq | 3539 |

2 | tourist | 3532 |

3 | wxhtxdy | 3425 |

4 | Radewoosh | 3316 |

5 | ecnerwala | 3297 |

6 | mnbvmar | 3280 |

7 | LHiC | 3276 |

8 | Um_nik | 3260 |

9 | yutaka1999 | 3190 |

10 | TLE | 3145 |

# | User | Contrib. |
---|---|---|

1 | Errichto | 193 |

2 | Radewoosh | 179 |

3 | tourist | 172 |

4 | Vovuh | 167 |

4 | antontrygubO_o | 167 |

6 | PikMike | 165 |

7 | rng_58 | 160 |

8 | majk | 157 |

9 | Um_nik | 156 |

10 | 300iq | 154 |

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.

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?

Are Ladders still consistent with their corresponding ratings?

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

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Nov/12/2019 00:13:40 (h1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|