#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 | #34740814 | Utilizator | |
Fișier | factorialnhard.cpp | Dimensiune | 4.73 KB |
Data încărcării | 11 Februarie 2022, 16:27 | Scor / rezultat | 100 puncte |
factorialnhard.cpp:51:54: warning: friend declaration 'std::istream& operator>>(std::istream&, Polynomial<T>&)' declares a non-template function [-Wnon-template-friend] friend istream& operator >>(istream&, Polynomial&); ^ factorialnhard.cpp:51:54: note: (if this is not what you intended, make sure the function template has already been declared and add <> after the function name here) factorialnhard.cpp:52:60: warning: friend declaration 'std::ostream& operator<<(std::ostream&, const Polynomial<T>&)' declares a non-template function [-Wnon-template-friend] friend ostream& operator <<(ostream&, const Polynomial&); ^ factorialnhard.cpp: In member function 'HugeN HugeN::operator+(const HugeN&)': factorialnhard.cpp:101:56: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 0; i < min(other.v.size(), v.size()); i++) { ^ factorialnhard.cpp: In function 'HugeN operator*(HugeN, HugeN)': factorialnhard.cpp:130:42: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] while(sz < a.v.size() + b.v.size()) sz <<= 1; ^ factorialnhard.cpp:134:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 0; i < a.v.size(); i++) aa[i] = a.v[i]; ^ factorialnhard.cpp:135:37: warning: comparison between signed and unsigned integer expressions [-Wsign-compare] for(int i = 0; i < b.v.size(); i++) bb[i] = b.v[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.008 secunde | OK. | 20 | 20 | ||
4 | 0.024 secunde | OK. | 20 | 20 | ||
5 | 0.044 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ă.