Cod sursa(job #274595)
Utilizator | Data | 9 martie 2009 21:12:28 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <stdio.h>
int n,p[20],uz[20],m;
void afis()
{
long i;
for (i=1;i<=m;++i)
printf("%d ",p[i]);
printf("\n");
}
void back(long k)
{
long i;
if (k==m+1)
afis();
else
for (i=p[k-1]+1;i<=n;++i)
if (!uz[i])
{
uz[i]=1;
p[k]=i;
back(k+1);
uz[i]=0;
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&m);
back(1);
return 0;
}