Pagini recente » Cod sursa (job #610783) | Cod sursa (job #627215) | Cod sursa (job #629404) | Cod sursa (job #344700) | Cod sursa (job #154336)
Cod sursa(job #154336)
#include<stdio.h>
int n,k,x,s[30];
/*
int verif(int k)
{ for(int i=1;i<k;i++)
if(s[i]>=s[k]) return 0;
return 1;
} */
void afis()
{ int i;
for(i=1;i<=x;i++)
printf("%d ",s[i]);
printf("\n");
}
void back(int k)
{ if(k>x) afis();
else for(int i=s[k-1]+1;i<=n;i++)
{ s[k]=i;
back(k+1);
}
}
int main()
{ freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&x);
back(1);
return 0;
}