#86
HalfSort
Să se scrie un program care ordonează crescător elementele din prima jumătate a unui vector și descrescător elementele din a doua jumătate.
Problema | HalfSort | Operații I/O |
halfsort.in /halfsort.out
|
---|---|---|---|
Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #47568774 | Utilizator | |
Fișier | halfsort.cpp | Dimensiune | 452 B |
Data încărcării | 17 Decembrie 2023, 14:20 | Scor / rezultat | Eroare de compilare |
halfsort.cpp:3:13: error: variable 'std::ifstream cin' has initializer but incomplete type ifstream cin("halfsort.in"); ^ halfsort.cpp:4:14: error: variable 'std::ofstream cout' has initializer but incomplete type ofstream cout("halfsort.out"); ^ halfsort.cpp: In function 'int main()': halfsort.cpp:7:3: error: reference to 'cin' is ambiguous { cin>>n; ^ halfsort.cpp:3:10: note: candidates are: <typeprefixerror>cin ifstream cin("halfsort.in"); ^ In file included from halfsort.cpp:1:0: /usr/include/c++/4.8/iostream:60:18: note: std::istream std::cin extern istream cin; /// Linked to standard input ^ halfsort.cpp:9:1: error: reference to 'cin' is ambiguous cin>>v[i]; ^ halfsort.cpp:3:10: note: candidates are: <typeprefixerror>cin ifstream cin("halfsort.in"); ^ In file included from halfsort.cpp:1:0: /usr/include/c++/4.8/iostream:60:18: note: std::istream std::cin extern istream cin; /// Linked to standard input ^ halfsort.cpp:16:13: error: expected ')' before '{' token if(v[i] { int aux=v[i]; v[i]=v[j]; v[j]=aux;}} ^ halfsort.cpp:16:50: error: expected primary-expression before '}' token if(v[i] { int aux=v[i]; v[i]=v[j]; v[j]=aux;}} ^ halfsort.cpp:16:50: error: expected ';' before '}' token halfsort.cpp:18:8: error: reference to 'cout' is ambiguous cout<<v[i]; ^ halfsort.cpp:4:10: note: candidates are: <typeprefixerror>cout ofstream cout("halfsort.out"); ^ In file included from halfsort.cpp:1:0: /usr/include/c++/4.8/iostream:61:18: note: std::ostream std::cout extern ostream cout; /// Linked to standard output ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema HalfSort 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ă.