#3331
Într-o clasă sunt n elevi. În fiecare zi elevii sunt așezați în bănci în alt mod. Câte modalități de așezare a elevilor în bănci există?
| Problema | NumarPermutari | Operații I/O |
tastatură/ecran
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #64641328 | Utilizator | |
| Fișier | numarpermutari.cpp | Dimensiune | 3.54 KB |
| Data încărcării | 20 Mai 2026, 01:18 | Scor/rezultat | 10 puncte |
numarpermutari.cpp: In function ‘long long unsigned int putere(int, int)’: numarpermutari.cpp:58:12: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long long unsigned int’ [-Wsign-compare] 58 | while (b > produs) { | ~~^~~~~~~~ numarpermutari.cpp:64:16: warning: comparison of integer expressions of different signedness: ‘long long unsigned int’ and ‘int’ [-Wsign-compare] 64 | if (produs <= b) { | ~~~~~~~^~~~ numarpermutari.cpp: In function ‘int PB_ceva()’: numarpermutari.cpp:87:21: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare] 87 | for (int i = 0; i < strlen(n); i++) { | ~~^~~~~~~~~~~ numarpermutari.cpp:88:13: warning: array subscript has type ‘char’ [-Wchar-subscripts] 88 | freq[n[i]]++; | ~~~^ numarpermutari.cpp:91:14: warning: array subscript has type ‘char’ [-Wchar-subscripts] 91 | if (freq[i] > 1) { | ^ numarpermutari.cpp:92:22: warning: array subscript has type ‘char’ [-Wchar-subscripts] 92 | suma /= P(freq[i]); | ^ numarpermutari.cpp:84:7: warning: unused variable ‘k’ [-Wunused-variable] 84 | int k; | ^ numarpermutari.cpp: In function ‘int descompunere_factori_factoriale()’: numarpermutari.cpp:104:33: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long long unsigned int’ [-Wsign-compare] 104 | for (int i = max(b, c) + 1; i <= a; i++) { | ~~^~~~ numarpermutari.cpp:115:21: warning: comparison of integer expressions of different signedness: ‘int’ and ‘const long long unsigned int’ [-Wsign-compare] 115 | for (int i = 2; i <= min(b, c); i++) { | ~~^~~~~~~~~~~~ numarpermutari.cpp:128:1: warning: no return statement in function returning non-void [-Wreturn-type] 128 | } | ^ numarpermutari.cpp: In function ‘int ma2in()’: numarpermutari.cpp:138:33: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long long unsigned int’ [-Wsign-compare] 138 | for (int i = max(b, c) + 1; i <= a; i++) { | ~~^~~~ numarpermutari.cpp:145:21: warning: comparison of integer expressions of different signedness: ‘int’ and ‘const long long unsigned int’ [-Wsign-compare] 145 | for (int i = 2; i <= min(b, c); i++) { | ~~^~~~~~~~~~~~ numarpermutari.cpp:135:27: warning: unused variable ‘cntc’ [-Wunused-variable] 135 | int cnta = 0, cntb = 0, cntc = 0; | ^~~~ numarpermutari.cpp:158:1: warning: no return statement in function returning non-void [-Wreturn-type] 158 | } | ^ numarpermutari.cpp: In function ‘int prob4812()’: numarpermutari.cpp:201:1: warning: control reaches end of non-void function [-Wreturn-type] 201 | } | ^
| Test | Timp | Mesaj evaluare | Scor posibil | Scor obținut | ||
|---|---|---|---|---|---|---|
| 1 | 0.003 secunde | OK. | 10 | 10 | Exemplu | |
| 2 | 0.001 secunde | Raspuns gresit. | 20 | 0 | ||
| 3 | 0.001 secunde | Raspuns gresit. | 20 | 0 | ||
| 4 | 0.001 secunde | Raspuns gresit. | 20 | 0 | ||
| 5 | 0.001 secunde | Raspuns gresit. | 20 | 0 | ||
| 6 | 0.001 secunde | Raspuns gresit. | 10 | 0 | Exemplu | |
| Punctaj total | 10 | |||||
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema NumarPermutari 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ă.