DP

11552 UVA (3)
12172 UVA (3)
4507 LA (5)
4510 LA (5) [+ geometry]
12181 UVA (6)
http://codeforces.com/contest/729/problem/F 6
http://codeforces.com/contest/735/problem/E 9
http://codeforces.com/contest/731/problem/E 5
12030 UVA (4)
http://codeforces.com/contest/721/problem/E 7
http://codeforces.com/contest/742/problem/D 4
12040 UVA (5)
http://codeforces.com/contest/712/problem/D 5
13162 UVA (6)
http://codeforces.com/contest/743/problem/E 6
11908 UVA (3)
11932 UVA (4)
http://codeforces.com/contest/745/problem/E (7)
11806 UVA (4)
http://codeforces.com/contest/747/problem/F (5)
11843 UVA (4)
http://codeforces.com/contest/752/problem/E (5)
http://codeforces.com/contest/703/problem/E (7)
11753 UVA (4)
11725 UVA (5)
http://codeforces.com/contest/722/problem/E (9)
http://codeforces.com/contest/760/problem/F (8)
11795 UVA (3)
11654 UVA (4)
11523 UVA (5)
11404 UVA (4)
11432 UVA (4)
11451 UVA (4) //C==20 mistake in statement
11301 UVA (4)
http://codeforces.com/contest/762/problem/D 5
11361 UVA (4) //digit DP
11365 UVA (7)
11391 UVA (4) //easy+implementation
11394 UVA (3)
11218 UVA (2)
11125 UVA (4) //slightly implementation
11076 UVA (3)
11081 UVA (4) //3 string subsequences (beware of fail)
http://codeforces.com/contest/678/problem/E (5) //bitset dp + probability
http://codeforces.com/contest/766/problem/C (4)
http://codeforces.com/contest/667/problem/C (3)
http://www.spoj.com/problems/MOVIFAN/ (3)
http://www.spoj.com/problems/ORDSUM23/ (3)
http://www.spoj.com/problems/DIVSEQ/ (4) //N^3 (but better...) works fine
http://codeforces.com/contest/633/problem/F (7) //Tree dp
http://www.spoj.com/problems/ADJDUCKS/ (4) sort + pick 2-3 continous O(N)
http://www.spoj.com/problems/JLNT/ (4) //pick 0 or 2 | 1e3*5e3
http://www.spoj.com/problems/TPCPALIN/ (5) //500^3 works (3rd countable)
http://www.spoj.com/problems/COLORSEG/ (4) //50^4==OK 50^4log(N)=TLE NICE
http://www.spoj.com/problems/POWERCAR/ (3) //1e3*1e3*2 - follow rules
http://www.spoj.com/problems/INGRED/ (5) //TSP-like [reduce + go]
http://www.spoj.com/problems/BADXOR/ (4) //classical subsets
http://www.spoj.com/problems/SPCO/ (5) //64*64*2 DP {OPT: prime O(1) + clear only half}
http://www.spoj.com/problems/WAYHOME/ (5) //NICE: 1) 1*1 b)12,1,**,2
http://www.spoj.com/problems/NFURY/ (2) //Minimal sum of squares
http://www.spoj.com/problems/GDIL/ (3) //combinatorics
http://codeforces.com/contest/791/problem/D (5) //Tree
http://codeforces.com/contest/791/problem/E (6) //V,K,X - pick any
http://codeforces.com/contest/789/problem/C (3)
13176 (4) //N^6
13179 (5) //NICE [Ath][Bth][TimeDiff]