Pagini recente » Cod sursa (job #2808942) | Cod sursa (job #2838151) | Cod sursa (job #1486436) | Cod sursa (job #195713) | Cod sursa (job #695539)
Cod sursa(job #695539)
#include<stdio.h>
int a,b,i,j,n,k,d[100];
void rezolva(int j,int k,int in)
{
int i;
if(k==0)
{for(i=1;i<=in;i++)
printf("%d ",d[i]);
printf("\n");
}
else
for(i=j+1;i<=n-k+1;i++)
{
d[++in]=i;
rezolva(i,k-1,in);
in--;
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d",&n,&k);
rezolva(0,k,0);
return 0;}