| #3164100 | Cordunianu Radu Radush | Arbore partial de cost minim | Arhiva educationala | 2.00 kb | 2 nov 23 09:01:29 | Evaluare completa: 90 puncte |
| #3164099 | Cordunianu Radu Radush | Arbore partial de cost minim | Arhiva educationala | 2.01 kb | 2 nov 23 09:00:21 | Evaluare completa: 0 puncte |
| #3164098 | Darius Gherca DariusGherca | Arbore partial de cost minim | Arhiva educationala | 1.09 kb | 2 nov 23 08:54:49 | Evaluare completa: 100 puncte |
| #3164097 | IDorando tomaionut | Secvmax | Arhiva de probleme | 1.76 kb | 2 nov 23 08:39:29 | Evaluare completa: 100 puncte |
| #3164096 | Ferseta Matei eu_stiu_info | Algoritmul lui Euclid extins | Arhiva educationala | 0.63 kb | 2 nov 23 08:18:21 | Evaluare completa: 100 puncte |
| #3164095 | Goidan Matei-Constantin Mateicosti | Parcurgere DFS - componente conexe | Arhiva educationala | 0.99 kb | 2 nov 23 02:04:46 | Evaluare completa: 100 puncte |
| #3164094 | Goidan Matei-Constantin Mateicosti | Parcurgere DFS - componente conexe | Arhiva educationala | 0.99 kb | 2 nov 23 02:01:03 | Evaluare completa: 35 puncte |
| #3164093 | Goidan Matei-Constantin Mateicosti | Parcurgere DFS - componente conexe | Arhiva educationala | 0.99 kb | 2 nov 23 02:00:10 | Evaluare completa: 65 puncte |
| #3164092 | Goidan Matei-Constantin Mateicosti | Parcurgere DFS - componente conexe | Arhiva educationala | 0.99 kb | 2 nov 23 01:58:48 | Evaluare completa: 15 puncte |
| #3164091 | Goidan Matei-Constantin Mateicosti | Parcurgere DFS - componente conexe | Arhiva educationala | 0.97 kb | 2 nov 23 01:57:44 | Evaluare completa: 5 puncte |
| #3164090 | Goidan Matei-Constantin Mateicosti | Parcurgere DFS - componente conexe | Arhiva educationala | 0.97 kb | 2 nov 23 01:57:16 | Evaluare completa: 0 puncte |
| #3164089 | Goidan Matei-Constantin Mateicosti | Parcurgere DFS - componente conexe | Arhiva educationala | 1.06 kb | 2 nov 23 01:49:37 | Evaluare completa: 15 puncte |
| #3164088 | Goidan Matei-Constantin Mateicosti | Parcurgere DFS - componente conexe | Arhiva educationala | 1.08 kb | 2 nov 23 01:48:38 | Evaluare completa: 0 puncte |
| #3164087 | Goidan Matei-Constantin Mateicosti | Parcurgere DFS - componente conexe | Arhiva educationala | 1.09 kb | 2 nov 23 01:48:06 | Evaluare completa: 0 puncte |
| #3164086 | Goidan Matei-Constantin Mateicosti | Parcurgere DFS - componente conexe | Arhiva educationala | 1.12 kb | 2 nov 23 01:46:21 | Evaluare completa: 0 puncte |
| #3164085 | Andrei Dogarel AndreiKatsuki | Patrol2 | Arhiva de probleme | 2.01 kb | 2 nov 23 01:09:44 | Evaluare completa: 100 puncte |
| #3164084 | Andrei Dogarel AndreiKatsuki | Patrol2 | Arhiva de probleme | 2.01 kb | 2 nov 23 01:02:06 | Evaluare completa: 39 puncte |
| #3164083 | Andrei Dogarel AndreiKatsuki | Patrol2 | Arhiva de probleme | 1.80 kb | 2 nov 23 00:55:35 | Evaluare completa: 39 puncte |
| #3164082 | Lungu Laura-Vanesa copacel | Parcurgere DFS - componente conexe | Arhiva educationala | 1.36 kb | 2 nov 23 00:46:26 | Evaluare completa: 100 puncte |
| #3164081 | Lungu Laura-Vanesa copacel | Parcurgere DFS - componente conexe | Arhiva educationala | 1.34 kb | 2 nov 23 00:41:19 | Evaluare completa: 0 puncte |
| #3164080 | Lungu Laura-Vanesa copacel | Parcurgere DFS - componente conexe | Arhiva educationala | 1.37 kb | 2 nov 23 00:40:06 | Evaluare completa: 0 puncte |
| #3164079 | Samy Dragos samyro14 | Easygraph | Teme Pregatire ACM Unibuc 2014, Anul I, Semestrul 2 | 1.17 kb | 2 nov 23 00:16:47 | Evaluare completa: 100 puncte |
| #3164078 | Samy Dragos samyro14 | Easygraph | Arhiva ICPC | 1.17 kb | 2 nov 23 00:16:28 | Evaluare completa: 100 puncte |
| #3164077 | Samy Dragos samyro14 | Easygraph | Arhiva ICPC | 1.15 kb | 2 nov 23 00:15:37 | Evaluare completa: 0 puncte |
| #3164076 | Samy Dragos samyro14 | Easygraph | Arhiva ICPC | 1.12 kb | 2 nov 23 00:12:57 | Evaluare completa: 100 puncte |