#2925
FactorialnHard
Se dă numărul natural n
. Să se afișeze \( {(n!)}^{n} \).
Problema | FactorialnHard | Operații I/O | tastatură/ecran |
---|---|---|---|
Limita timp | 0.53 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
Id soluție | #53484168 | Utilizator | |
Fișier | factorialnhard.cpp | Dimensiune | 5.85 KB |
Data încărcării | 02 Noiembrie 2024, 11:27 | Scor / rezultat | 100 puncte |
factorialnhard.cpp: In member function 'BigUint& BigUint::add(const BigUint&)': factorialnhard.cpp:95:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if(nr.size() <= i) nr.push_back(0); ^ factorialnhard.cpp:96:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if(i<oth.size()) nr[i] += oth[i] + r; ^ factorialnhard.cpp: In member function 'BigUint& BigUint::substract(const BigUint&)': factorialnhard.cpp:115:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if(nr.size() <= i) nr.push_back(0); ^ factorialnhard.cpp:116:27: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if(i<oth.size()) nr[i] -= oth[i] + r; ^ factorialnhard.cpp: In member function 'BigUint BigUint::smallMultiply(const llong128&)': factorialnhard.cpp:134:29: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] if(nr.size() <= i) nr.push_back(0); ^ factorialnhard.cpp: In function 'BigUint multiply(const BigUint&, const BigUint&)': factorialnhard.cpp:149:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i=0; i<a.size(); ++i) ^ factorialnhard.cpp:150:35: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int j=0; j<b.size(); ++j) ^ factorialnhard.cpp:152:31: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i=1; i<c.size(); ++i) ^ factorialnhard.cpp: In member function 'void BigUint::fromString(std::string)': factorialnhard.cpp:5:22: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] #define BIG_BASE_EXP 8 ^ factorialnhard.cpp:166:33: note: in expansion of macro 'BIG_BASE_EXP' for(int i=0; i<s.size()/BIG_BASE_EXP; ++i) ^
Test | Timp | Mesaj evaluare | Scor posibil | Scor obținut | ||
---|---|---|---|---|---|---|
1 | 0 secunde | OK. | 10 | 10 | Exemplu | |
2 | 0 secunde | OK. | 20 | 20 | ||
3 | 0 secunde | OK. | 20 | 20 | ||
4 | 0 secunde | OK. | 20 | 20 | ||
5 | 0.008 secunde | OK. | 20 | 20 | ||
6 | 0 secunde | OK. | 10 | 10 | ||
Punctaj total | 100 |
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema FactorialnHard 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ă.