bq. Se da un sir de n = 2k + 1 (k <= $10$ $000$ $000$) numere, toate numerele vor aparea de un numar par de ori mai putin unul care este acela?
|_. sir.in|_. sir.out|

|$5$ | $3$ |
 
h4. Explicatie:
 
* $7$ $9$ $7$ $3$ $9$

| $5$
$7$ $9$ $7$ $3$ $9$ | $3$ |

h2(#asd). Algoritmi si Structuri de Date 'Arhiva Educationala':http://infoarena.ro/arhiva-educationala

|_. Problema|_. ==User(user = "the_snyper06")== |_. ==User(user = "mihaibogdan10")==|
| 'Floyd-Warshall/Roy-Floyd':http://infoarena.ro/problema/royfloyd | !tema?task_solved.gif! |  !tema?task_solved.gif! |
| 'Algoritmul lui Dijkstra':http://infoarena.ro/problema/dijkstra ( N ^2^  si M log N cu heapuri sau arbori de intervale + cu stl ( 3 implementari))| !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Parcurgere in latime':http://infoarena.ro/problema/bfs | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Parcurgere DFS - componente conexe':http://infoarena.ro/problema/dfs (recursiv si iterativ) | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Paduri de multimi disjuncte':http://infoarena.ro/problema/disjoint | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Componente biconexe':http://infoarena.ro/problema/biconex DF O(n) | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Deque':http://infoarena.ro/problema/deque | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Componente tare conexe':http://infoarena.ro/problema/ctc | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Algoritmul Bellman-Ford':http://infoarena.ro/problema/bellmanford | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Arbore partial de cost minim':http://infoarena.ro/problema/apm (Kruscal, Prim) | !tema?task_solved.gif! | !tema?task_solved.gif! |

|_. Problema|_. ==User(user = "the_snyper06")== |_. ==User(user = "mihaibogdan10")==|_. ==User(user = "paul24090")==|
| 'Floyd-Warshall/Roy-Floyd':http://infoarena.ro/problema/royfloyd | !tema?task_solved.gif! |  !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Algoritmul lui Dijkstra':http://infoarena.ro/problema/dijkstra ( $N ^2^$  si $M$ $log ~2~ N$ cu heapuri sau arbori de intervale + cu stl ( 3 implementari))| !tema?task_solved.gif! | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Parcurgere in latime':http://infoarena.ro/problema/bfs | !tema?task_solved.gif! | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Parcurgere DFS - componente conexe':http://infoarena.ro/problema/dfs (recursiv si iterativ) | !tema?task_solved.gif! | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Paduri de multimi disjuncte':http://infoarena.ro/problema/disjoint | !tema?task_solved.gif! | !tema?task_solved.gif! | !tema?task_unsolved.gif! |
| 'Componente biconexe':http://infoarena.ro/problema/biconex DF O(n) | !tema?task_solved.gif! | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Deque':http://infoarena.ro/problema/deque | !tema?task_solved.gif! | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Componente tare conexe':http://infoarena.ro/problema/ctc | !tema?task_solved.gif! | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Algoritmul Bellman-Ford':http://infoarena.ro/problema/bellmanford | !tema?task_solved.gif! | !tema?task_solved.gif! | !tema?task_unsolved.gif! |
| 'Arbore partial de cost minim':http://infoarena.ro/problema/apm (Kruscal, Prim) | !tema?task_solved.gif! | !tema?task_solved.gif! | !tema?task_solved.gif! |
| 'Heapuri':http://infoarena.ro/problema/heapuri | !tema?task_solved.gif! | !tema?task_solved.gif! | !tema?task_unsolved.gif! |