You must be logged in to add a new category

Search in :
Search for :

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