#412
Adiacenta
Se dă lista muchiilor unui graf neorientat. Să se afișeze matricea de adiacență a grafului.
Problema | Adiacenta | Operații I/O |
adiacenta.in /adiacenta.out
|
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #53612370 | Utilizator | |
Fișier | adiacenta.cpp | Dimensiune | 382 B |
Data încărcării | 06 Noiembrie 2024, 14:03 | Scor / rezultat | Eroare de compilare |
adiacenta.cpp:10:9: warning: multi-character character constant [-Wmultichar] g<<'/n'; ^ adiacenta.cpp: In function 'int main()': adiacenta.cpp:7:6: error: 'intx' was not declared in this scope for(intx,y,i-1,i<=m;++1) {f>>x>>y;a[x][y]=a[x][y]=1;} ^ adiacenta.cpp:7:11: error: 'y' was not declared in this scope for(intx,y,i-1,i<=m;++1) {f>>x>>y;a[x][y]=a[x][y]=1;} ^ adiacenta.cpp:7:13: error: 'i' was not declared in this scope for(intx,y,i-1,i<=m;++1) {f>>x>>y;a[x][y]=a[x][y]=1;} ^ adiacenta.cpp:7:24: error: lvalue required as increment operand for(intx,y,i-1,i<=m;++1) {f>>x>>y;a[x][y]=a[x][y]=1;} ^ adiacenta.cpp:7:25: error: expected ';' before ')' token for(intx,y,i-1,i<=m;++1) {f>>x>>y;a[x][y]=a[x][y]=1;} ^ adiacenta.cpp:7:31: error: 'x' was not declared in this scope for(intx,y,i-1,i<=m;++1) {f>>x>>y;a[x][y]=a[x][y]=1;} ^ adiacenta.cpp:8:12: error: expected unqualified-id before '=' token for(int=1;i<=n;i++) ^ adiacenta.cpp:8:12: error: expected ';' before '=' token adiacenta.cpp:8:12: error: expected primary-expression before '=' token adiacenta.cpp:8:15: error: 'i' was not declared in this scope for(int=1;i<=n;i++) ^ adiacenta.cpp:8:19: error: expected ')' before ';' token for(int=1;i<=n;i++) ^ adiacenta.cpp:8:20: error: 'i' was not declared in this scope for(int=1;i<=n;i++) ^ adiacenta.cpp:8:23: error: expected ';' before ')' token for(int=1;i<=n;i++) ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Adiacenta 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ă.