Cod sursa(job #160468)
Utilizator | Data | 15 martie 2008 21:50:23 | |
---|---|---|---|
Problema | Combinari | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include<stdio.h>
int st[30],uz[30];
int k,n;
void back(int x)
{ int ok;
if(k==x)
{ for(int i=0;i<k;i++) printf("%d ",st[i]);
printf("\n");
}
else
for(int i=st[k-1]+1;i<=n;i++)
if(!uz[i])
{ st[x]=i; uz[i]=1;
back(x+1);
uz[i]=0;
}
}
int main()
{ freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
back(0);
fclose(stdin);
fclose(stdout);
return 0;
}