#1318
Bipartit1mare
Se dă lista muchiilor unui graf neorientat cu n
vârfuri, etichetate de la 1
la n
. Să se verifice dacă graful este bipartit.
Problema | Bipartit1mare | Operații I/O |
bipartit1mare.in /bipartit1mare.out
|
---|---|---|---|
Limita timp | 0.3 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #30051795 | Utilizator | |
Fișier | bipartit1mare.cpp | Dimensiune | 891 B |
Data încărcării | 09 Iunie 2021, 10:34 | Scor / rezultat | Eroare de compilare |
bipartit1mare.cpp: In function 'void citire()': bipartit1mare.cpp:8:10: error: 'n' was not declared in this scope fin>>n>>m; ^ bipartit1mare.cpp:8:13: error: 'm' was not declared in this scope fin>>n>>m; ^ bipartit1mare.cpp:11:14: error: 'x' was not declared in this scope fin>>x>>y; ^ bipartit1mare.cpp:11:17: error: 'y' was not declared in this scope fin>>x>>y; ^ bipartit1mare.cpp:12:9: error: 'a' was not declared in this scope a[x][y]=a[y][x]=1; ^ bipartit1mare.cpp: In function 'void afisare(int)': bipartit1mare.cpp:18:20: error: 'n' was not declared in this scope for(int i=1;i<=n;i++) ^ bipartit1mare.cpp:20:12: error: 's' was not declared in this scope if(s[i]==1) ^ bipartit1mare.cpp: In function 'int conti(int)': bipartit1mare.cpp:29:12: error: 's' was not declared in this scope if(s[k]=s[i] && a[k][1]==1) ^ bipartit1mare.cpp:29:25: error: 'a' was not declared in this scope if(s[k]=s[i] && a[k][1]==1) ^ bipartit1mare.cpp: In function 'void back(int)': bipartit1mare.cpp:36:11: error: 'n' was not declared in this scope if(k==n+1) ^ bipartit1mare.cpp:38:20: error: 'verificare' was not declared in this scope verificare(); ^ bipartit1mare.cpp:42:29: error: 'ok' was not declared in this scope for(int i=1;i<=2 && ok==0;i++) ^ bipartit1mare.cpp:44:13: error: 's' was not declared in this scope s[k]=1; ^ bipartit1mare.cpp: In function 'int main()': bipartit1mare.cpp:55:5: error: 's' was not declared in this scope s[1]=1; ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Bipartit1mare 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ă.