#3433
Forta
Forța unui număr natural nenul X
este egală cu numărul de divizori pozitivi ai lui X
. De exemplu, numărul X = 10
are forţa 4
, deoarece 10
are 4
divizori, mulțimea divizorilor fiind D
10
= {1,2,5,10}
.
Scrieţi un program care, cunoscând un șir de n
numere naturale nenule, rezolvă următoarele cerințe:
1. determină cel mai mic număr din șir care are forța maximă;
2. determină lungimea maximă a unei secvențe formată din numere cu aceeași forţă ce poate fi obținută prin rearanjarea convenabilă a elementelor din șir.
OJI 2020, clasa a VI-a
Problema | Forta | Operații I/O |
forta.in /forta.out
|
---|---|---|---|
Limita timp | 0.5 secunde | Limita memorie |
Total: 16 MB
/
Stivă 8 MB
|
Id soluție | #22875739 | Utilizator | |
Fișier | forta.cpp | Dimensiune | 1.15 KB |
Data încărcării | 10 Mai 2020, 21:10 | Scor / rezultat | Eroare de compilare |
forta.cpp: In function 'int main()': forta.cpp:32:16: error: call of overloaded 'div(int&, int&)' is ambiguous div(a,k); ^ forta.cpp:32:16: note: candidates are: In file included from /usr/include/c++/4.8/cstdlib:72:0, from /usr/include/c++/4.8/ext/string_conversions.h:41, from /usr/include/c++/4.8/bits/basic_string.h:2815, from /usr/include/c++/4.8/string:52, 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 forta.cpp:1: /usr/include/stdlib.h:789:14: note: div_t div(int, int) extern div_t div (int __numer, int __denom) ^ forta.cpp:5:6: note: void div(int, int&) void div(int x,int &k) ^ In file included from /usr/include/c++/4.8/ext/string_conversions.h:41:0, from /usr/include/c++/4.8/bits/basic_string.h:2815, from /usr/include/c++/4.8/string:52, 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 forta.cpp:1: /usr/include/c++/4.8/cstdlib:214:3: note: lldiv_t __gnu_cxx::div(long long int, long long int) div(long long __n, long long __d) ^ /usr/include/c++/4.8/cstdlib:169:3: note: ldiv_t std::div(long int, long int) div(long __i, long __j) { return ldiv(__i, __j); } ^ forta.cpp:56:20: error: call of overloaded 'div(int&, int&)' is ambiguous div(a,k); ^ forta.cpp:56:20: note: candidates are: In file included from /usr/include/c++/4.8/cstdlib:72:0, from /usr/include/c++/4.8/ext/string_conversions.h:41, from /usr/include/c++/4.8/bits/basic_string.h:2815, from /usr/include/c++/4.8/string:52, 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 forta.cpp:1: /usr/include/stdlib.h:789:14: note: div_t div(int, int) extern div_t div (int __numer, int __denom) ^ forta.cpp:5:6: note: void div(int, int&) void div(int x,int &k) ^ In file included from /usr/include/c++/4.8/ext/string_conversions.h:41:0, from /usr/include/c++/4.8/bits/basic_string.h:2815, from /usr/include/c++/4.8/string:52, 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 forta.cpp:1: /usr/include/c++/4.8/cstdlib:214:3: note: lldiv_t __gnu_cxx::div(long long int, long long int) div(long long __n, long long __d) ^ /usr/include/c++/4.8/cstdlib:169:3: note: ldiv_t std::div(long int, long int) div(long __i, long __j) { return ldiv(__i, __j); } ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Forta 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ă.