Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Appearance settings

shayanh/algorithms

BranchesTags
Open more actions menu

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

67 Commits
.gitignore
.gitignore
 
 
370.cpp
370.cpp
 
 
README.md
README.md
 
 
_vimrc
_vimrc
 
 
bellmanford.cpp
bellmanford.cpp
 
 
comb.cpp
comb.cpp
 
 
convexhull.cpp
convexhull.cpp
 
 
cutedge.cpp
cutedge.cpp
 
 
cutvertex.cpp
cutvertex.cpp
 
 
dfs-nonreturning.cpp
dfs-nonreturning.cpp
 
 
dijkstra.cpp
dijkstra.cpp
 
 
divide-conquer-opt.cpp
divide-conquer-opt.cpp
 
 
divide-conquer-tree.cpp
divide-conquer-tree.cpp
 
 
euclid.cpp
euclid.cpp
 
 
eulerian-tour.cpp
eulerian-tour.cpp
 
 
fenwick1.cpp
fenwick1.cpp
 
 
fenwick2.cpp
fenwick2.cpp
 
 
fft.cpp
fft.cpp
 
 
flow-bfs.cpp
flow-bfs.cpp
 
 
flow-dinic.cpp
flow-dinic.cpp
 
 
gauss-jordan.cpp
gauss-jordan.cpp
 
 
geometry.cpp
geometry.cpp
 
 
hash.cpp
hash.cpp
 
 
heavylight.cpp
heavylight.cpp
 
 
intersection.cpp
intersection.cpp
 
 
kmp.cpp
kmp.cpp
 
 
knuth-opt.cpp
knuth-opt.cpp
 
 
kruskal.cpp
kruskal.cpp
 
 
lca.cpp
lca.cpp
 
 
lis.cpp
lis.cpp
 
 
lower-envelope-dp-opt.cpp
lower-envelope-dp-opt.cpp
 
 
matching.cpp
matching.cpp
 
 
matrix-fast-expo.cpp
matrix-fast-expo.cpp
 
 
min-cost-max-flow.cpp
min-cost-max-flow.cpp
 
 
notebook-2016.pdf
notebook-2016.pdf
 
 
notebook-2017.pdf
notebook-2017.pdf
 
 
notebook.pdf
notebook.pdf
 
 
notebook.tex
notebook.tex
 
 
phi.cpp
phi.cpp
 
 
prim.cpp
prim.cpp
 
 
readinput.cpp
readinput.cpp
 
 
rmq.cpp
rmq.cpp
 
 
scc-gabow.cpp
scc-gabow.cpp
 
 
segment-lazy.cpp
segment-lazy.cpp
 
 
segment-vector-opt.cpp
segment-vector-opt.cpp
 
 
segment-vector.cpp
segment-vector.cpp
 
 
segment.cpp
segment.cpp
 
 
suffix-array.cpp
suffix-array.cpp
 
 
template.cpp
template.cpp
 
 
topological-sort.cpp
topological-sort.cpp
 
 
trie.cpp
trie.cpp
 
 

Repository files navigation

NeshesTeam template codes for ACM ICPC contests

Base:

  • vimrc
  • Template

Graph:

  • LCA
  • SCC
  • Matching
  • Max Flow BFS
  • Max Flow Dinic
  • Min Cost Max Flow
  • Cut Vertex
  • Cut Edge
  • Bellman Ford
  • Dijkstra
  • Prim
  • DSU
  • Eulerian Tour

Geometry:

  • Geometry
  • Convex Hull

Data Sctructure:

  • Fenwick1
  • Fenwick2
  • Segment Tree
  • Segment Tree Lazy Propagation
  • RMQ
  • Trie

String:

  • Hash
  • KMP
  • Suffix Array

Number Theory:

  • Phi
  • 370 SGU
  • Euclid
  • C(n,r)

Other:

  • Read Input
  • LIS
  • Divide and Conquer Tree

About

Useful codes for ACM-ICPC contests

Resources

Readme
Activity

Stars

12 stars

Watchers

2 watching

Forks

4 forks
Report repository

Releases

No releases published

Packages

No packages published

Contributors 3

  •  
  •  
  •  

Languages
Morty Proxy This is a proxified and sanitized view of the page, visit original site.