Cod sursa(job #1841726)
Utilizator | Data | 5 ianuarie 2017 22:21:43 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<bits/stdc++.h>
using namespace std;
int n, k, rs[20], uz[100];
void back(int l, int u){
int i;
if (l==k) {
for(i=1; i<=n; i++) if(uz[i]) printf("%d ", i);
printf("\n");
} else for(i=u; i<=n;i++)
if(!uz[i]){
uz[i]=1;
back(l+1, i+1);
uz[i]=0;
}
}
int main(){
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%d%d", &n, &k);
back(0, 1);
return 0;
}