Cod sursa(job #526945)
Utilizator | Data | 29 ianuarie 2011 23:36:08 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<cstdio>
using namespace std;
int n, lev;
int st[19];
int isUsed[19];
void afisPerm() {
for (int i = 0; i < lev; i++){
printf("%d ",st[i]);
}
printf("\n");
}
void genPerm(int k) {
if (k == lev) afisPerm();
else for (int i = st[k-1]+1; i <= n; i++){
if (!isUsed[i]) {
st[k] = i;
isUsed[i] = 1;
genPerm(k+1);
isUsed[i] = 0;
}
}
}
int main() {
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d %d", &n, &lev);
genPerm(0);
return 0;
}