#473
BipartitComplet
Se consideră două mulţimi nevide A
şi B
, cu proprietatea că formează o partiție a mulțimii {1,2,...,n}.
Să se construiască un graf bipartit complet cu n
vârfuri, bipartit peste partiţia formată din mulțimile A
și B
.
Problema | BipartitComplet | Operații I/O |
bipartitcomplet.in /bipartitcomplet.out
|
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #15385894 | Utilizator | |
Fișier | bipartitcomplet.cpp | Dimensiune | 380 B |
Data încărcării | 12 Aprilie 2019, 08:30 | Scor / rezultat | Eroare de compilare |
bipartitcomplet.cpp:4:1: error: stray '\342' in program ifstream f(“bipartit.in”); ^ bipartitcomplet.cpp:4:1: error: stray '\200' in program bipartitcomplet.cpp:4:1: error: stray '\234' in program bipartitcomplet.cpp:4:1: error: stray '\342' in program bipartitcomplet.cpp:4:1: error: stray '\200' in program bipartitcomplet.cpp:4:1: error: stray '\235' in program bipartitcomplet.cpp:5:1: error: stray '\342' in program ofstream g(“bipartit.out”); ^ bipartitcomplet.cpp:5:1: error: stray '\200' in program bipartitcomplet.cpp:5:1: error: stray '\234' in program bipartitcomplet.cpp:5:1: error: stray '\342' in program bipartitcomplet.cpp:5:1: error: stray '\200' in program bipartitcomplet.cpp:5:1: error: stray '\235' in program bipartitcomplet.cpp:11:1: error: stray '\342' in program for(int i=1; i<=n; i++) for(int j=i; j<=n; j++) if(v[i]!=v[j]) a[i][j]=1; for(int i=1; i<=n; i++) {for(int j=1; j<=n; j++) {g<<a[i][j]<<” “;}g<<endl;} return 0; } ^ bipartitcomplet.cpp:11:1: error: stray '\200' in program bipartitcomplet.cpp:11:1: error: stray '\235' in program bipartitcomplet.cpp:11:1: error: stray '\342' in program bipartitcomplet.cpp:11:1: error: stray '\200' in program bipartitcomplet.cpp:11:1: error: stray '\234' in program bipartitcomplet.cpp:4:15: error: 'bipartit' was not declared in this scope ifstream f(“bipartit.in”); ^ bipartitcomplet.cpp:5:15: error: 'bipartit' was not declared in this scope ofstream g(“bipartit.out”); ^ bipartitcomplet.cpp: In function 'int main()': bipartitcomplet.cpp:9:47: error: 'v' was not declared in this scope { f>>n; f>>k; for(int i=1; i<=k; i++) { f>>x; v[x]=1; } ^ bipartitcomplet.cpp:11:52: error: 'v' was not declared in this scope for(int i=1; i<=n; i++) for(int j=i; j<=n; j++) if(v[i]!=v[j]) a[i][j]=1; for(int i=1; i<=n; i++) {for(int j=1; j<=n; j++) {g<<a[i][j]<<” “;}g<<endl;} return 0; } ^ bipartitcomplet.cpp:11:64: error: 'a' was not declared in this scope for(int i=1; i<=n; i++) for(int j=i; j<=n; j++) if(v[i]!=v[j]) a[i][j]=1; for(int i=1; i<=n; i++) {for(int j=1; j<=n; j++) {g<<a[i][j]<<” “;}g<<endl;} return 0; } ^ bipartitcomplet.cpp:11:128: error: 'a' was not declared in this scope for(int i=1; i<=n; i++) for(int j=i; j<=n; j++) if(v[i]!=v[j]) a[i][j]=1; for(int i=1; i<=n; i++) {for(int j=1; j<=n; j++) {g<<a[i][j]<<” “;}g<<endl;} return 0; } ^ bipartitcomplet.cpp:11:144: error: expected primary-expression before ';' token for(int i=1; i<=n; i++) for(int j=i; j<=n; j++) if(v[i]!=v[j]) a[i][j]=1; for(int i=1; i<=n; i++) {for(int j=1; j<=n; j++) {g<<a[i][j]<<” “;}g<<endl;} return 0; } ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema BipartitComplet 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ă.