You must be logged in to add a new category

Search in :
Search for :

Category Problems Count
1 Dynamic Programming 1089
2 implementation 970
3 math 599
4 Greedy 553
5 DFS & BFS & Dijkstra 516
6 Codeforces Div. 2 - A Problems 447
7 Codeforces Div. 2 - C Problems 441
8 brute force 440
9 Codeforces Div. 2 - B Problems 439
10 Codeforces Div. 2 - D Problems 432
11 Codeforces Div. 2 - E Problems 427
12 data structures 422
13 Best Problem Setters 353
14 Binary Search & Ternary Search 309
15 constructive algorithms 286
16 sortings 285
17 graphs 247
18 Number Theory 221
19 Geometry 205
20 strings 194
21 combinatorics 193
22 trees 167
23 Codeforces Div. 1, D 156
24 Network Flow 152
25 Segment Tree 150
26 probabilities 142
27 two pointers 116
28 bitmasks 101
29 dsu 97
30 Matrix Power 86
31 #Errichto 78
32 MST,Disjoint sets,SCC 76
33 games 71
34 hashing 70
35 Binary Indexed Tree 61
36 Ad-hoc 59
37 divide and conquer 57
38 Codeforces Div. 2 - F Problems 51
39 Maximum Matching / Vertex Cover on Bipartite Graph 48
40 backtracking 40
41 Trie 37
42 Non-Classical Dynamic Programming 36
43 bfs 34
44 expresison and parsing 32
45 string suffix structures 32
46 Heavy-Light Descomposition 28
47 KMP 28
48 0/1 Knapsack 27
49 Suffix Array/Tree 27
50 Meet in The Middle 26
51 The_scorpion 24
52 LIS 21
53 Balanced Binary Search Trees 21
54 TopologicalSort 20
55 polynomial 20
56 FFT 20
57 ACM-ICPC Dhaka Site Regional Contests 20
58 All Pair Shortest Path (Floyd-Warshall) 18
59 MO?s Algorithm (Query square root decomposition) 16
60 LCA 16
61 Convex hull 15
62 Aho-Corasick 15
63 Mo's Algorithm/ Squareroot Decomposition 14
64 back-tracking 14
65 Lowest Common Ancestor 14
66 Suffix automaton 14
67 line sweep 13
68 EulerianTour 13
69 Hungarian Algorithm 13
70 Codeforces Practice List 13
71 Reasoning 13
72 2sat 12
73 LCS 12
74 Gaussian elimination 11
75 Strongly Connected Components 11
76 Coin Change 10
77 beginner 10
78 Strategy 10
79 Centroid Decomposition 10
80 Math Games 9
81 Edit Distance 9
82 STL 9
83 Heaps 8
84 DFS&BFS 8
85 Complete Searsh 8
86 Articulation Point 8
87 segment trees 7
88 Dijkstra 7
89 bit manipulation 7
90 Square Root Decomposition 6
91 Simulation 6
92 ad hoc 6
93 MCM & OBST 6
94 Bellman-Ford 6
95 STOP ADDING DUMP CATEGORIES 6
96 RMQ 5
97 Rabin-Karp 5
98 Simulated Annealing 5
99 Minimum Spanning Tree 5
100 Game Theory 5
101 kth shortest path 5
102 Treap 5
103 Optimization 5
104 SGU Problems 5
105 0/1 BFS 5
106 big numbers 5
107 Recursion 5
108 tries 4
109 schedules 4
110 Grid compression 4
111 chinese remainder theorem 4
112 matrix exponentiation 4
113 AI 4
114 Iniciante 4
115 Partitioning 4
116 digit dp 3
117 flood fill 3
118 Float precision 3
119 linked list 3
120 Difference Constraints 3
121 Newton Raphson method 3
122 Range tree 3
123 Minkowski addition 3
124 binar search 2
125 justSama 2
126 string 2
127 Max points on line 2
128 Z algorithm 2
129 Algorithm X 2
130 Factoradic Index 2
131 binary search 2
132 Biconnected Component 2
133 dinamyc porograming 2
134 Alignment 2
135 Voronoi 2
136 dp 2
137 SQRT Heuristic 2
138 Pigeonhole principle 2
139 acm 2
140 ista breaks up with shreya 2
141 Polygon centroid 2
142 Minimum Enclosing Circle 2
143 frequency ARRAY 2
144 big mod 2
145 begainners 1
146 contest 1
147 Coordinate Compression 1
148 ista = LGBT head 1
149 Circle sweep 1
150 SRM 557 DivII 250 1
151 Disjoint Set Union 1
152 ECPC 2014 1
153 data structure 1
154 acm egypt 1
155 disunion set 1
156 uva 1
157 Dynam 1
158 omar 1
159 109 1
160 uri 1
161 SRP_HOMEWORK_01 1
162 ciclos 1
163 Arrays 1
164 Begginer 1
165 general 1
166 Stable Marriage 1
167 scc 1
168 bst 1
169 suffix array 1
170 bi connected component 1
171 prime 1
172 dfs 1
173 Minimum cost arborescence 1
174 algorithms 1
175 Linear Programming 1
176 dynammic programming 1
177 Basica 1
178 MST 1
179 kingdon 1
180 Logic 1
181 maximum empty rectangle 1
182 Mathematical Questions 1
183 Codeforces 1
184 binary search tree 1
185 Div 2 0
186 zu 0
187 disjoint 0
188 div 0
189 knj 0
190 extended 0
191 factoradic 0
192 A 0
193 0/1 0
194 ahmeddahi92 0
195 classes 0
196 Graph basics concepts BFS & DFS 0
197 comb 0
198 crazy search 0
199 biginteger 0
200 bit masking 0
201 union 0
202 zbox 0
203 reursion 0
204 jzzhu and sequences 0
205 195 0
206 flo 0
207 PI-UFS-T01 0
208 bitmask 0
209 number system 0
210 ad hock 0
211 Simple Math 0
212 matrix 0
213 warshall 0
214 implmentation 0
215 Groups 0
216 graph theory 0
217 bridges 0
218 29708 - ContestPreparation 0
219 function 0
220 easy 0
221 LCIS 0
222 Avanzada 0
223 binary 0
224 pattern search 0
225 longest 0
226 ECPC 0
227 breadth first search 0
228 breath first search 0
229 set 0
230 segment 0
231 frequency 0
232 bitmask problems 0
233 LP1-I_so_love_programming! 0
234 1119 0
235 game thery 0
236 dd 0
237 Kadane's Algorithm 0
238 Pattern 0
239 Practice 0
240 floyd warshall 0
241 mathematical 0
242 Treinamento1604 0
243 max flow 0
244 North America - Mid-Central USA 0
245 acm sham 0
246 link 0
247 maths 0
248 2-sat 0
249 352-Pesky Palindromes 0
250 books 0
251 Ladder 0
252 Codeforces Div. 1, E 0
253 codeforce A 0
254 graphe 0
255 rolling hash 0
256 add hoc 0
257 Dfs and similar 0
258 maxflow 0
259 so easy 0
260 dynamic programing 0
261 sorting 0
262 abed 0
263 binary tree 0
264 bits 0
265 ifrn 0
266 Chinese Postman Problem 0
267 garf 0
268 Mriganga 0
269 shortestpath 0
270 number 0
271 SPC 0
272 codeforces Div2 A 0
273 30008 0
274 game 0
275 biney index tree 0
276 Graph Coloring Welsh-Powell Algorithm 0
277 Gammal 0
278 dynamic 0
279 Palindromes 0
280 DIV 2 A 0
281 15822 0
282 geekhamza 0
283 a canh 0
284 coci 0
285 SERCLE DEATH 0
286 252 0
287 D-Codeforces 0
288 arab 0
289 pinary search 0
290 codeforce div1 catagori A 0
291 backtrack 0
292 regionals 0
293 convex 0
294 codeforces div 1-a 0
295 Junior Training Sheet - template - v4.4 0
296 Sheet: https://a2oj.com/register?ID=32538 0
297 structs 0
298 customfurnish 0
299 A2OJ FCI-CU 0
300 stacks 0
301 knapsack algorithm 0
302 topological sory 0
303 divide 0
304 combination 0
305 184. Strings with Same Letters 0
306 bs 0
307 tarjan 0
308 graps 0
309 Combi 0
310 SAMO 0
311 istasis likes dhinchak pooja 0
312 india 0
313 184 0
314 maps 0
315 c 0
316 ad 0
317 vec 0
318 fenwick tree 0
319 Mother bear uva 0
320 search 0
321 Acm world final 2011 0
322 Media 0
323 dp bitmask 0
324 square 0
325 stack 0
326 linked lists 0
327 bipartite 0
328 meet-in-the-middle 0
329 Theatre Square 0
330 pst0 0
331 m 0
332 array 0
333 frequency arrays 0
334 training round #2 0
335 gemastik 0
336 level 1 0
337 sara reda 0
338 dfs & bfs 0
339 probability 0
340 aho 0
341 BIT 0
342 arraya 0
343 power 0
344 euclid 0
345 28239 0
346 twins 0
347 matrices 0
348 stable roomate 0
349 Sparse Table 0
350 centroid 0
351 bipartite matching 0
352 125. Objects Count 0
353 Google Code Jam 0
354 AVL 0
355 Iniciante - Aracode 0
356 1c 0
357 sort drinking 0
358 Math & Geometry 0
359 binary searsh 0
360 matrix multiplication problem 0
361 articulation 0
362 mineira 0
363 heavy light decomposition 0
364 hbb 0
365 353 0
366 Capital City 0
367 priority queue 0
368 bainary search 0
369 binry 0
370 Joud Khattab 0
371 a2 0
372 basic programming 0
373 2A 0
374 473 0
375 spoj 0
376 lucas theorem 0
377 Topological sort 0
378 caoyu01 0
379 impemention 0
380 decode 0
381 1160 0
382 palindrome 0
383 range minimum querry 0
384 obi 0
385 Dijkstra dfs bfs 0
386 queue 0
387 cummulative 0
388 graph 0
389 div 2C 0
390 greedy problem 0
391 codeforce 0
392 amman cpc 2015 0
393 two pointerd 0
394 indonesia 0
395 13 0
396 beginners 0
397 heap 0
398 C# 0
399 priority 0
400 oc 0
401 knapsack 0
402 data 0
403 toplogical sort 0
404 implemntation 0
405 Mispelling 0
406 gcd 0
407 kruskal 0
408 Bfs Dfs 0
409 andres 0
410 UNCC ACM 0
411 22134 - LP1-FPUNA-2015 0
412 matching 0
413 dynamic programming,codeforces DIV 2 D 0
414 andrerabelo 0
415 merge sort 0
416 kmp algo 0
417 Add them twice 0
418 ACM Syrian Collegiate Programming Contest 2 0
419 hash 0
420 10945 0
421 Div2 0
422 ternary 0
423 recursive 0
424 cumulative 0
425 Problem 2 Component Testing 0
426 rabin 0
427 two pointer 0
428 Ahmad 0
429 re 0
430 Div 2 B 0
431 d 0
432 topcoder 0
433 training round 0
434 disjoint set 0
435 hakenbush 0
436 niquefa 0
437 Mid-Central USA 0
438 bellman 0
439 fibo 0
440 djikstra 0
441 suffix 0
442 A - Siggy?s sum 0
443 nfa 0
444 brute 0
445 adhoc 0
446 topological 0
447 codeforces Div 1 A 0
448 tree 0
449 floyd 0
450 depth first search 0
451 icpc 0
452 Dinamic 0
453 ACM Arab Collegiate Programming Contest 2013 0
454 flow 0
455 Queues 0
456 dy 0
457 web 0
458 math geometry 0
459 bitmasking 0
460 B 0
461 adhocv 0
462 url 0
463 link list 0
464 acm phase 0 0
465 2791 - Lagrange's Four-Square Theorem 0
466 acam 0
467 vector 0
468 UFG 0
469 sort 0
470 sweep line 0
471 bitmasks problems 0