8000 GitHub - zanpakutou/Standard: Standard code for standard algo :))

More Web Proxy on the site http://driver.im/

Name		Name	Last commit message	Last commit date
Latest commit History 42 Commits
Aho-Corasick.cpp		Aho-Corasick.cpp
Binary Indexed Tree 2D		Binary Indexed Tree 2D
ClosestPoint.cpp		ClosestPoint.cpp
Dijkstra.cpp		Dijkstra.cpp
Dinitz		Dinitz
Euclid_equation.cpp		Euclid_equation.cpp
EulerTfunc.cpp		EulerTfunc.cpp
Gauss.cpp		Gauss.cpp
GrahamScan.cpp		GrahamScan.cpp
KMP.cpp		KMP.cpp
Manacher.cpp		Manacher.cpp
PythonJudge		PythonJudge
README.md		README.md
SuffixArray.cpp		SuffixArray.cpp
Tarjan.cpp		Tarjan.cpp
Topo sort		Topo sort
TopoSort.cpp		TopoSort.cpp
Zfunc.cpp		Zfunc.cpp
fft.cpp		fft.cpp
floyd.cpp		floyd.cpp
kruskal.cpp		kruskal.cpp
monotechain.cpp		monotechain.cpp

Repository files navigation

Standard

Standard code for standard algo :))

Zfunc : Hàm Z http://www.giaithuatlaptrinh.com/?p=250

KMP : Knutt - Morris - Prath https://vi.wikipedia.org/wiki/Thu%E1%BA%ADt_to%C3%A1n_Knuth%E2%80%93Morris%E2%80%93Pratt

Dijkstra : Đường đi ngắn nhất https://vi.wikipedia.org/wiki/Thu%E1%BA%ADt_to%C3%A1n_Dijkstra

EulerTfunc: Phi hàm Euler https://vi.wikipedia.org/wiki/Phi_h%C3%A0m_Euler

Manacher : Dãy đối xứng dài nhất http://articles.leetcode.com/longest-palindromic-substring-part-ii

Euclid_equatirn: Phương trình Euclid https://en.wikipedia.org/wiki/Extended_Euclidean_algorithm

GrahamScan: Tìm Bao Lồi https://en.wikipedia.org/wiki/Graham_scan

TopoSort: Sắp xếp theo thứ tự topo https://vi.wikipedia.org/wiki/S%E1%BA%AFp_x%E1%BA%BFp_t%C3%B4_p%C3%B4

ClosestPoint: Tìm 2 điểm gần có khoảng cách ngắn nhất.

Gauss : Giải HPT bằng phân rã ma trận https://vi.wikipedia.org/wiki/Ph%C3%A9p_kh%E1%BB%AD_Gauss

0