Cod sursa(job #1026758)
Utilizator | Data | 11 noiembrie 2013 22:37:24 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include<cstdio>
using namespace std;
int n,k,v[20];
void bkt(int x){
if(x==k){
for(int i=1;i<=k;++i)printf("%d ",v[i]);
printf("\n");
return;
}
for(int i=v[x]+1;i<=n;++i){
v[x+1]=i;
bkt(x+1);
}
}
int main(){
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
bkt(0);
return 0;
}