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	#60308756	Utilizator	Plesnicute Cristian Ionut (CristianP2008)
Fișier	sortare_divizori.cpp	Dimensiune	705 B
Data încărcării	24 Octombrie 2025, 23:06	Scor/rezultat	Eroare de compilare

Evaluare

Mesaj compilare

sortare_divizori.cpp: In function 'int main()':
sortare_divizori.cpp:22:28: error: parameter declared 'auto'
     sort(v, v + n, [](auto a, auto b){

                            ^
sortare_divizori.cpp:22:36: error: parameter declared 'auto'
     sort(v, v + n, [](auto a, auto b){

                                    ^
sortare_divizori.cpp: In lambda function:
sortare_divizori.cpp:23:13: error: 'a' was not declared in this scope
         if (a.second == b.second) return a.first < b.first;

             ^
sortare_divizori.cpp:23:25: error: 'b' was not declared in this scope
         if (a.second == b.second) return a.first < b.first;

                         ^
sortare_divizori.cpp:24:16: error: 'a' was not declared in this scope
         return a.second > b.second;

                ^
sortare_divizori.cpp:24:27: error: 'b' was not declared in this scope
         return a.second > b.second;

                           ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__insertion_sort(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<long long int, int>*; _Compare = main()::__lambda4]':
/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<long long int, int>*; _Compare = main()::__lambda4]'
/usr/include/c++/4.8/bits/stl_algo.h:5500:55:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<long long int, int>*; _Compare = main()::__lambda4]'
sortare_divizori.cpp:25:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2159:29: error: no match for call to '(main()::__lambda4) (std::pair<long long int, int>&, std::pair<long long int, int>&)'
    if (__comp(*__i, *__first))
                             ^
sortare_divizori.cpp:22:21: note: candidates are:
     sort(v, v + n, [](auto a, auto b){

                     ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:2159:29: note: void (*)() <conversion>
    if (__comp(*__i, *__first))
                             ^
/usr/include/c++/4.8/bits/stl_algo.h:2159:29: note:   candidate expects 1 argument, 3 provided
sortare_divizori.cpp:22:37: note: main()::__lambda4
     sort(v, v + n, [](auto a, auto b){

                                     ^
sortare_divizori.cpp:22:37: note:   candidate expects 0 arguments, 2 provided
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h: In instantiation of 'void std::__heap_select(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<long long int, int>*; _Compare = main()::__lambda4]':
/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<long long int, int>*; _Compare = main()::__lambda4]'
/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<long long int, int>*; _Size = int; _Compare = main()::__lambda4]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<long long int, int>*; _Compare = main()::__lambda4]'
sortare_divizori.cpp:25:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:1948:27: error: no match for call to '(main()::__lambda4) (std::pair<long long int, int>&, std::pair<long long int, int>&)'
  if (__comp(*__i, *__first))
                           ^
sortare_divizori.cpp:22:21: note: candidates are:
     sort(v, v + n, [](auto a, auto b){

                     ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:1948:27: note: void (*)() <conversion>
  if (__comp(*__i, *__first))
                           ^
/usr/include/c++/4.8/bits/stl_algo.h:1948:27: note:   candidate expects 1 argument, 3 provided
sortare_divizori.cpp:22:37: note: main()::__lambda4
     sort(v, v + n, [](auto a, auto b){

                                     ^
sortare_divizori.cpp:22:37: note:   candidate expects 0 arguments, 2 provided
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/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<long long int, int>*; _Compare = main()::__lambda4]':
/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<long long int, int>*; _Compare = main()::__lambda4]'
/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<long long int, int>*; _Size = int; _Compare = main()::__lambda4]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<long long int, int>*; _Compare = main()::__lambda4]'
sortare_divizori.cpp:25:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:114:28: error: no match for call to '(main()::__lambda4) (std::pair<long long int, int>&, std::pair<long long int, int>&)'
       if (__comp(*__a, *__b))
                            ^
sortare_divizori.cpp:22:21: note: candidates are:
     sort(v, v + n, [](auto a, auto b){

                     ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:114:28: note: void (*)() <conversion>
       if (__comp(*__a, *__b))
                            ^
/usr/include/c++/4.8/bits/stl_algo.h:114:28: note:   candidate expects 1 argument, 3 provided
sortare_divizori.cpp:22:37: note: main()::__lambda4
     sort(v, v + n, [](auto a, auto b){

                                     ^
sortare_divizori.cpp:22:37: note:   candidate expects 0 arguments, 2 provided
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:116:25: error: no match for call to '(main()::__lambda4) (std::pair<long long int, int>&, std::pair<long long int, int>&)'
    if (__comp(*__b, *__c))
                         ^
sortare_divizori.cpp:22:21: note: candidates are:
     sort(v, v + n, [](auto a, auto b){

                     ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:116:25: note: void (*)() <conversion>
    if (__comp(*__b, *__c))
                         ^
/usr/include/c++/4.8/bits/stl_algo.h:116:25: note:   candidate expects 1 argument, 3 provided
sortare_divizori.cpp:22:37: note: main()::__lambda4
     sort(v, v + n, [](auto a, auto b){

                                     ^
sortare_divizori.cpp:22:37: note:   candidate expects 0 arguments, 2 provided
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:118:30: error: no match for call to '(main()::__lambda4) (std::pair<long long int, int>&, std::pair<long long int, int>&)'
    else if (__comp(*__a, *__c))
                              ^
sortare_divizori.cpp:22:21: note: candidates are:
     sort(v, v + n, [](auto a, auto b){

                     ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:118:30: note: void (*)() <conversion>
    else if (__comp(*__a, *__c))
                              ^
/usr/include/c++/4.8/bits/stl_algo.h:118:30: note:   candidate expects 1 argument, 3 provided
sortare_divizori.cpp:22:37: note: main()::__lambda4
     sort(v, v + n, [](auto a, auto b){

                                     ^
sortare_divizori.cpp:22:37: note:   candidate expects 0 arguments, 2 provided
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:123:33: error: no match for call to '(main()::__lambda4) (std::pair<long long int, int>&, std::pair<long long int, int>&)'
       else if (__comp(*__a, *__c))
                                 ^
sortare_divizori.cpp:22:21: note: candidates are:
     sort(v, v + n, [](auto a, auto b){

                     ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:123:33: note: void (*)() <conversion>
       else if (__comp(*__a, *__c))
                                 ^
/usr/include/c++/4.8/bits/stl_algo.h:123:33: note:   candidate expects 1 argument, 3 provided
sortare_divizori.cpp:22:37: note: main()::__lambda4
     sort(v, v + n, [](auto a, auto b){

                                     ^
sortare_divizori.cpp:22:37: note:   candidate expects 0 arguments, 2 provided
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:125:33: error: no match for call to '(main()::__lambda4) (std::pair<long long int, int>&, std::pair<long long int, int>&)'
       else if (__comp(*__b, *__c))
                                 ^
sortare_divizori.cpp:22:21: note: candidates are:
     sort(v, v + n, [](auto a, auto b){

                     ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:125:33: note: void (*)() <conversion>
       else if (__comp(*__b, *__c))
                                 ^
/usr/include/c++/4.8/bits/stl_algo.h:125:33: note:   candidate expects 1 argument, 3 provided
sortare_divizori.cpp:22:37: note: main()::__lambda4
     sort(v, v + n, [](auto a, auto b){

                                     ^
sortare_divizori.cpp:22:37: note:   candidate expects 0 arguments, 2 provided
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/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<long long int, int>*; _Tp = std::pair<long long int, int>; _Compare = main()::__lambda4]':
/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<long long int, int>*; _Compare = main()::__lambda4]'
/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<long long int, int>*; _Size = int; _Compare = main()::__lambda4]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<long long int, int>*; _Compare = main()::__lambda4]'
sortare_divizori.cpp:25:6:   required from here
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda4) (std::pair<long long int, int>&, const std::pair<long long int, int>&)'
    while (__comp(*__first, __pivot))
                                   ^
sortare_divizori.cpp:22:21: note: candidates are:
     sort(v, v + n, [](auto a, auto b){

                     ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: note: void (*)() <conversion>
    while (__comp(*__first, __pivot))
                                   ^
/usr/include/c++/4.8/bits/stl_algo.h:2263:35: note:   candidate expects 1 argument, 3 provided
sortare_divizori.cpp:22:37: note: main()::__lambda4
     sort(v, v + n, [](auto a, auto b){

                                     ^
sortare_divizori.cpp:22:37: note:   candidate expects 0 arguments, 2 provided
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda4) (const std::pair<long long int, int>&, std::pair<long long int, int>&)'
    while (__comp(__pivot, *__last))
                                  ^
sortare_divizori.cpp:22:21: note: candidates are:
     sort(v, v + n, [](auto a, auto b){

                     ^
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: note: void (*)() <conversion>
    while (__comp(__pivot, *__last))
                                  ^
/usr/include/c++/4.8/bits/stl_algo.h:2266:34: note:   candidate expects 1 argument, 3 provided
sortare_divizori.cpp:22:37: note: main()::__lambda4
     sort(v, v + n, [](auto a, auto b){

                                     ^
sortare_divizori.cpp:22:37: note:   candidate expects 0 arguments, 2 provided
In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0,
                 from /usr/include/c++/4.8/algorithm:62,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/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<long long int, int>*; _Distance = int; _Tp = std::pair<long long int, int>; _Compare = main()::__lambda4]':
/usr/include/c++/4.8/bits/stl_heap.h:448:15:   required from 'void std::make_heap(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<long long int, int>*; _Compare = main()::__lambda4]'
/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<long long int, int>*; _Compare = main()::__lambda4]'
/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<long long int, int>*; _Compare = main()::__lambda4]'
/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<long long int, int>*; _Size = int; _Compare = main()::__lambda4]'
/usr/include/c++/4.8/bits/stl_algo.h:5499:44:   required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = std::pair<long long int, int>*; _Compare = main()::__lambda4]'
sortare_divizori.cpp:25:6:   required from here
/usr/include/c++/4.8/bits/stl_heap.h:313:40: error: no match for call to '(main()::__lambda4) (std::pair<long long int, int>&, std::pair<long long int, int>&)'
        *(__first + (__secondChild - 1))))
                                        ^
sortare_divizori.cpp:22:21: note: candidates are:
     sort(v, v + n, [](auto a, auto b){

                     ^
In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0,
                 from /usr/include/c++/4.8/algorithm:62,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/usr/include/c++/4.8/bits/stl_heap.h:313:40: note: void (*)() <conversion>
        *(__first + (__secondChild - 1))))
                                        ^
/usr/include/c++/4.8/bits/stl_heap.h:313:40: note:   candidate expects 1 argument, 3 provided
sortare_divizori.cpp:22:37: note: main()::__lambda4
     sort(v, v + n, [](auto a, auto b){

                                     ^
sortare_divizori.cpp:22:37: note:   candidate expects 0 arguments, 2 provided
In file included from /usr/include/c++/4.8/algorithm:62:0,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/usr/include/c++/4.8/bits/stl_algo.h: At global scope:
/usr/include/c++/4.8/bits/stl_algo.h:2110:5: error: 'void std::__unguarded_linear_insert(_RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<long long int, int>*; _Compare = main()::__lambda4]', declared using local type 'main()::__lambda4', is used but never defined [-fpermissive]
     __unguarded_linear_insert(_RandomAccessIterator __last,
     ^
In file included from /usr/include/c++/4.8/bits/stl_algo.h:61:0,
                 from /usr/include/c++/4.8/algorithm:62,
                 from /usr/include/i386-linux-gnu/c++/4.8/bits/stdc++.h:64,
                 from sortare_divizori.cpp:1:
/usr/include/c++/4.8/bits/stl_heap.h:331:5: error: 'void std::__pop_heap(_RandomAccessIterator, _RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = std::pair<long long int, int>*; _Compare = main()::__lambda4]', declared using local type 'main()::__lambda4', is used but never defined [-fpermissive]
     __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
     ^
/usr/include/c++/4.8/bits/stl_heap.h:178:5: error: 'void std::__push_heap(_RandomAccessIterator, _Distance, _Distance, _Tp, _Compare) [with _RandomAccessIterator = std::pair<long long int, int>*; _Distance = int; _Tp = std::pair<long long int, int>; _Compare = main()::__lambda4]', declared using local type 'main()::__lambda4', is used but never defined [-fpermissive]
     __push_heap(_RandomAccessIterator __first, _Distance __holeIndex,
     ^

Cum funcționează evaluarea?