Pagini recente » Cod sursa (job #567904) | Cod sursa (job #3135136) | Cod sursa (job #1166228) | Cod sursa (job #869383) | Cod sursa (job #305169)
Cod sursa(job #305169)
#include <stdio.h>
int n,c[20],p;
int ok(int k)
{for (int i=1;i<k;i++)
if (c[i]>=c[k])
return 0;
return 1;}
void scrie()
{for(int i=1;i<=p;i++)
printf("%d ",c[i]);
printf("\n");}
void back(int k)
{if (k==p+1) scrie();
else
for(int i=1;i<=n;i++)
{c[k]=i;
if(ok(k)) back(k+1);}
}
int main()
{freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&p);
back(1);
return 0;
}