Loading web-font TeX/Math/Italic

1476D - Journey

Tags : Problem statement Link : https://codeforces.com/contest/1476/problem/D   Gist There are n cities, connected by one directional road...

  • [Trees][Binary Lifting] 501 - D Misha And Permutations
    Misha and Permutations Problem statement: The problem can be found here . The gist of the problem is: You're given two permutati...
  • 4.2-6 CLRS
    4.2-6[clrs]: How quickly can you multiply a kn \times n matrix by an n \times kn matrix, using Strassen's algorithm as a subrouti...
  • [CLRS-23.1-2] Proving the conjecture wrong
    23.1-2 Professor Sabatier conjectures the following converse of theorem 23.1. Let G = (V,E) be a connected, undirected graph with a real...