#1608
Sortare Divizori
Se dau n
numere naturale nenule. Ordonați descrescător cele n
numere după numărul lor de divizori.
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 | #44119065 | Utilizator | |
Fișier | sortare_divizori.cpp | Dimensiune | 1.03 KB |
Data încărcării | 26 Iunie 2023, 04:13 | Scor / rezultat | Eroare de compilare |
sortare_divizori.cpp: In lambda function: sortare_divizori.cpp:34:15: error: 'class std::vector<std::pair<int, int> >' has no member named 'first' if (a.first < b.first) { ^ sortare_divizori.cpp:38:19: error: 'class std::vector<std::pair<int, int> >' has no member named 'first' if (a.first == b.first) { ^ sortare_divizori.cpp:39:27: error: 'class std::vector<std::pair<int, int> >' has no member named 'second' return (a.second < b.second); ^ In file included from /usr/include/c++/4.8/algorithm:62:0, from sortare_divizori.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h: In instantiation of '_RandomAccessIterator std::__unguarded_partition(_RandomAccessIterator, _RandomAccessIterator, const _Tp&, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Tp = std::pair<int, int>; _Compare = main()::__lambda0]': /usr/include/c++/4.8/bits/stl_algo.h:2296:78: required from '_RandomAccessIterator std::__unguarded_partition_pivot(_RandomAccessIterator, _RandomAccessIterator, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:2337:62: required from 'void std::__introsort_loop(_RandomAccessIterator, _RandomAccessIterator, _Size, _Compare) [with _RandomAccessIterator = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Size = int; _Compare = main()::__lambda0]' /usr/include/c++/4.8/bits/stl_algo.h:5499:44: required from 'void std::sort(_RAIter, _RAIter, _Compare) [with _RAIter = __gnu_cxx::__normal_iterator<std::pair<int, int>*, std::vector<std::pair<int, int> > >; _Compare = main()::__lambda0]' sortare_divizori.cpp:43:10: required from here /usr/include/c++/4.8/bits/stl_algo.h:2263:35: error: no match for call to '(main()::__lambda0) (std::pair<int, int>&, const std::pair<int, int>&)' while (__comp(*__first, __pivot)) ^ sortare_divizori.cpp:33:33: note: candidate is: sort(a.begin(), a.end(), [&a](pair<int, int>& a, pair<int, int>& b) { ^ sortare_divizori.cpp:33:71: note: main()::__lambda0 sort(a.begin(), a.end(), [&a](pair<int, int>& a, pair<int, int>& b) { ^ sortare_divizori.cpp:33:71: note: no known conversion for argument 2 from 'const std::pair<int, int>' to 'std::pair<int, int>&' In file included from /usr/include/c++/4.8/algorithm:62:0, from sortare_divizori.cpp:4: /usr/include/c++/4.8/bits/stl_algo.h:2266:34: error: no match for call to '(main()::__lambda0) (const std::pair<int, int>&, std::pair<int, int>&)' while (__comp(__pivot, *__last)) ^ sortare_divizori.cpp:33:33: note: candidate is: sort(a.begin(), a.end(), [&a](pair<int, int>& a, pair<int, int>& b) { ^ sortare_divizori.cpp:33:71: note: main()::__lambda0 sort(a.begin(), a.end(), [&a](pair<int, int>& a, pair<int, int>& b) { ^ sortare_divizori.cpp:33:71: note: no known conversion for argument 1 from 'const std::pair<int, int>' to 'std::pair<int, int>&' sortare_divizori.cpp:43:9: warning: control reaches end of non-void function [-Wreturn-type] }); ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Sortare Divizori face parte din prima categorie. Soluția propusă de tine va fi evaluată astfel:
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ă.