Cod sursa(job #759163)
Utilizator | Data | 16 iunie 2012 23:06:55 | |
---|---|---|---|
Problema | Combinari | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <cstdio>
int x[20];
int main(){
int n,k,t;
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
for(int i=1;i<=(1<<n);i++)
{
t=0;
for(int j=0;j<n;j++)
if(i&(1<<j))x[++t]=j;
if(t==k)
{
for(int j=1;j<=k;j++)printf("%d ",x[j]+1);
printf("\n");
}
}
return 0;
}