Pagini recente » Cod sursa (job #1362851) | Cod sursa (job #37599) | Cod sursa (job #1638741) | Cod sursa (job #2775575) | Cod sursa (job #486035)
Cod sursa(job #486035)
#include<stdio.h>
int n,sol[19],k;
void bkt(int);
void afisare();
void bkt(int p)
{
if (p==k+1)
{
afisare();
return;
}
for (int i=sol[p-1]+1;i<=n-k+p;i++)
{
sol[p]=i;
bkt(p+1);
}
}
void afisare()
{
for(int i=1;i<=k;i++)
printf("%d ",sol[i]);
printf("\n");
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
bkt(1);
return 0;
}