| #3337090 |  Apostol David DavidAA007 | Sortare topologica | Arhiva educationala | 0.74 kb | 26 ian 26 22:07:56 | Evaluare completa: 100 puncte |
| #3337089 | Apostol David DavidAA007 | Sortare topologica | Arhiva educationala | 0.76 kb | 26 ian 26 22:06:53 | Evaluare completa: 0 puncte |
| #3337088 |  Vlaviano Mario Moryoka | Arbore partial de cost minim | Arhiva educationala | 1.54 kb | 26 ian 26 22:04:55 | Evaluare completa: 100 puncte |
| #3337087 |  Andrei Marian Something | Arbore partial de cost minim | Arhiva educationala | 1.97 kb | 26 ian 26 22:03:59 | Evaluare completa: 100 puncte |
| #3337086 |  Preda Maria Alexandra preda_alexandra | Algoritmul Bellman-Ford | Arhiva educationala | 1.30 kb | 26 ian 26 22:03:51 | Evaluare completa: 15 puncte |
| #3337085 |  Gligor Andrei Gliggy | Poligon | Arhiva de probleme | 1.73 kb | 26 ian 26 22:03:40 | Evaluare completa: 90 puncte |
| #3337084 |  Stancu Adrian adistancu10 | Parcurgere DFS - componente conexe | Arhiva educationala | 0.73 kb | 26 ian 26 22:02:10 | Evaluare completa: 100 puncte |
| #3337083 |  Cherascu Bogdan bogdi19 | BFS - Parcurgere in latime | Arhiva educationala | 0.94 kb | 26 ian 26 21:56:38 | Evaluare completa: 100 puncte |
| #3337082 |  Nicolau Matei mateinicoo | Algoritmul Bellman-Ford | Arhiva educationala | 1.06 kb | 26 ian 26 21:56:21 | Evaluare completa: 35 puncte |
| #3337081 |  Ciobanu Marius Marus | Floyd-Warshall/Roy-Floyd | Arhiva educationala | 0.69 kb | 26 ian 26 21:55:14 | Evaluare completa: 100 puncte |
| #3337080 | Vlaviano Mario Moryoka | Arbore partial de cost minim | Arhiva educationala | 1.19 kb | 26 ian 26 21:54:49 | Evaluare completa: 10 puncte |
| #3337079 | Cherascu Bogdan bogdi19 | BFS - Parcurgere in latime | Arhiva educationala | 0.92 kb | 26 ian 26 21:54:14 | Evaluare completa: 70 puncte |
| #3337078 | Ciobanu Marius Marus | Floyd-Warshall/Roy-Floyd | Arhiva educationala | 0.67 kb | 26 ian 26 21:53:47 | Evaluare completa: 50 puncte |
| #3337077 | Stancu Adrian adistancu10 | BFS - Parcurgere in latime | Arhiva educationala | 0.89 kb | 26 ian 26 21:53:09 | Evaluare completa: 100 puncte |
| #3337076 |  andrei popescu anon123 | Algoritmul lui Dijkstra | Arhiva educationala | 1.25 kb | 26 ian 26 21:52:45 | Evaluare completa: 100 puncte |
| #3337075 | Ciobanu Marius Marus | Floyd-Warshall/Roy-Floyd | Arhiva educationala | 0.61 kb | 26 ian 26 21:52:27 | Evaluare completa: 0 puncte |
| #3337074 |  Gridan Antonia GridanAntonia | Arbore partial de cost minim | Arhiva educationala | 1.26 kb | 26 ian 26 21:52:16 | Evaluare completa: 100 puncte |
| #3337073 | Gligor Andrei Gliggy | Poligon | Arhiva de probleme | 1.67 kb | 26 ian 26 21:52:04 | Evaluare completa: 70 puncte |
| #3337072 | Vlaviano Mario Moryoka | Arbore partial de cost minim | Arhiva educationala | 1.20 kb | 26 ian 26 21:52:02 | Evaluare completa: 10 puncte |
| #3337071 | Cherascu Bogdan bogdi19 | BFS - Parcurgere in latime | Arhiva educationala | 0.88 kb | 26 ian 26 21:51:51 | Evaluare completa: 70 puncte |
| #3337070 |  Sir Leonard The Third leonardthethird | Componente biconexe | Arhiva educationala | 1.96 kb | 26 ian 26 21:50:59 | Evaluare completa: 100 puncte |
| #3337069 | andrei popescu anon123 | Algoritmul lui Dijkstra | Arhiva educationala | 1.17 kb | 26 ian 26 21:50:56 | Evaluare completa: 20 puncte |
| #3337068 | andrei popescu anon123 | Algoritmul lui Dijkstra | Arhiva educationala | 1.19 kb | 26 ian 26 21:49:37 | Evaluare completa: 20 puncte |
| #3337067 | Gridan Antonia GridanAntonia | Arbore partial de cost minim | Arhiva educationala | 1.26 kb | 26 ian 26 21:48:08 | Evaluare completa: 0 puncte |
| #3337066 | andrei popescu anon123 | Algoritmul lui Dijkstra | Arhiva educationala | 1.34 kb | 26 ian 26 21:47:52 | Evaluare completa: 10 puncte |
Cu exceptia cazurilor in care se specifica altfel, continutul site-ului infoarena