Cod sursa(job #881644)
| Utilizator | Data | 18 februarie 2013 13:26:51 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <cstdio>
using namespace std;
int n,k;
int sol[20];
int viz[20];
void afisare(){
for(int i=0;i<k;++i)
printf("%d ",sol[i]);
printf("\n");
}
void back(int x){
if(x==k){
afisare();
return;
}
for(int i=x+1;i<=n;++i)
if(viz[i]==0 && sol[x-1]<i){
viz[i]=1;
sol[x]=i;
back(x+1);
viz[i]=0;
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
back(0);
return 0;
}
