Arhiva Educationala

Arhiva educaţională

table(example). |_. Denumire problema|_. Voluntar|_. Finalizat|_. Review |
| 'Cuplaj maxim de cost minim':problema/cmcm | == user(user="savim" type="tiny") == | ==Stars(rating="1" scale="1" type="small")== | ==Stars(rating="1" scale="1" type="small")== |
| 'Principiul includerii si excluderii':problema/pinex | == user(user="savim" type="tiny") == | ==Stars(rating="1" scale="1" type="small")== | ==Stars(rating="1" scale="1" type="small")== |

| 'Arbori de intervale (aplicaţie cu 4 tipuri de operaţii)':problema/arbint2 | == user(user="savim" type="tiny") == | ==Stars(rating="0.5" scale="1" type="small")== | ==Stars(rating="0" scale="1" type="small")== |

| 'Arbori de intervale (aplicaţie cu 4 tipuri de operaţii)':problema/arbint2 | == user(user="savim" type="tiny") == | ==Stars(rating="1" scale="1" type="small")== | ==Stars(rating="0" scale="1" type="small")== |
| 'Arbori de intervale 2D':problema/arbint2d | == user(user="savim" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== | ==Stars(rating="0" scale="1" type="small")== |

| 'Huffman':problema/huffman | == user(user="GavrilaVlad" type="tiny") == | ==Stars(rating="1" scale="1" type="small")== | ==Stars(rating="1" scale="1" type="small")== |
| 'Algoritmul Bellman-Ford':problema/bellmanford | == user(user="GavrilaVlad" type="tiny") == | ==Stars(rating="1" scale="1" type="small")== | ==Stars(rating="1" scale="1" type="small")== |
| 'NIM':problema/nim | == user(user="GavrilaVlad" type="tiny") == | ==Stars(rating="0" scale="1" type="small")== | ==Stars(rating="0" scale="1" type="small")== |

|Automate - Aho Corasick|Siruri de caractere|
|Algoritmi {$O(sqrtN)$}|Structuri de date|
|Ortogonal Range Search|Structuri de date|

| Arbori de intervale 2D | Structuri de date |

| 'Aria unui poligon':problema/ariapoli |Geometrie|
|Intersectia a doua drepte|Geometrie|
|Punct in poligon convex|Geometrie|