Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #64782187
Rezumat problemă
#236
Fişierul text sort2.in conţine, dispuse pe mai multe linii, cel mult 100 de numere naturale, cu cel mult 4 cifre fiecare. Să se afişeze în fişierul sort2.out, în ordine crescătoare, toate numerele din fişierul sort2.in care au cel mult 2 cifre.
Variante Bacalaureat 2009
Candale Silviu (silviu) Detalii
| Problema | Sort2 | Operații I/O |
sort2.in/sort2.out
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #64782187 | Utilizator |
Olteanu Mara (maraolteanu675)
|
| Fișier | sort2.cpp | Dimensiune | 607 B |
| Data încărcării | 30 Mai 2026, 15:32 | Scor/rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
sort2.cpp:27:14: warning: character constant too long for its type 27 | cout<<'NU EXISTA'; | ^~~~~~~~~~~ sort2.cpp: In function ‘int main()’: sort2.cpp:18:40: warning: left operand of comma operator has no effect [-Wunused-value] 18 | swap(a[i,a[j]); | ^ sort2.cpp:18:46: error: expected ‘]’ before ‘)’ token 18 | swap(a[i,a[j]); | ^ | ] sort2.cpp:18:37: error: no matching function for call to ‘swap(int&)’ 18 | swap(a[i,a[j]); | ~~~~^~~~~~~~~~ In file included from /usr/include/c++/13/bits/exception_ptr.h:41, from /usr/include/c++/13/exception:164, from /usr/include/c++/13/ios:41, from /usr/include/c++/13/istream:40, from /usr/include/c++/13/fstream:40, from sort2.cpp:1: /usr/include/c++/13/bits/move.h:189:5: note: candidate: ‘template<class _Tp> std::_Require<std::__not_<std::__is_tuple_like<_Tp> >, std::is_move_constructible<_Tp>, std::is_move_assignable<_Tp> > std::swap(_Tp&, _Tp&)’ 189 | swap(_Tp& __a, _Tp& __b) | ^~~~ /usr/include/c++/13/bits/move.h:189:5: note: template argument deduction/substitution failed: sort2.cpp:18:37: note: candidate expects 2 arguments, 1 provided 18 | swap(a[i,a[j]); | ~~~~^~~~~~~~~~ /usr/include/c++/13/bits/move.h:213:5: note: candidate: ‘template<class _Tp, long unsigned int _Nm> std::__enable_if_t<std::__is_swappable<_Tp>::value> std::swap(_Tp (&)[_Nm], _Tp (&)[_Nm])’ 213 | swap(_Tp (&__a)[_Nm], _Tp (&__b)[_Nm]) | ^~~~ /usr/include/c++/13/bits/move.h:213:5: note: template argument deduction/substitution failed: sort2.cpp:18:37: note: mismatched types ‘_Tp [_Nm]’ and ‘int’ 18 | swap(a[i,a[j]); | ~~~~^~~~~~~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:64, from /usr/include/c++/13/string:51, from /usr/include/c++/13/bits/locale_classes.h:40, from /usr/include/c++/13/bits/ios_base.h:41, from /usr/include/c++/13/ios:44: /usr/include/c++/13/bits/stl_pair.h:879:5: note: candidate: ‘template<class _T1, class _T2> void std::swap(pair<_T1, _T2>&, pair<_T1, _T2>&)’ 879 | swap(pair<_T1, _T2>& __x, pair<_T1, _T2>& __y) | ^~~~ /usr/include/c++/13/bits/stl_pair.h:879:5: note: template argument deduction/substitution failed: sort2.cpp:18:37: note: mismatched types ‘std::pair<_T1, _T2>’ and ‘int’ 18 | swap(a[i,a[j]); | ~~~~^~~~~~~~~~ In file included from /usr/include/c++/13/string:54: /usr/include/c++/13/bits/basic_string.h:3994:5: note: candidate: ‘template<class _CharT, class _Traits, class _Alloc> void std::swap(__cxx11::basic_string<_CharT, _Traits, _Alloc>&, __cxx11::basic_string<_CharT, _Traits, _Alloc>&)’ 3994 | swap(basic_string<_CharT, _Traits, _Alloc>& __lhs, | ^~~~ /usr/include/c++/13/bits/basic_string.h:3994:5: note: template argument deduction/substitution failed: sort2.cpp:18:37: note: mismatched types ‘std::__cxx11::basic_string<_CharT, _Traits, _Alloc>’ and ‘int’ 18 | swap(a[i,a[j]); | ~~~~^~~~~~~~~~ /usr/include/c++/13/fstream:1271:5: note: candidate: ‘template<class _CharT, class _Traits> void std::swap(basic_filebuf<_CharT, _Traits>&, basic_filebuf<_CharT, _Traits>&)’ 1271 | swap(basic_filebuf<_CharT, _Traits>& __x, | ^~~~ /usr/include/c++/13/fstream:1271:5: note: template argument deduction/substitution failed: sort2.cpp:18:37: note: mismatched types ‘std::basic_filebuf<_CharT, _Traits>’ and ‘int’ 18 | swap(a[i,a[j]); | ~~~~^~~~~~~~~~ /usr/include/c++/13/fstream:1278:5: note: candidate: ‘template<class _CharT, class _Traits> void std::swap(basic_ifstream<_CharT, _Traits>&, basic_ifstream<_CharT, _Traits>&)’ 1278 | swap(basic_ifstream<_CharT, _Traits>& __x, | ^~~~ /usr/include/c++/13/fstream:1278:5: note: template argument deduction/substitution failed: sort2.cpp:18:37: note: mismatched types ‘std::basic_ifstream<_CharT, _Traits>’ and ‘int’ 18 | swap(a[i,a[j]); | ~~~~^~~~~~~~~~ /usr/include/c++/13/fstream:1285:5: note: candidate: ‘template<class _CharT, class _Traits> void std::swap(basic_ofstream<_CharT, _Traits>&, basic_ofstream<_CharT, _Traits>&)’ 1285 | swap(basic_ofstream<_CharT, _Traits>& __x, | ^~~~ /usr/include/c++/13/fstream:1285:5: note: template argument deduction/substitution failed: sort2.cpp:18:37: note: mismatched types ‘std::basic_ofstream<_CharT, _Traits>’ and ‘int’ 18 | swap(a[i,a[j]); | ~~~~^~~~~~~~~~ /usr/include/c++/13/fstream:1292:5: note: candidate: ‘template<class _CharT, class _Traits> void std::swap(basic_fstream<_CharT, _Traits>&, basic_fstream<_CharT, _Traits>&)’ 1292 | swap(basic_fstream<_CharT, _Traits>& __x, | ^~~~ /usr/include/c++/13/fstream:1292:5: note: template argument deduction/substitution failed: sort2.cpp:18:37: note: mismatched types ‘std::basic_fstream<_CharT, _Traits>’ and ‘int’ 18 | swap(a[i,a[j]); | ~~~~^~~~~~~~~~ /usr/include/c++/13/bits/exception_ptr.h:230:5: note: candidate: ‘void std::__exception_ptr::swap(exception_ptr&, exception_ptr&)’ 230 | swap(exception_ptr& __lhs, exception_ptr& __rhs) | ^~~~ /usr/include/c++/13/bits/exception_ptr.h:230:5: note: candidate expects 2 arguments, 1 provided
Cum funcționează evaluarea?
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
- probleme la care rezolvarea presupune scrierea unui program complet
- probleme la care rezolvarea presupune scrierea unei secvențe de program - câteva instrucțiuni, o listă de declarații, una sau mai multe funcții, etc.
Problema Sort2 face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
- Programul sursă este compilat folosind compilatorul corespunzător. Dacă în urma compilării se obțin erori sau avertismente, acestea sunt afișate în această pagină.
- Dacă programul a fost compilat, executabilul obținut va fi rulat, furnizându-i-se unul sau mai multe seturi de date de intrare, în concordanță cu restricțiile specifice problemei. Pentru fiecare set de date se obține un anumit punctaj, în raport cu corectitudinea soluției tale.
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ă.