Cod sursa(job #947691)
| Utilizator | Data | 8 mai 2013 09:31:29 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include<stdio.h>
int n,k,v[20];
int valid(int a)
{
for(int o=1;o<a;o++)
if(v[o]>=v[a])
return 0;
return 1;
}
void afis()
{
for(int j=1;j<=k;j++)
printf("%d ",v[j]);
printf("\n");
}
void bk(int x)
{
for(int i=1;i<=n;i++)
{
v[x]=i;
if(valid(x))
if(x<k)
bk(x+1);
else
if(x==k)
afis();
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
bk(1);
return 0;
}
