Commits

Branch selector

 main

User selector

All users

Datepicker

All time

Commit History

Commits on Dec 4, 2023

• Update README.md

  kazalika

  authored
  1fc13ac

  Copy full SHA for 1fc13ac

Commits on Apr 20, 2022

• Update mincostmaxflow SPFA O(n m^2) + decomp.cpp

  kazalika

  authored
  ad446ff

  Copy full SHA for ad446ff

• Update and rename mincostmaxflow SPFA O(n m^2) (not checked).cpp to mincostmaxflow SPFA O(n m^2) + decomp.cpp

  kazalika

  authored
  e4f5467

  Copy full SHA for e4f5467

• Rename mincostmaxflow Bellman-ford O(n^2 m^2) (not checked).cpp to mincostmaxflow Bellman-ford O(n^2 m^2) + decomp.cpp

  kazalika

  authored
  f2a866e

  Copy full SHA for f2a866e

• Update mincostmaxflow Bellman-ford O(n^2 m^2) (not checked).cpp

  kazalika

  authored
  3fd17a6

  Copy full SHA for 3fd17a6

Commits on Apr 15, 2022

• Create maxflow (dinic + scaling) O(VE logC) + get_mincut + decomp.cpp

  kazalika

  authored
  306990d

  Copy full SHA for 306990d

• Create mathching 1.1.cpp

  kazalika

  authored
  7e2b182

  Copy full SHA for 7e2b182

Commits on Aug 12, 2021

• Rename gcd+lcm+gcd_ex+dioph+crt.cpp to gcd + lcm + gcd_ex + dioph + crt.cpp

  kazalika

  authored
  a35983b

  Copy full SHA for a35983b

• Update gcd+lcm+gcd_ex+dioph+crt.cpp

  kazalika

  authored
  fd69bfe

  Copy full SHA for fd69bfe

• Rename crt.cpp to gcd+lcm+gcd_ex+dioph+crt.cpp

  kazalika

  authored
  10c2557

  Copy full SHA for 10c2557

• Delete diof.cpp

  kazalika

  authored
  c043186

  Copy full SHA for c043186

• Update crt.cpp

  kazalika

  authored
  c95b763

  Copy full SHA for c95b763

• Update crt.cpp

  kazalika

  authored
  f8c0fdf

  Copy full SHA for f8c0fdf

• Update crt.cpp

  kazalika

  authored
  7257baa

  Copy full SHA for 7257baa

Commits on Aug 11, 2021

• Update mincostmaxflow SPFA O(n m^2) (not checked).cpp

  kazalika

  authored
  d343a20

  Copy full SHA for d343a20

• Rename mincostmaxflow O(n^2 m^2) bellman-ford (not checked).cpp to mincostmaxflow Bellman-ford O(n^2 m^2) (not checked).cpp

  kazalika

  authored
  ff5c7db

  Copy full SHA for ff5c7db

• Create mincostmaxflow SPFA O(n m^2) (not checked).cpp

  kazalika

  authored
  3e0cb6c

  Copy full SHA for 3e0cb6c

• Update mincostmaxflow O(n^2 m^2) bellman-ford (not checked).cpp

  kazalika

  authored
  a7ff1a1

  Copy full SHA for a7ff1a1

Commits on Aug 10, 2021

• Rename mincostmaxflow O(n^2 m^3) bellman-ford (not checked).cpp to mincostmaxflow O(n^2 m^2) bellman-ford (not checked).cpp

  kazalika

  authored
  c431015

  Copy full SHA for c431015

• Update and rename mincostmaxflow Dijkstra O(n^3 m) (not checked).cpp to mincostmaxflow Dijkstra O(n^2 m log m) (not checked).cpp

  kazalika

  authored
  75557f2

  Copy full SHA for 75557f2

• Rename min cost max flow O(n^2 m^3) bellman-ford (not checked).cpp to mincostmaxflow O(n^2 m^3) bellman-ford (not checked).cpp

  kazalika

  authored
  1745c30

  Copy full SHA for 1745c30

• Create min cost max flow O(n^2 m^3) bellman-ford (not checked).cpp

  kazalika

  authored
  1213875

  Copy full SHA for 1213875

• Update mincostmaxflow Dijkstra O(n^3 m) (not checked).cpp

  kazalika

  authored
  7d968c4

  Copy full SHA for 7d968c4

• Update mincostmaxflow Dijkstra O(n^3 m) (not checked).cpp

  kazalika

  authored
  3d0b1b8

  Copy full SHA for 3d0b1b8

• Update mincostmaxflow Dijkstra O(n^3 m) (not checked).cpp

  kazalika

  authored
  2bed99f

  Copy full SHA for 2bed99f

• Update mincostmaxflow Dijkstra O(n^3 m) (not checked).cpp

  kazalika

  authored
  9a6134b

  Copy full SHA for 9a6134b

• Create mincostmaxflow Dijkstra O(n^3 m) (not checked).cpp

  kazalika

  authored
  d95d5bb

  Copy full SHA for d95d5bb

Commits on Aug 7, 2021

• Create matching.cpp

  kazalika

  authored
  54e76e0

  Copy full SHA for 54e76e0

Commits on Aug 5, 2021

• Rename disjoint set union O(alpha(n)) = O(1) to disjoint set union O(alpha(n)) = O(1).cpp

  kazalika

  authored
  af07949

  Copy full SHA for af07949

• Create fenwick (BIT) O(log n).cpp

  kazalika

  authored
  40c69e2

  Copy full SHA for 40c69e2

• Create disjoint set union O(alpha(n)) = O(1)

  Show description for e18665e
  kazalika

  authored
  e18665e

  Copy full SHA for e18665e

Commits on May 26, 2021

• Update fft cd + poly mult + mult.cpp

  kazalika

  authored
  2981cf5

  Copy full SHA for 2981cf5

Commits on May 23, 2021

• Update fast segment tree max (n=5e7).cpp

  kazalika

  authored
  adc3a29

  Copy full SHA for adc3a29

• Create fast segment tree max (n=5e7).cpp

  kazalika

  authored
  921c92c

  Copy full SHA for 921c92c

• Rename fast segment tree min.cpp to fast segment tree max.cpp

  kazalika

  authored
  f752eb4

  Copy full SHA for f752eb4

Pagination

Previous

Next