h2(#ap1). Aplicatia #1

bq. Se dau n <= $10$ $000$ $000$ unsigned long int, pentru fiecare spuneti cati de biti de 1 sunt in scrierea lor.

bq. Se dau n <= 10.000.000 unsigned long int, pentru fiecare spuneti cati de biti de 1 sunt in scrierea lor.

|_. date.in|_. date.out|

| $7317$ | $7$ |

| 7317 | 7 |

h4. Explicatie:

|_. date.in|_. date.out|
| 7317 | 7 |
 
h3. Explicatie:

* $7317$ = $1$ $1100$ $1001$ $0101 ~(2)~$

 7317 =  1 1100 1001 0101 ~(2)~

h2(#ap2). Aplicatia #2
bq. Se da un numar, afisati cel mai mic numar mai mare ca el care are acelasi numar de biti si cel mai mare numar mai mic ca el care are acelasi numar de biti.
|_. date.in|_. date.out|

| $6$
| $9$
$2$|
 
h4. Explicatie:
 
* $6$ = $0110 ~(2)~$
* $9$ = $1001 ~(2)~$
* $5$ = $0101 ~(2)~$

| 6
| 9
2|
 
h3. Explicatie:
 
 6 = 0110 ~(2)~
 9 = 1001 ~(2)~
 5 = 0101 ~(2)~

h2(#ap3). Aplicatia 3

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?

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$
$7$ $9$ $7$ $3$ $9$ | $3$ |

|5 | 3 |
 
h3. Explicatie:
 
7 9 7 3 9

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

|_. 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! |

|_. 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! |