#421
Se dă lista muchiilor unui graf neorientat cu n
vârfuri, etichetate de la 1
la n
. Din acest graf se elimină toate muchiile cu o extremitate de grad maxim și cealaltă extremitate de grad minim. Să se determine numărul de muchii eliminate și să se afișeze matricea de adiacență a grafului parțial obținut.
Problema | Graf Partial 1 | Operații I/O |
![]() graf_partial_1.in /graf_partial_1.out
|
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #58098207 | Utilizator | |
Fișier | graf_partial_1.cpp | Dimensiune | 837 B |
Data încărcării | 14 Mai 2025, 08:36 | Scor / rezultat | Eroare de compilare |
graf_partial_1.cpp:5:1: error: expected ',' or ';' before 'ofstream' ofstream g("graf_partial_1.out") ^ graf_partial_1.cpp: In function 'int main()': graf_partial_1.cpp:8:5: error: 'n' was not declared in this scope {f>>n; ^ graf_partial_1.cpp:9:11: error: 'i' was not declared in this scope while(f>>i>>j)a[i][j]=a[j][i]=1; ^ graf_partial_1.cpp:9:14: error: 'j' was not declared in this scope while(f>>i>>j)a[i][j]=a[j][i]=1; ^ graf_partial_1.cpp:9:16: error: 'a' was not declared in this scope while(f>>i>>j)a[i][j]=a[j][i]=1; ^ graf_partial_1.cpp:10:2: error: 'mini' was not declared in this scope mini=n+1; ^ graf_partial_1.cpp:11:6: error: 'i' was not declared in this scope for(i=1;i<=n;i++) ^ graf_partial_1.cpp:13:7: error: 'j' was not declared in this scope for(j=1;j<=n;j++)s=s+a[i][j]; ^ graf_partial_1.cpp:13:24: error: 'a' was not declared in this scope for(j=1;j<=n;j++)s=s+a[i][j]; ^ graf_partial_1.cpp:14:3: error: 'grad' was not declared in this scope grad[i]=s; ^ graf_partial_1.cpp:15:8: error: 'maxi' was not declared in this scope if(s>maxi)maxi=s; ^ graf_partial_1.cpp:18:6: error: 'i' was not declared in this scope for(i=1;i<=n;i++){ ^ graf_partial_1.cpp:19:10: error: 'j' was not declared in this scope for(j=i+1;j<=n;j++) ^ graf_partial_1.cpp:20:13: error: 'a' was not declared in this scope if(a[i][j]=1)if(grad[i]==mini && grad[j]==maxi || grad[i]==maxi && grad[j]==mini){nr++; ^ graf_partial_1.cpp:20:26: error: 'grad' was not declared in this scope if(a[i][j]=1)if(grad[i]==mini && grad[j]==maxi || grad[i]==maxi && grad[j]==mini){nr++; ^ graf_partial_1.cpp:20:52: error: 'maxi' was not declared in this scope if(a[i][j]=1)if(grad[i]==mini && grad[j]==maxi || grad[i]==maxi && grad[j]==mini){nr++; ^ graf_partial_1.cpp:20:92: error: 'nr' was not declared in this scope if(a[i][j]=1)if(grad[i]==mini && grad[j]==maxi || grad[i]==maxi && grad[j]==mini){nr++; ^ graf_partial_1.cpp:24:2: error: 'g' was not declared in this scope g<<nr; ^ graf_partial_1.cpp:24:5: error: 'nr' was not declared in this scope g<<nr; ^ graf_partial_1.cpp:26:6: error: 'i' was not declared in this scope for(i=1;i<=n;i++){ ^ graf_partial_1.cpp:27:10: error: 'j' was not declared in this scope for(j=1;i<=n;j++)g<<a[i][j]<<" "; ^ graf_partial_1.cpp:27:26: error: 'a' was not declared in this scope for(j=1;i<=n;j++)g<<a[i][j]<<" "; ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Graf Partial 1 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ă.