Pagini recente » Cod sursa (job #45900) | Cod sursa (job #2058668) | Cod sursa (job #846583) | Cod sursa (job #1130368) | Cod sursa (job #339087)
Cod sursa(job #339087)
#include <stdio.h>
int ap[20], a[20];
int n,k;
void back(int lv)
{
int i;
if (lv==k+1){
for (i=1; i<=k; i++)
printf("%d ",a[i]);
printf("\n");
}
else
for (i=a[lv-1]+1; i<=n-k+lv; i++)
if (!ap[i]){
a[lv]=i;
ap[i]=1;
back(lv+1);
ap[i]=0;
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
back(1);
fclose(stdin); fclose(stdout);
return 0;
}