|
ACM
(182)
|
coin change
(3)
|
toposort
(1)
|
first USACO
(1)
|
|
UVa
(166)
|
BFS
(3)
|
top-down(memoization)
(1)
|
first Timus
(1)
|
|
DP
(27)
|
0-1 knapsack
(3)
|
TC
(1)
|
first SRM
(1)
|
|
math
(17)
|
Submission error
(2)
|
string processing
(1)
|
first Java
(1)
|
|
greedy
(17)
|
Oracle
(2)
|
SRM
(1)
|
first codejam
(1)
|
|
ad hoc
(16)
|
number base conversion
(2)
|
simulation
(1)
|
first CF
(1)
|
|
graph theory
(11)
|
modulo
(2)
|
sieve
(1)
|
factorial
(1)
|
|
ZOJ
(10)
|
matrix-chain multiplication
(2)
|
set
(1)
|
DP+bitmask
(1)
|
|
bignum
(8)
|
LDS
(2)
|
print solution
(1)
|
design pattern
(1)
|
|
sorting
(5)
|
LCS
(2)
|
print path
(1)
|
datetime
(1)
|
|
DFS
(5)
|
just say
(2)
|
primes
(1)
|
DAT
(1)
|
|
POJ
(4)
|
inversion index
(2)
|
prime factorization
(1)
|
DAG
(1)
|
|
maximum 2D sum
(4)
|
interval covering
(2)
|
palindrome
(1)
|
cp1 start
(1)
|
|
map
(4)
|
imcomprehension
(2)
|
next_permutation
(1)
|
counting sort
(1)
|
|
LIS
(4)
|
Hdu
(2)
|
negative cycle
(1)
|
configuration
(1)
|
|
GCD
(4)
|
Havel-Hakimi
(2)
|
multiset
(1)
|
conclusion
(1)
|
|
Flood fill
(4)
|
Fibonacci
(2)
|
multi-fields sorting
(1)
|
combinatorics
(1)
|
|
brute force
(4)
|
Euler-s Totient
(2)
|
multi-field sorting
(1)
|
campus test practice
(1)
|
|
union-find
(3)
|
eclipse
(2)
|
merge sort
(1)
|
bubble sort
(1)
|
|
SSSP
(3)
|
codejam
(2)
|
median selection
(1)
|
bipartite graph
(1)
|
|
Python
(3)
|
CF
(2)
|
maximum sum
(1)
|
binary search
(1)
|
|
number theory
(3)
|
C/C++
(2)
|
Little Endian
(1)
|
Bellman Ford
(1)
|
|
MST
(3)
|
backtracking
(2)
|
LCM
(1)
|
beauty_of_programming
(1)
|
|
Kruskal
(3)
|
windows
(1)
|
jobdu
(1)
|
AC gift
(1)
|
|
divide and conquer
(3)
|
weighted LIS+LDS
(1)
|
java-printf
(1)
|
剑指offer
(1)
|
|
Dijkstra
(3)
|
uva 100th
(1)
|
java
(1)
|
8-queens problem
(1)
|
|
computational geometry
(3)
|
USACO
(1)
|
infix to postfix
(1)
|
浙公网安备 33010602011771号