Pagini recente » Cod sursa (job #2446687) | Monitorul de evaluare | Cod sursa (job #831289) | Istoria paginii utilizator/boggy2411 | Cod sursa (job #585091)
Cod sursa(job #585091)
#include <stdio.h>
int n,st[20],i,v[20],k1;
int back(int k)
{
k++;
if (k==k1+1)
{
for (i=1;i<=k1;i++)
{
printf("%d ",st[i]);
}
printf("\n");
return 0;
}
for (st[k]=st[k-1]+1;st[k]<=n;st[k]++)
{
if (v[st[k]]) continue;
v[st[k]]=1;
back(k);
v[st[k]]=0;
}
return 0;
}
int main(void)
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k1);
back(0);
return 0;
}