#3330
Se dau numerele naturale n și k. Calculați \( C_n^k \).
| Problema | CalculCombinari | Operații I/O |
tastatură/ecran
|
|---|---|---|---|
| Limita timp | 0.1 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #64641350 | Utilizator | |
| Fișier | calculcombinari.cpp | Dimensiune | 3.39 KB |
| Data încărcării | 20 Mai 2026, 01:34 | Scor/rezultat | Eroare de compilare |
calculcombinari.cpp: In function ‘long long unsigned int C(int, int)’: calculcombinari.cpp:46:74: error: expected ‘;’ before ‘}’ token 46 | unsigned long long C(int n, int k) { return A(n, k) / Permutari_cu_mod(k) } | ^ ~ | ; calculcombinari.cpp: In function ‘long long unsigned int putere(int, int)’: calculcombinari.cpp:76:12: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long long unsigned int’ [-Wsign-compare] 76 | while (b > produs) { | ~~^~~~~~~~ calculcombinari.cpp:82:16: warning: comparison of integer expressions of different signedness: ‘long long unsigned int’ and ‘int’ [-Wsign-compare] 82 | if (produs <= b) { | ~~~~~~~^~~~ calculcombinari.cpp: In function ‘int PB_ceva()’: calculcombinari.cpp:105:21: warning: comparison of integer expressions of different signedness: ‘int’ and ‘size_t’ {aka ‘long unsigned int’} [-Wsign-compare] 105 | for (int i = 0; i < strlen(n); i++) { | ~~^~~~~~~~~~~ calculcombinari.cpp:106:13: warning: array subscript has type ‘char’ [-Wchar-subscripts] 106 | freq[n[i]]++; | ~~~^ calculcombinari.cpp:109:14: warning: array subscript has type ‘char’ [-Wchar-subscripts] 109 | if (freq[i] > 1) { | ^ calculcombinari.cpp:110:37: warning: array subscript has type ‘char’ [-Wchar-subscripts] 110 | suma /= Permutari_cu_mod(freq[i]); | ^ calculcombinari.cpp:102:7: warning: unused variable ‘k’ [-Wunused-variable] 102 | int k; | ^ calculcombinari.cpp: In function ‘int descompunere_factori_factoriale()’: calculcombinari.cpp:122:33: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long long unsigned int’ [-Wsign-compare] 122 | for (int i = max(b, c) + 1; i <= a; i++) { | ~~^~~~ calculcombinari.cpp:133:21: warning: comparison of integer expressions of different signedness: ‘int’ and ‘const long long unsigned int’ [-Wsign-compare] 133 | for (int i = 2; i <= min(b, c); i++) { | ~~^~~~~~~~~~~~ calculcombinari.cpp:146:1: warning: no return statement in function returning non-void [-Wreturn-type] 146 | } | ^ calculcombinari.cpp: In function ‘int ma2in()’: calculcombinari.cpp:153:33: warning: comparison of integer expressions of different signedness: ‘int’ and ‘long long unsigned int’ [-Wsign-compare] 153 | for (int i = max(b, c) + 1; i <= a; i++) { | ~~^~~~ calculcombinari.cpp:160:21: warning: comparison of integer expressions of different signedness: ‘int’ and ‘const long long unsigned int’ [-Wsign-compare] 160 | for (int i = 2; i <= min(b, c); i++) { | ~~^~~~~~~~~~~~ calculcombinari.cpp:150:27: warning: unused variable ‘cntc’ [-Wunused-variable] 150 | int cnta = 0, cntb = 0, cntc = 0; | ^~~~ calculcombinari.cpp:173:1: warning: no return statement in function returning non-void [-Wreturn-type] 173 | } | ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema CalculCombinari 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ă.