tfg50/Competitive-Programming

Issues

• Implement Min Arborescence

  #25 opened 3 years ago by tfg50
  0

• Implement Fermat point

  #24 opened 3 years ago by tfg50
  1

• Implement Geometry Primitives

  #23 opened 3 years ago by tfg50
  0

• Implement Smallest Enclosing Circles

  #22 opened 3 years ago by tfg50
  0

• Implement DAG of "u->v iff range u is strictly inside of range v"

  #21 opened 3 years ago by tfg50
  0

• Add Dirichlet convolution

  #20 opened 3 years ago by tfg50
  0

• Implement some helper classes to solve parsing problems

  #19 opened 3 years ago by tfg50
  0

• Implement Tree Isomorphism

  #18 opened 3 years ago by tfg50
  0

• Implement Simplex

  #17 opened 3 years ago by tfg50
  0

• Create LinearAlgebra namespace

  #16 opened 3 years ago by tfg50
  0

• Implement BigInt class

  #15 opened 3 years ago by tfg50
  0

• Implement 3D Geometry primitives

  #14 opened 3 years ago by tfg50
  0

• Refactor 2D Geometry primitives

  #13 opened 3 years ago by tfg50
  0

• Refactor KD Tree

  #12 opened 3 years ago by tfg50
  0

• Implement Berlekamp-Massey

  #11 opened 3 years ago by tfg50
  0

• Implement "1D1D" dp optimization

  #10 opened 3 years ago by tfg50
  0

• Implement Convex Hull Trick

  #9 opened 3 years ago by tfg50
  0

• Refactor HLD

  #8 opened 3 years ago by tfg50
  0

• Refactor Matroid Intersection and Matroid Union

  #7 opened 3 years ago by tfg50
  0

• Implement Suffix Automaton

  #6 opened 3 years ago by tfg50
  0

• Implement helper code to transform Suffix Array into Suffix Tree

  #5 opened 3 years ago by tfg50
  0

• Optimize Suffix Array to O(N*logN) by using radix sort

  #4 opened 3 years ago by tfg50
  0

• Investigate and fix Splay tree or Link cut tree bug

  #3 opened 3 years ago by tfg50
  0

• Refactor MCMF

  #2 opened 3 years ago by tfg50
  0

• Refactor FFT and NTT

  #1 opened 3 years ago by tfg50
  0