Rezumat problemă

Sortare Divizori

#1608

Se dau n numere naturale nenule. Ordonați descrescător cele n numere după numărul lor de divizori.

Fișiere Sacuiu Silviu (silviu_s) medie

Clasa 9 Tablouri unidimensionale (vectori) Sortarea vectorilor

Rezolvă

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	#12347223	Utilizator	Ruben Simion (simionruben)
Fișier	sortare_divizori.cpp	Dimensiune	631 B
Data încărcării	26 Noiembrie 2018, 23:11	Scor / rezultat	Eroare de compilare

Evaluare

Mesaj compilare

sortare_divizori.cpp:23:19: error: 'b' has not been declared
 bool CMP (nod a,  b)

                   ^
sortare_divizori.cpp: In function 'bool CMP(nod, int)':
sortare_divizori.cpp:25:12: error: 'b' was not declared in this scope
     return b.x>b.x;

            ^
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 = nod*; _Compare = bool (*)(nod, int)]':
/usr/include/c++/4.8/bits/stl_algo.h:3510:49:   required from 'void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = nod*; _Compare = bool (*)(nod, int)]'
/usr/include/c++/4.8/bits/stl_algo.h:5710:52:   required from 'void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = nod*; _Compare = bool (*)(nod, int)]'
sortare_divizori.cpp:38:32:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: cannot convert 'nod' to 'int' in argument passing
    if (__comp(*__i, *__first))
                             ^
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__merge_without_buffer(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Compare) [with _BidirectionalIterator = nod*; _Distance = int; _Compare = bool (*)(nod, int)]':
/usr/include/c++/4.8/bits/stl_algo.h:3519:13:   required from 'void std::__inplace_stable_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = nod*; _Compare = bool (*)(nod, int)]'
/usr/include/c++/4.8/bits/stl_algo.h:5710:52:   required from 'void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = nod*; _Compare = bool (*)(nod, int)]'
sortare_divizori.cpp:38:32:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:3101:34: error: cannot convert 'nod' to 'int' in argument passing
    if (__comp(*__middle, *__first))
                                  ^
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__move_merge_adaptive(_InputIterator1, _InputIterator1, _InputIterator2, _InputIterator2, _OutputIterator, _Compare) [with _InputIterator1 = nod*; _InputIterator2 = nod*; _OutputIterator = nod*; _Compare = bool (*)(nod, int)]':
/usr/include/c++/4.8/bits/stl_algo.h:3001:25:   required from 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = nod*; _Distance = int; _Pointer = nod*; _Compare = bool (*)(nod, int)]'
/usr/include/c++/4.8/bits/stl_algo.h:3480:14:   required from 'void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = nod*; _Pointer = nod*; _Distance = int; _Compare = bool (*)(nod, int)]'
/usr/include/c++/4.8/bits/stl_algo.h:5713:44:   required from 'void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = nod*; _Compare = bool (*)(nod, int)]'
sortare_divizori.cpp:38:32:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2787:35: error: cannot convert 'nod' to 'int' in argument passing
    if (__comp(*__first2, *__first1))
                                   ^
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__move_merge_adaptive_backward(_BidirectionalIterator1, _BidirectionalIterator1, _BidirectionalIterator2, _BidirectionalIterator2, _BidirectionalIterator3, _Compare) [with _BidirectionalIterator1 = nod*; _BidirectionalIterator2 = nod*; _BidirectionalIterator3 = nod*; _Compare = bool (*)(nod, int)]':
/usr/include/c++/4.8/bits/stl_algo.h:3007:40:   required from 'void std::__merge_adaptive(_BidirectionalIterator, _BidirectionalIterator, _BidirectionalIterator, _Distance, _Distance, _Pointer, _Distance, _Compare) [with _BidirectionalIterator = nod*; _Distance = int; _Pointer = nod*; _Compare = bool (*)(nod, int)]'
/usr/include/c++/4.8/bits/stl_algo.h:3480:14:   required from 'void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = nod*; _Pointer = nod*; _Distance = int; _Compare = bool (*)(nod, int)]'
/usr/include/c++/4.8/bits/stl_algo.h:5713:44:   required from 'void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = nod*; _Compare = bool (*)(nod, int)]'
sortare_divizori.cpp:38:32:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2868:33: error: cannot convert 'nod' to 'int' in argument passing
    if (__comp(*__last2, *__last1))
                                 ^
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_OutputIterator std::__move_merge(_InputIterator1, _InputIterator1, _InputIterator2, _InputIterator2, _OutputIterator, _Compare) [with _InputIterator1 = nod*; _InputIterator2 = nod*; _OutputIterator = nod*; _Compare = bool (*)(nod, int)]':
/usr/include/c++/4.8/bits/stl_algo.h:3337:28:   required from 'void std::__merge_sort_loop(_RandomAccessIterator1, _RandomAccessIterator1, _RandomAccessIterator2, _Distance, _Compare) [with _RandomAccessIterator1 = nod*; _RandomAccessIterator2 = nod*; _Distance = int; _Compare = bool (*)(nod, int)]'
/usr/include/c++/4.8/bits/stl_algo.h:3419:25:   required from 'void std::__merge_sort_with_buffer(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Compare) [with _RandomAccessIterator = nod*; _Pointer = nod*; _Compare = bool (*)(nod, int)]'
/usr/include/c++/4.8/bits/stl_algo.h:3473:69:   required from 'void std::__stable_sort_adaptive(_RandomAccessIterator, _RandomAccessIterator, _Pointer, _Distance, _Compare) [with _RandomAccessIterator = nod*; _Pointer = nod*; _Distance = int; _Compare = bool (*)(nod, int)]'
/usr/include/c++/4.8/bits/stl_algo.h:5713:44:   required from 'void std::stable_sort(_RAIter, _RAIter, _Compare) [with _RAIter = nod*; _Compare = bool (*)(nod, int)]'
sortare_divizori.cpp:38:32:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:3282:35: error: cannot convert 'nod' to 'int' in argument passing
    if (__comp(*__first2, *__first1))
                                   ^
sortare_divizori.cpp:26:1: warning: control reaches end of non-void function [-Wreturn-type]
 }

 ^

Cum funcționează evaluarea?