Pagini recente » Cod sursa (job #2190940) | Monitorul de evaluare | Istoria paginii runda/winners31 | Istoria paginii runda/winners10 | Cod sursa (job #156744)
Cod sursa(job #156744)
#include<cstdio>
using namespace std;
int n,K,st[50];
void back(int k)
{
int i;
if(k==K+1){
for(i=1;i<=K;i++)
printf("%d ",st[i]);
printf("\n");
return;}
i=st[k-1]+1;
while(i<=n-(K-k)){
st[k]=i;
back(k+1);
i++;}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&K);
back(1);
fclose(stdout);
}