#1608
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 | #64482227 | Utilizator | |
| Fișier | sortare_divizori.cpp | Dimensiune | 785 B |
| Data încărcării | 10 Mai 2026, 11:19 | Scor/rezultat | Eroare de compilare |
sortare_divizori.cpp:5:1: error: expected unqualified-id before ‘{’ token 5 | { int div(int x) | ^ sortare_divizori.cpp: In function ‘int main()’: sortare_divizori.cpp:26:23: error: no matching function for call to ‘div(int&)’ 26 | int d1=div(v[i]); | ~~~^~~~~~ In file included from /usr/include/c++/13/cstdlib:79, from /usr/include/c++/13/ext/string_conversions.h:43, from /usr/include/c++/13/bits/basic_string.h:4109, from /usr/include/c++/13/string:54, 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_divizori.cpp:1: /usr/include/stdlib.h:992:14: note: candidate: ‘div_t div(int, int)’ 992 | extern div_t div (int __numer, int __denom) | ^~~ /usr/include/stdlib.h:992:14: note: candidate expects 2 arguments, 1 provided /usr/include/c++/13/cstdlib:217:3: note: candidate: ‘lldiv_t __gnu_cxx::div(long long int, long long int)’ 217 | div(long long __n, long long __d) | ^~~ /usr/include/c++/13/cstdlib:217:3: note: candidate expects 2 arguments, 1 provided /usr/include/c++/13/cstdlib:181:3: note: candidate: ‘ldiv_t std::div(long int, long int)’ 181 | div(long __i, long __j) _GLIBCXX_NOTHROW { return ldiv(__i, __j); } | ^~~ /usr/include/c++/13/cstdlib:181:3: note: candidate expects 2 arguments, 1 provided sortare_divizori.cpp:27:23: error: no matching function for call to ‘div(int&)’ 27 | int d2=div(v[j]); | ~~~^~~~~~ /usr/include/stdlib.h:992:14: note: candidate: ‘div_t div(int, int)’ 992 | extern div_t div (int __numer, int __denom) | ^~~ /usr/include/stdlib.h:992:14: note: candidate expects 2 arguments, 1 provided /usr/include/c++/13/cstdlib:217:3: note: candidate: ‘lldiv_t __gnu_cxx::div(long long int, long long int)’ 217 | div(long long __n, long long __d) | ^~~ /usr/include/c++/13/cstdlib:217:3: note: candidate expects 2 arguments, 1 provided /usr/include/c++/13/cstdlib:181:3: note: candidate: ‘ldiv_t std::div(long int, long int)’ 181 | div(long __i, long __j) _GLIBCXX_NOTHROW { return ldiv(__i, __j); } | ^~~ /usr/include/c++/13/cstdlib:181:3: note: candidate expects 2 arguments, 1 provided
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ă.