#589
Se dă un graf orientat ponderat cu n noduri și m arce – în care fiecare arc are asociat un cost, număr natural strict pozitiv. Folosind algoritmul Roy-Floyd, construiți matricea drumurilor minime.
| Problema | Roy-Floyd | Operații I/O |
roy-floyd.in/roy-floyd.out
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #62562972 | Utilizator | |
| Fișier | roy-floyd.cpp | Dimensiune | 770 B |
| Data încărcării | 26 Ianuarie 2026, 10:09 | Scor/rezultat | Eroare de compilare |
roy-floyd.cpp:6:24: error: expected initializer before 'k' int m,n,i,j,a[101][101]k; ^ roy-floyd.cpp: In function 'int main()': roy-floyd.cpp:13:18: error: 'a' was not declared in this scope if(i==j) a[i][j]=0; ^ roy-floyd.cpp:14:14: error: 'a' was not declared in this scope else a[i][j]=infinit; ^ roy-floyd.cpp:16:11: error: 'x' was not declared in this scope {fin>>x>>y; ^ roy-floyd.cpp:16:14: error: 'y' was not declared in this scope {fin>>x>>y; ^ roy-floyd.cpp:17:11: error: 'a' was not declared in this scope fin>>a[x][y];} ^ roy-floyd.cpp:18:9: error: 'k' was not declared in this scope for(k=1;k<=n;k++) ^ roy-floyd.cpp:21:12: error: 'a' was not declared in this scope if(a[i][j]>a[i][k]+a[k][j]) ^ roy-floyd.cpp:25:12: error: 'a' was not declared in this scope if(a[i][j]==infinit) ^ roy-floyd.cpp:27:9: error: 'esle' was not declared in this scope esle fout<<a[i][j]<<" "; ^ roy-floyd.cpp:27:14: error: expected ';' before 'fout' esle fout<<a[i][j]<<" "; ^ roy-floyd.cpp: At global scope: roy-floyd.cpp:29:3: error: 'fin' does not name a type fin.close(); ^ roy-floyd.cpp:30:3: error: 'fout' does not name a type fout.close(); ^ roy-floyd.cpp:31:1: error: expected unqualified-id before 'return' return 0;} ^ roy-floyd.cpp:31:10: error: expected declaration before '}' token return 0;} ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Roy-Floyd face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
Suma punctajelor acordate pe testele utilizate pentru verificare este 100. Astfel, soluția ta poate obține cel mult 100 de puncte, caz în care se poate considera corectă.