Se propune construirea unei noi arhive de probleme care sa aiba exclusiv scop educational. Spre deosebire de probleme de concurs in care se imbina mai multi algoritmi si rezolvarea de obicei nu este evidenta, problemele din aceasta arhiva vor fi create special pentru cei care vor sa invete cum sa implementeze un algoritm sau o metoda de rezolvare anume. Se va permite accesul la teste, surse si se vor da si link-uri catre documentatie. Mai multe despre acest proiect gasiti 'aici':propuneri/6-arhiva-educationala.
(toc)*{text-align:center} *Continut*
* 'De ce m-as baga?':implica-te/arhiva-educationala#dece
* 'Cum pot sa contribui?':implica-te/arhiva-educationala#cum
* 'Cum ne poti ajuta?':implica-te/arhiva-educationala#cum
* 'Echipa implicata in proiect':implica-te/arhiva-educationala#echipa
* 'Documentatie':implica-te/arhiva-educationala#documentatie
* 'Continutul arhivei':implica-te/arhiva-educationala#probleme
h2(#dece). De ce m-as baga?
h2(#cum). Cum ne poti ajuta?
1. Vei invata cum se creeaza probleme pe infoarena
2. Vei deveni cunoscut
3. Poti invata mai multe despre subiectele care le abordezi, lucrand alaturi de veteranii din echipa infoarena
4. Munca ta va ajuta mii de persoane sa invete informatica, si intreaga comunitate iti va fi rescunoscatoare
1. Ofera sugestii la dezvoltarea proiectului.
2. Contribuie cu feedback pentru a imbunatati calitatea problemelor existente.
3. Vino cu idei pentru probleme noi.
h2(#cum). Cum pot sa contribui?
Ajuta si tu la randul tau comunitatea infoarena!
Momentan, pentru a obtine o eficienta mai buna, recrutarea voluntarilor pentru arhiva educationala a fost oprita. Echipa care contribuie activ la dezvoltarea arhivei educationale este alcatuita din:
h2(#echipa). Echipa implicata in proiect
* == user(user="filipb" type="tiny") == (coordonator de proiect)
* == user(user="pauldb" type="tiny") == (coordonator de proiect)
* == user(user="devilkind" type="tiny") ==
* == user(user="marius" type="tiny") ==
* == user(user="mariusdrg" type="tiny") ==
* == user(user="amadaeus" type="tiny") ==
Echipa care este implicata activ in acest proiect este alcatuita din urmatorii membri:
Multumim celor care ne-au ajutat pana acum:
* == user(user="bogdan2412" type="tiny") ==
* == user(user="Marius" type="tiny") ==, coordonator de proiect
* == user(user="savim" type="tiny") ==
* == user(user="cezarmocan" type="tiny") ==
* == user(user="Florian" type="tiny") ==
* == user(user="gabitzish1" type="tiny") ==
* == user(user="Tabara" type="tiny") ==
* == user(user="Dastas" type="tiny") ==
* == user(user="fireatmyself" type="tiny") ==
* == user(user="cos_min" type="tiny") ==
* == user(user="tudalex" type="tiny") ==
* == user(user="sima_cotizo" type="tiny") ==
* == user(user="toni2007" type="tiny") ==
* == user(user="tm_radu" type="tiny") ==
* == user(user="GavrilaVlad" type="tiny") ==
* == user(user="savim" type="tiny") ==
* == user(user="floringh06" type="tiny") ==
* == user(user="mishu91" type="tiny") ==
* == user(user="GheorgheMihai" type="tiny") ==
Pe langa cei de mai sus, de-a lungul timpului au contribuit considerabil la acest proiect 'o serie de alti membri ai comunitatii infoarena':implica-te/arhiva-educationala/membri-emeritus. Le multumim pe aceasta cale!
h2(#documentatie). Documentatie
h2(#probleme). Continutul arhivei
In tabelul de mai jos se afla probleme la care se lucreaza in momentul de fata. Finalizarea lor reprezinta unul dintre $KR$-urile din $Q4$, $2008$.
In tabelul de mai jos se afla probleme la care se lucreaza in momentul de fata. Finalizarea lor reprezinta unul dintre $OKR$-urile din trimestrul IV, 2009. Pentru a va familiariza si cu restul obiectivelor din acest trimestru, cititi 'aici':okr.
table(example). |_. Denumire problema|_. Voluntar|_. Finalizat|_. Review |
| '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")== |
| 'NIM':problema/nim | == user(user="GavrilaVlad" type="tiny") == | ==Stars(rating="1" scale="1" type="small")== | ==Stars(rating="0" scale="1" type="small")== |
| 'Punct în poligon oarecare':problema/pinpo | == user(user="cezarmocan" type="tiny") == | ==Stars(rating="0.5" scale="1" type="small")== | ==Stars(rating="0" scale="1" type="small")== |
| 'Treapuri':problema/treapuri | == user(user="marius" type="tiny") == | ==Stars(rating="0.5" scale="1" type="small")== | ==Stars(rating="0" scale="1" type="small")== |
| 'Interclasarea a doi vectori sortati':problema/interclas | == user(user="pauldb" type="tiny") == | ==Stars(rating="0.5" scale="1" type="small")== | ==Stars(rating="0" scale="1" type="small")== |
| 'Aria unui poligon':problema/ariapoli | == user(user="pauldb" type="tiny") == | ==Stars(rating="0.5" scale="1" type="small")== | ==Stars(rating="0" scale="1" type="small")== |
| 'Arbori de căutare':problema/arbcautare | ==user(user="bogdan2412" type="tiny") == | ==Stars(rating="0.5" scale="1" type="small")== | ==Stars(rating="0" scale="1" type="small")== |
In tabelul de mai jos se afla sugestii privind algoritmii care trebuie sa se gaseasca sub forma de probleme in arhiva educationala. Puteti veni oricand cu propuneri si sugestii de probleme noi pe "forum":/forum/index.php?topic=3401.0.
table(example). |_. Denumire problema|_. Categoria|
|Knapsack|Programare dinamica|
|Sprague-Grundy|Teoria jocurilor|
|Algoritmul lui Gauss|Matematica|
| Principiul lui Dirichlet | Matematică |
|Problema de acoperire|Programare dinamica + Backtracking|
|Heavy Path Decomposition|Algoritmi pe grafuri|
|Siruri de sufixe|Siruri de caractere|
|Algoritmi {$O(sqrtN)$}|Structuri de date|
|Ortogonal Range Search|Structuri de date|
|Intersectia a doua drepte|Geometrie|
|Punct in poligon convex|Geometrie|
|Minimum enclosing circle|Geometrie|
|Sortare prin numarare|Diverse|
|RadixSort|Diverse|
|Operatii pe numere mari|Diverse|
table(example). |_. Denumire problema|_. Voluntar|_. Finalizat|
|Quicksort|== user(user="amadaeus" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Parcurgere BFS|== user(user="pauldb" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Hashuri|== user(user="filipb" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Ciclu eulerian|== user(user="amadaeus" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Trie|== user(user="amadaeus" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Double Ended Queue|== user(user="pauldb" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Heapuri|== user(user="devilkind" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Infasuratoare convexa|== user(user="mariusdrg" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|APM|== user(user="mariusdrg" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Componente tare conexe|== user(user="marius" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Componente biconexe|== user(user="marius" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Cuplaj maxim|== user(user="marius" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Flux|== user(user="devilkind" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Flux maxim de cost minim|== user(user="pauldb" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Invers modular|== user(user="mariusdrg" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Paduri de multimi disjuncte|== user(user="devilkind" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
In tabelul de mai jos se afla sugestii privind algoritmii care trebuie sa se gaseasca sub forma de probleme in arhiva educationala.
Puteti veni oricand cu propuneri si sugestii de probleme noi pe "forum":forum/index.php?topic=2753.msg22505#new!
_Matematica:_
table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|'Algoritmul lui Euclid':problema/euclid2|== user(user="filipb" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|'Algoritmul lui Euclid extins':problema/euclid3|== user(user="Bogdan2412" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|'Ciurul lui Erathostenes':problema/ciur|== user(user="filipb" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Algoritmul lui Gauss|-|-|==Stars(rating="0" scale="1" type="small")==|
|Principiul includerii si excluderii|-|-|==Stars(rating="0" scale="1" type="small")==|
_Backtracking:_
table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|'Permutari':problema/permutari|== user(user="CezarMocan" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|'Combinari':problema/combinari|== user(user="CezarMocan" type="tiny") ==|== user(user="wefgef" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Submultimi|== user(user="CezarMocan" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|
_Programare dinamica:_
table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|'Cel mai lung subsir comun':problema/cmlsc|== user(user="filipb" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|'Cel mai lung subsir crescator':problema/scmax|== user(user="Florian" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Knapsack|== user(user="gabitzish1" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|
|Subsecventa de suma maxima|== user(user="GavrilaVlad" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|
_Algoritmi pe grafuri:_
table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|Parcurgere BFS|-|-|==Stars(rating="0" scale="1" type="small")==|
|'Parcurgere DFS - componente conexe':problema/dfs|== user(user="gabitzish1" type="tiny") ==|== user(user="DitzoneC" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Componente biconexe|-|-|==Stars(rating="0" scale="1" type="small")==|
|Componente tare-conexe|== user(user="Tabara" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|
|'Sortare topologica':problema/sortaret|== user(user="Tabara" type="tiny") ==|== user(user="DitzoneC" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Lant hamiltonian|-|-|==Stars(rating="0" scale="1" type="small")==|
|Ciclu eulerian|-|-|==Stars(rating="0" scale="1" type="small")==|
|Arbore partial de cost minim|-|-|==Stars(rating="0" scale="1" type="small")==|
|'Algoritmul lui Dijkstra':problema/dijkstra|== user(user="Dastas" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|'Algoritmul Floyd-Warshall/Roy-Floyd':problema/royfloyd|== user(user="gabitzish1" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Algoritmul Bellman-Ford|-|-|==Stars(rating="0" scale="1" type="small")==|
|Flux maxim|== user(user="fireatmyself" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|
|Flux maxim de cost minim|-|-|==Stars(rating="0" scale="1" type="small")==|
|Cuplaj maxim|-|-|==Stars(rating="0" scale="1" type="small")==|
|Cuplaj maxim de cost minim|-|-|==Stars(rating="0" scale="1" type="small")==|
|Lowest Common Ancestor|== user(user="devilkind" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|
|2SAT|-|-|==Stars(rating="0" scale="1" type="small")==|
_Siruri de caractere:_
table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|'Potrivirea sirurilor':problema/strmatch|== user(user="Bogdan2412" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Arbori de sufixe|-|-|==Stars(rating="0" scale="1" type="small")==|
|Trie|-|-|==Stars(rating="0" scale="1" type="small")==|
_Structuri de date:_
table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|Heapuri|== user(user="floringh06" type="tiny") ==|== user(user="astronomy" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
|Hashuri|-|-|==Stars(rating="0" scale="1" type="small")==|
|'Arbori de intervale':problema/arbint|== user(user="cos_min" type="tiny") ==|== user(user="Ditzonec" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Arbori de intervale aplicatie 1|-|-|==Stars(rating="0" scale="1" type="small")==|
|Arbori de intervale aplicatie 2|-|-|==Stars(rating="0" scale="1" type="small")==|
|Arbori de intervale aplicatie 3|-|-|==Stars(rating="0" scale="1" type="small")==|
|Arbori de intervale aplicatie 4|-|-|==Stars(rating="0" scale="1" type="small")==|
|Algoritmi {$O(sqrtN)$}|-|-|==Stars(rating="0" scale="1" type="small")==|
|'Arbori indexati binar':problema/aib|== user(user="cos_min" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|'Range Minimum Query':problema/rmq|== user(user="devilkind" type="tiny") ==|== user(user="ditzonec" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Double ended queue (deque)|-|-|==Stars(rating="0" scale="1" type="small")==|
|Structuri de multimi disjuncte|== user(user="tm_radu" type="tiny")==|== user(user="astronomy" type="tiny")==|==Stars(rating="0" scale="1" type="small")==|
|Treapuri|== user(user="Bogdan2412" type="tiny") ==|== user(user="domino" type="tiny") ==|==Stars(rating="0" scale="1" type="small")==|
_Geometrie:_
table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|Intersectia a doua drepte|-|-|==Stars(rating="0" scale="1" type="small")==|
|Aria unui poligon|-|-|==Stars(rating="0" scale="1" type="small")==|
|Punct in poligon|-|-|==Stars(rating="0" scale="1" type="small")==|
|Infasuratoare convexa|-|-|==Stars(rating="0" scale="1" type="small")==|
|Diagrame Voronoi|-|-|==Stars(rating="0" scale="1" type="small")==|
|Distanta minima intre doua puncte in plan|-|-|==Stars(rating="0" scale="1" type="small")==|
|Distanta maxima intre doua puncte in plan|-|-|==Stars(rating="0" scale="1" type="small")==|
_Diverse:_
table(example). |_. Denumire problema|_. Voluntar|_. Responsabil IA|_. Finalizat|
|'Cautare binara':problema/cautbin|== user(user="toni2007" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|'Ridicare la putere in timp logaritmic':problema/lgput|== user(user="tudalex" type="tiny") ==|== user(user="filipb" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|'Evaluare de expresii':problema/evaluare|== user(user="sima_cotizo" type="tiny") ==|== user(user="Ditzonec" type="tiny") ==|==Stars(rating="1" scale="1" type="small")==|
|Sprague-Grundy(Teoria jocurilor)|-|-|==Stars(rating="0" scale="1" type="small")==|
|Statistici de ordine|-|-|==Stars(rating="0" scale="1" type="small")==|
|Operatii pe numere mari|== user(user="savim" type="tiny") ==|-|==Stars(rating="0" scale="1" type="small")==|
h2. Discutii pe forum
==SmfTopics(board_id="61")==
