Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #64932317
Rezumat problemă
#1399
Se citește un șir cu n numere întregi. Să se rearanjeze elementele șirului astfel ca numerele negative să fie ordonate descrescător. apoi să urmeze elementele nule, urmate de numerele pozitive ordonate descrescător.
Szabo Zoltan (SzaboZoltan) Detalii
| Problema | sortare_in_trepte | Operații I/O |
 tastatură/ecran
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #64932317 | Utilizator |
Dimian Alexandra (dimian_alexandra)
|
| Fișier | sortare_in_trepte.cpp | Dimensiune | 728 B |
| Data încărcării | 16 Iunie 2026, 08:32 | Scor/rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
sortare_in_trepte.cpp: In function ‘int main()’: sortare_in_trepte.cpp:13:28: error: invalid types ‘long long int[long long int]’ for array subscript 13 | if(v[i]<0){nrn++; n[nrn]=v[i];} | ^ sortare_in_trepte.cpp:20:16: error: invalid types ‘long long int[int]’ for array subscript 20 | cout<<n[i]<<" "; | ^ sortare_in_trepte.cpp:9:18: warning: unused variable ‘k’ [-Wunused-variable] 9 | long long n, k, nrp=0, nrn=0, nr0=0, cop; | ^ sortare_in_trepte.cpp:9:42: warning: unused variable ‘cop’ [-Wunused-variable] 9 | long long n, k, nrp=0, nrn=0, nr0=0, cop; | ^~~ In file included from /usr/include/c++/13/algorithm:61, from sortare_in_trepte.cpp:3: /usr/include/c++/13/bits/stl_algo.h: In instantiation of ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’: /usr/include/c++/13/bits/stl_algo.h:1859:25: required from ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ /usr/include/c++/13/bits/stl_algo.h:1950:31: required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ /usr/include/c++/13/bits/stl_algo.h:4861:18: required from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = long long int]’ sortare_in_trepte.cpp:17:9: required from here /usr/include/c++/13/bits/stl_algo.h:1822:17: error: no type named ‘value_type’ in ‘struct std::iterator_traits<long long int>’ 1822 | __val = _GLIBCXX_MOVE(*__i); | ^~~~~ /usr/include/c++/13/bits/stl_algo.h:1824:15: error: invalid type argument of unary ‘*’ (have ‘long long int’) 1824 | *__first = _GLIBCXX_MOVE(__val); | ^~~~~~~~ /usr/include/c++/13/bits/stl_algo.h:1822:17: error: no type named ‘value_type’ in ‘struct std::iterator_traits<long long int>’ 1822 | __val = _GLIBCXX_MOVE(*__i); | ^~~~~ In file included from /usr/include/c++/13/bits/stl_algobase.h:71, 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, from /usr/include/c++/13/ostream:40, from /usr/include/c++/13/iostream:41, from sortare_in_trepte.cpp:1: /usr/include/c++/13/bits/predefined_ops.h: In instantiation of ‘bool __gnu_cxx::__ops::_Iter_less_iter::operator()(_Iterator1, _Iterator2) const [with _Iterator1 = long long int; _Iterator2 = long long int]’: /usr/include/c++/13/bits/stl_algo.h:1819:14: required from ‘void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ /usr/include/c++/13/bits/stl_algo.h:1859:25: required from ‘void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ /usr/include/c++/13/bits/stl_algo.h:1950:31: required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ /usr/include/c++/13/bits/stl_algo.h:4861:18: required from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = long long int]’ sortare_in_trepte.cpp:17:9: required from here /usr/include/c++/13/bits/predefined_ops.h:45:16: error: invalid type argument of unary ‘*’ (have ‘long long int’) 45 | { return *__it1 < *__it2; } | ^~~~~~ /usr/include/c++/13/bits/predefined_ops.h:45:25: error: invalid type argument of unary ‘*’ (have ‘long long int’) 45 | { return *__it1 < *__it2; } | ^~~~~~ In file included from /usr/include/c++/13/bits/stl_algo.h:61: /usr/include/c++/13/bits/stl_heap.h: In instantiation of ‘void std::__make_heap(_RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’: /usr/include/c++/13/bits/stl_algo.h:1635:23: required from ‘void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ /usr/include/c++/13/bits/stl_algo.h:1910:25: required from ‘void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ /usr/include/c++/13/bits/stl_algo.h:1926:27: required from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = long long int; _Size = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ /usr/include/c++/13/bits/stl_algo.h:1947:25: required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ /usr/include/c++/13/bits/stl_algo.h:4861:18: required from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = long long int]’ sortare_in_trepte.cpp:17:9: required from here /usr/include/c++/13/bits/stl_heap.h:344:11: error: no type named ‘value_type’ in ‘struct std::iterator_traits<long long int>’ 344 | _ValueType; | ^~~~~~~~~~ /usr/include/c++/13/bits/stl_heap.h:346:11: error: no type named ‘difference_type’ in ‘struct std::iterator_traits<long long int>’ 346 | _DistanceType; | ^~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_heap.h: In instantiation of ‘void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare&) [with _RandomAccessIterator = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’: /usr/include/c++/13/bits/stl_algo.h:1638:19: required from ‘void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ /usr/include/c++/13/bits/stl_algo.h:1910:25: required from ‘void std::__partial_sort(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ /usr/include/c++/13/bits/stl_algo.h:1926:27: required from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = long long int; _Size = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ /usr/include/c++/13/bits/stl_algo.h:1947:25: required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ /usr/include/c++/13/bits/stl_algo.h:4861:18: required from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = long long int]’ sortare_in_trepte.cpp:17:9: required from here /usr/include/c++/13/bits/stl_heap.h:258:9: error: no type named ‘value_type’ in ‘struct std::iterator_traits<long long int>’ 258 | _ValueType; | ^~~~~~~~~~ /usr/include/c++/13/bits/stl_heap.h:260:9: error: no type named ‘difference_type’ in ‘struct std::iterator_traits<long long int>’ 260 | _DistanceType; | ^~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_heap.h:263:7: error: invalid type argument of unary ‘*’ (have ‘long long int’) 263 | *__result = _GLIBCXX_MOVE(*__first); | ^~~~~~~~~ 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: /usr/include/c++/13/bits/stl_heap.h:263:19: error: invalid type argument of unary ‘*’ (have ‘long long int’) 263 | *__result = _GLIBCXX_MOVE(*__first); | ^~~~~~~~~~~~~ /usr/include/c++/13/bits/stl_algobase.h: In instantiation of ‘void std::iter_swap(_ForwardIterator1, _ForwardIterator2) [with _ForwardIterator1 = long long int; _ForwardIterator2 = long long int]’: /usr/include/c++/13/bits/stl_algo.h:91:20: required from ‘void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ /usr/include/c++/13/bits/stl_algo.h:1897:34: required from ‘_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ /usr/include/c++/13/bits/stl_algo.h:1931:38: required from ‘void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = long long int; _Size = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ /usr/include/c++/13/bits/stl_algo.h:1947:25: required from ‘void std::__sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = long long int; _Compare = __gnu_cxx::__ops::_Iter_less_iter]’ /usr/include/c++/13/bits/stl_algo.h:4861:18: required from ‘void std::sort(_RAIter, _RAIter) [with _RAIter = long long int]’ sortare_in_trepte.cpp:17:9: required from here /usr/include/c++/13/bits/stl_algobase.h:185:12: error: invalid type argument of unary ‘*’ (have ‘long long int’) 185 | swap(*__a, *__b); | ^~~~ /usr/include/c++/13/bits/stl_algobase.h:185:18: error: invalid type argument of unary ‘*’ (have ‘long long int’) 185 | swap(*__a, *__b); | ^~~~
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 sortare_in_trepte 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ă.