#2491641 | Andrei Budoi andreibudoi | Cele mai apropiate puncte din plan | Arhiva educationala | 2.02 kb | 12 nov 19 21:34:38 | Evaluare completa: 10 puncte |
#2491458 | Andrei Budoi andreibudoi | Cele mai apropiate puncte din plan | Arhiva educationala | 1.46 kb | 12 nov 19 17:12:32 | Evaluare completa: 10 puncte |
#2491456 | Andrei Budoi andreibudoi | Cele mai apropiate puncte din plan | Arhiva educationala | 1.46 kb | 12 nov 19 17:10:51 | Eroare de compilare: 0 puncte |
#2424709 | Andrei Budoi andreibudoi | Flux maxim de cost minim | Arhiva educationala | 2.17 kb | 23 mai 19 18:36:59 | Evaluare completa: 100 puncte |
#2424708 | Andrei Budoi andreibudoi | Algoritmul Bellman-Ford | Arhiva educationala | 0.99 kb | 23 mai 19 18:34:34 | Evaluare completa: 100 puncte |
#2422198 | Andrei Budoi andreibudoi | Flux maxim | Arhiva educationala | 1.26 kb | 17 mai 19 18:57:13 | Evaluare completa: 40 puncte |
#2421669 | Andrei Budoi andreibudoi | Floyd-Warshall/Roy-Floyd | Arhiva educationala | 0.64 kb | 15 mai 19 18:15:02 | Evaluare completa: 100 puncte |
#2421649 | Andrei Budoi andreibudoi | Arbore partial de cost minim | Arhiva educationala | 1.41 kb | 15 mai 19 16:53:36 | Evaluare completa: 100 puncte |
#2421648 | Andrei Budoi andreibudoi | Arbore partial de cost minim | Arhiva educationala | 1.36 kb | 15 mai 19 16:52:38 | Evaluare completa: 100 puncte |
#2421647 | Andrei Budoi andreibudoi | Paduri de multimi disjuncte | Arhiva educationala | 0.73 kb | 15 mai 19 16:50:53 | Evaluare completa: 100 puncte |
#2421646 | Andrei Budoi andreibudoi | Paduri de multimi disjuncte | Arhiva educationala | 0.71 kb | 15 mai 19 16:50:10 | Evaluare completa: 100 puncte |
#2421645 | Andrei Budoi andreibudoi | Paduri de multimi disjuncte | Arhiva educationala | 0.71 kb | 15 mai 19 16:49:40 | Eroare de compilare: 0 puncte |
#2421644 | Andrei Budoi andreibudoi | Arbore partial de cost minim | Arhiva educationala | 1.38 kb | 15 mai 19 16:47:51 | Evaluare completa: 90 puncte |
#2421641 | Andrei Budoi andreibudoi | Arbore partial de cost minim | Arhiva educationala | 1.36 kb | 15 mai 19 16:38:35 | Evaluare completa: 90 puncte |
#2421640 | Andrei Budoi andreibudoi | Arbore partial de cost minim | Arhiva educationala | 1.36 kb | 15 mai 19 16:38:08 | Eroare de compilare: 0 puncte |
#2421639 | Andrei Budoi andreibudoi | Paduri de multimi disjuncte | Arhiva educationala | 0.69 kb | 15 mai 19 16:29:37 | Evaluare completa: 40 puncte |
#2421638 | Andrei Budoi andreibudoi | Paduri de multimi disjuncte | Arhiva educationala | 0.69 kb | 15 mai 19 16:27:47 | Eroare de compilare: 0 puncte |
#2421603 | Andrei Budoi andreibudoi | Arbore partial de cost minim | Arhiva educationala | 1.35 kb | 15 mai 19 13:42:43 | Evaluare completa: 90 puncte |
#2421602 | Andrei Budoi andreibudoi | Arbore partial de cost minim | Arhiva educationala | 1.41 kb | 15 mai 19 13:39:47 | Evaluare completa: 90 puncte |
#2420586 | Andrei Budoi andreibudoi | Algoritmul lui Dijkstra | Arhiva educationala | 1.20 kb | 12 mai 19 19:05:22 | Evaluare completa: 100 puncte |
#2420585 | Andrei Budoi andreibudoi | Algoritmul lui Dijkstra | Arhiva educationala | 1.19 kb | 12 mai 19 19:03:24 | Evaluare completa: 90 puncte |
#2405633 | Andrei Budoi andreibudoi | Algoritmul lui Dijkstra | Arhiva educationala | 1.05 kb | 14 apr 19 18:32:59 | Evaluare completa: 50 puncte |
#2405631 | Andrei Budoi andreibudoi | Algoritmul lui Dijkstra | Arhiva educationala | 0.23 kb | 14 apr 19 18:32:24 | Evaluare completa: 0 puncte |
#2389556 | Andrei Budoi andreibudoi | BFS - Parcurgere in latime | Arhiva educationala | 0.86 kb | 27 mar 19 11:20:48 | Evaluare completa: 100 puncte |
#2389555 | Andrei Budoi andreibudoi | Parcurgere DFS - componente conexe | Arhiva educationala | 0.67 kb | 27 mar 19 11:20:16 | Evaluare completa: 100 puncte |