Pagini recente » Cod sursa (job #48632) | Cod sursa (job #1353391) | Cod sursa (job #152275) | Cod sursa (job #1054914) | Cod sursa (job #171736)
Cod sursa(job #171736)
#include <stdio.h>
int n,k,sol[18];
void back(int j)
{
int i;
if (j==k)
{
for (i=0;i<k;i++)
printf("%d ",sol[i]);
printf("\n");
}
else
for (i=sol[j-1]+1;i<=n+j-k+1;i++)
{
sol[j]=i;
back(j+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
int i;
for (i=1;i<=n-k+1;i++)
{
sol[0]=i;
back(1);
}
return 0;
}