#123
Se citeşte un număr natural nenul n. Să se afişeze, în ordine lexicografică, permutările mulţimii {1,2,..,n}.
| Problema | Permutari | Operații I/O |
permutari.in/permutari.out
|
|---|---|---|---|
| Limita timp | 0.5 secunde | Limita memorie |
Total: 64 MB
/
Stivă 8 MB
|
| Id soluție | #62979430 | Utilizator | |
| Fișier | permutari.cpp | Dimensiune | 662 B |
| Data încărcării | 09 Februarie 2026, 14:18 | Scor/rezultat | Eroare de compilare |
permutari.cpp:6:1: error: expected ',' or ';' before 'int' int st[11], n, k; ^ permutari.cpp: In function 'void init()': permutari.cpp:7:13: error: 'st' was not declared in this scope void init(){st[k]=0;} ^ permutari.cpp:7:16: error: 'k' was not declared in this scope void init(){st[k]=0;} ^ permutari.cpp: In function 'int amsuccesor()': permutari.cpp:9:4: error: 'st' was not declared in this scope if(st[k]<n) ^ permutari.cpp:9:7: error: 'k' was not declared in this scope if(st[k]<n) ^ permutari.cpp:9:10: error: 'n' was not declared in this scope if(st[k]<n) ^ permutari.cpp: In function 'int evalid()': permutari.cpp:18:16: error: 'k' was not declared in this scope for(i = 1; i < k; i++) ^ permutari.cpp:19:8: error: 'st' was not declared in this scope if(st[k]==st[i]) return 0; ^ permutari.cpp: In function 'int eval()': permutari.cpp:22:19: error: 'k' was not declared in this scope int eval(){return k==n;} ^ permutari.cpp:22:22: error: 'n' was not declared in this scope int eval(){return k==n;} ^ permutari.cpp: In function 'void tipar()': permutari.cpp:24:15: error: 'n' was not declared in this scope for(i = 1; i<=n;i++) cout<<st[i]<<' '; ^ permutari.cpp:24:28: error: 'st' was not declared in this scope for(i = 1; i<=n;i++) cout<<st[i]<<' '; ^ permutari.cpp: In function 'void run()': permutari.cpp:28:9: error: 'k' was not declared in this scope int as; k=1;init(); ^ permutari.cpp: In function 'int main()': permutari.cpp:38:10: error: 'n' was not declared in this scope cin>>n;run();return 0; ^ permutari.cpp: In function 'int eval()': permutari.cpp:22:24: warning: control reaches end of non-void function [-Wreturn-type] int eval(){return k==n;} ^
www.pbinfo.ro permite evaluarea a două tipuri de probleme:
Problema Permutari 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ă.