Cod sursa(job #238526)
Utilizator | Data | 2 ianuarie 2009 14:37:21 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.96 kb |
#include<stdio.h>
int n,a[19],ex[19],m;
void back(int i)
{int k,x;
//printf("111 %d \n",n);
for(k=1;k<=n;k++)
{a[i]=k;
if(ex[k]==0)
if(k>a[i-1])
{
ex[k]=1;
if(i==m)
{
for(x=1;x<=m;x++)
printf("%d ",a[x]);
printf("\n");
ex[k]=0;
}
else
{back(i+1);
ex[k]=0;
}
}
}
}
int main ()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
back(1);
return 0;
}