Acest site foloseşte cookies. Navigând în continuare, vă exprimaţi acordul asupra folosirii cookie-urilor.
Detalii evaluare #54678205
Rezumat problemă
#1608
Sortare Divizori
Se dau n numere naturale nenule. Ordonați descrescător cele n numere după numărul lor de divizori.
Sacuiu Silviu (silviu_s) Detalii
| Problema | Sortare Divizori | Operații I/O |
sortare_divizori.in/sortare_divizori.out
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #54678205 | Utilizator |
Cifor Octavian (Octavian_C4)
|
| Fișier | sortare_divizori.cpp | Dimensiune | 842 B |
| Data încărcării | 05 Decembrie 2024, 10:47 | Scor / rezultat | Eroare de compilare |
Evaluare
Mesaj compilare
In file included from /usr/include/c++/4.8/algorithm:62:0, from sortare_divizori.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, int>*; _Compare = std::greater<int>]': /usr/include/c++/4.8/bits/stl_algo.h:2226:70: required from 'void std::__final_insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, int>*; _Compare = std::greater<int>]' /usr/include/c++/4.8/bits/stl_algo.h:5500:55: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<int, int>*; _Compare = std::greater<int>]' sortare_divizori.cpp:19:34: required from here /usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(std::greater<int>) (std::pair<int, int>&, std::pair<int, int>&)' if (__comp(*__i, *__first)) ^ In file included from /usr/include/c++/4.8/string:48:0, from /usr/include/c++/4.8/bits/locale_classes.h:40, from /usr/include/c++/4.8/bits/ios_base.h:41, from /usr/include/c++/4.8/ios:42, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from sortare_divizori.cpp:1: /usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is: struct greater : public binary_function<_Tp, _Tp, bool> ^ /usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int] operator()(const _Tp& __x, const _Tp& __y) const ^ /usr/include/c++/4.8/bits/stl_function.h:225:7: note: no known conversion for argument 1 from 'std::pair<int, int>' to 'const int&' In file included from /usr/include/c++/4.8/algorithm:62:0, from sortare_divizori.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, int>*; _Compare = std::greater<int>]': /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = std::pair<int, int>*; _Compare = std::greater<int>]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = std::pair<int, int>*; _Size = int; _Compare = std::greater<int>]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<int, int>*; _Compare = std::greater<int>]' sortare_divizori.cpp:19:34: required from here /usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(std::greater<int>) (std::pair<int, int>&, std::pair<int, int>&)' if (__comp(*__i, *__first)) ^ In file included from /usr/include/c++/4.8/string:48:0, from /usr/include/c++/4.8/bits/locale_classes.h:40, from /usr/include/c++/4.8/bits/ios_base.h:41, from /usr/include/c++/4.8/ios:42, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from sortare_divizori.cpp:1: /usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is: struct greater : public binary_function<_Tp, _Tp, bool> ^ /usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int] operator()(const _Tp& __x, const _Tp& __y) const ^ /usr/include/c++/4.8/bits/stl_function.h:225:7: note: no known conversion for argument 1 from 'std::pair<int, int>' to 'const int&' In file included from /usr/include/c++/4.8/algorithm:62:0, from sortare_divizori.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__move_median_to_first(_Iterator, _Iterator, _Iterator, _Iterator, _Compare) [with _Iterator = std::pair<int, int>*; _Compare = std::greater<int>]': /usr/include/c++/4.8/bits/stl_algo.h:2295:13: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, int>*; _Compare = std::greater<int>]' /usr/include/c++/4.8/bits/stl_algo.h:2337:62: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = std::pair<int, int>*; _Size = int; _Compare = std::greater<int>]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<int, int>*; _Compare = std::greater<int>]' sortare_divizori.cpp:19:34: required from here /usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(std::greater<int>) (std::pair<int, int>&, std::pair<int, int>&)' if (__comp(*__a, *__b)) ^ In file included from /usr/include/c++/4.8/string:48:0, from /usr/include/c++/4.8/bits/locale_classes.h:40, from /usr/include/c++/4.8/bits/ios_base.h:41, from /usr/include/c++/4.8/ios:42, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from sortare_divizori.cpp:1: /usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is: struct greater : public binary_function<_Tp, _Tp, bool> ^ /usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int] operator()(const _Tp& __x, const _Tp& __y) const ^ /usr/include/c++/4.8/bits/stl_function.h:225:7: note: no known conversion for argument 1 from 'std::pair<int, int>' to 'const int&' In file included from /usr/include/c++/4.8/algorithm:62:0, from sortare_divizori.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(std::greater<int>) (std::pair<int, int>&, std::pair<int, int>&)' if (__comp(*__b, *__c)) ^ In file included from /usr/include/c++/4.8/string:48:0, from /usr/include/c++/4.8/bits/locale_classes.h:40, from /usr/include/c++/4.8/bits/ios_base.h:41, from /usr/include/c++/4.8/ios:42, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from sortare_divizori.cpp:1: /usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is: struct greater : public binary_function<_Tp, _Tp, bool> ^ /usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int] operator()(const _Tp& __x, const _Tp& __y) const ^ /usr/include/c++/4.8/bits/stl_function.h:225:7: note: no known conversion for argument 1 from 'std::pair<int, int>' to 'const int&' In file included from /usr/include/c++/4.8/algorithm:62:0, from sortare_divizori.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(std::greater<int>) (std::pair<int, int>&, std::pair<int, int>&)' else if (__comp(*__a, *__c)) ^ In file included from /usr/include/c++/4.8/string:48:0, from /usr/include/c++/4.8/bits/locale_classes.h:40, from /usr/include/c++/4.8/bits/ios_base.h:41, from /usr/include/c++/4.8/ios:42, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from sortare_divizori.cpp:1: /usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is: struct greater : public binary_function<_Tp, _Tp, bool> ^ /usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int] operator()(const _Tp& __x, const _Tp& __y) const ^ /usr/include/c++/4.8/bits/stl_function.h:225:7: note: no known conversion for argument 1 from 'std::pair<int, int>' to 'const int&' In file included from /usr/include/c++/4.8/algorithm:62:0, from sortare_divizori.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(std::greater<int>) (std::pair<int, int>&, std::pair<int, int>&)' else if (__comp(*__a, *__c)) ^ In file included from /usr/include/c++/4.8/string:48:0, from /usr/include/c++/4.8/bits/locale_classes.h:40, from /usr/include/c++/4.8/bits/ios_base.h:41, from /usr/include/c++/4.8/ios:42, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from sortare_divizori.cpp:1: /usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is: struct greater : public binary_function<_Tp, _Tp, bool> ^ /usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int] operator()(const _Tp& __x, const _Tp& __y) const ^ /usr/include/c++/4.8/bits/stl_function.h:225:7: note: no known conversion for argument 1 from 'std::pair<int, int>' to 'const int&' In file included from /usr/include/c++/4.8/algorithm:62:0, from sortare_divizori.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(std::greater<int>) (std::pair<int, int>&, std::pair<int, int>&)' else if (__comp(*__b, *__c)) ^ In file included from /usr/include/c++/4.8/string:48:0, from /usr/include/c++/4.8/bits/locale_classes.h:40, from /usr/include/c++/4.8/bits/ios_base.h:41, from /usr/include/c++/4.8/ios:42, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from sortare_divizori.cpp:1: /usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is: struct greater : public binary_function<_Tp, _Tp, bool> ^ /usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int] operator()(const _Tp& __x, const _Tp& __y) const ^ /usr/include/c++/4.8/bits/stl_function.h:225:7: note: no known conversion for argument 1 from 'std::pair<int, int>' to 'const int&' In file included from /usr/include/c++/4.8/algorithm:62:0, from sortare_divizori.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = std::pair<int, int>*; _Tp = std::pair<int, int>; _Compare = std::greater<int>]': /usr/include/c++/4.8/bits/stl_algo.h:2296:78: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, int>*; _Compare = std::greater<int>]' /usr/include/c++/4.8/bits/stl_algo.h:2337:62: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = std::pair<int, int>*; _Size = int; _Compare = std::greater<int>]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<int, int>*; _Compare = std::greater<int>]' sortare_divizori.cpp:19:34: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(std::greater<int>) (std::pair<int, int>&, const std::pair<int, int>&)' while (__comp(*__first, __pivot)) ^ In file included from /usr/include/c++/4.8/string:48:0, from /usr/include/c++/4.8/bits/locale_classes.h:40, from /usr/include/c++/4.8/bits/ios_base.h:41, from /usr/include/c++/4.8/ios:42, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from sortare_divizori.cpp:1: /usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is: struct greater : public binary_function<_Tp, _Tp, bool> ^ /usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int] operator()(const _Tp& __x, const _Tp& __y) const ^ /usr/include/c++/4.8/bits/stl_function.h:225:7: note: no known conversion for argument 1 from 'std::pair<int, int>' to 'const int&' In file included from /usr/include/c++/4.8/algorithm:62:0, from sortare_divizori.cpp:2: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(std::greater<int>) (const std::pair<int, int>&, std::pair<int, int>&)' while (__comp(__pivot, *__last)) ^ In file included from /usr/include/c++/4.8/string:48:0, from /usr/include/c++/4.8/bits/locale_classes.h:40, from /usr/include/c++/4.8/bits/ios_base.h:41, from /usr/include/c++/4.8/ios:42, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from sortare_divizori.cpp:1: /usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is: struct greater : public binary_function<_Tp, _Tp, bool> ^ /usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int] operator()(const _Tp& __x, const _Tp& __y) const ^ /usr/include/c++/4.8/bits/stl_function.h:225:7: note: no known conversion for argument 1 from 'const std::pair<int, int>' to 'const int&' In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0, from /usr/include/c++/4.8/algorithm:62, from sortare_divizori.cpp:2: /usr/include/c++/4.8/bits/stl_heap.h: In instantiation of 'void std::__adjust_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = std::pair<int, int>*; _Distance = int; _Tp = std::pair<int, int>; _Compare = std::greater<int>]': /usr/include/c++/4.8/bits/stl_heap.h:448:15: required from 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<int, int>*; _Compare = std::greater<int>]' /usr/include/c++/4.8/bits/stl_algo.h:1946:47: required from 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<int, int>*; _Compare = std::greater<int>]' /usr/include/c++/4.8/bits/stl_algo.h:5349:59: required from 'void std::partial_sort(_RAIter, _RAIter, _RAIter, _Compare) [with _RAIter = std::pair<int, int>*; _Compare = std::greater<int>]' /usr/include/c++/4.8/bits/stl_algo.h:2332:68: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = std::pair<int, int>*; _Size = int; _Compare = std::greater<int>]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<int, int>*; _Compare = std::greater<int>]' sortare_divizori.cpp:19:34: required from here /usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(std::greater<int>) (std::pair<int, int>&, std::pair<int, int>&)' *(__first + (__secondChild - 1)))) ^ In file included from /usr/include/c++/4.8/string:48:0, from /usr/include/c++/4.8/bits/locale_classes.h:40, from /usr/include/c++/4.8/bits/ios_base.h:41, from /usr/include/c++/4.8/ios:42, from /usr/include/c++/4.8/istream:38, from /usr/include/c++/4.8/fstream:38, from sortare_divizori.cpp:1: /usr/include/c++/4.8/bits/stl_function.h:222:12: note: candidate is: struct greater : public binary_function<_Tp, _Tp, bool> ^ /usr/include/c++/4.8/bits/stl_function.h:225:7: note: bool std::greater<_Tp>::operator()(const _Tp&, const _Tp&) const [with _Tp = int] operator()(const _Tp& __x, const _Tp& __y) const ^ /usr/include/c++/4.8/bits/stl_function.h:225:7: note: no known conversion for argument 1 from 'std::pair<int, int>' to 'const int&'
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 Divizori 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ă.