Pagini recente » Cod sursa (job #373727) | Cod sursa (job #1868690) | Cod sursa (job #699197) | Cod sursa (job #1890473) | Cod sursa (job #423787)
Cod sursa(job #423787)
#include<cstdio>
using namespace std;
int v[20],n,k;
void post()
{ for(int i=1;i<=k;i++)printf("%d ",v[i]);
printf("\n");
}
void bek(int p)
{ for(int i=v[p-1]+1;i<=n-k+p;i++) { v[p]=i;
if(p==k)post();
else bek(p+1);
}
}
int main()
{ freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
bek(1);
fclose(stdin);
fclose(stdout);
return 0;
}