Pagini recente » Cod sursa (job #1861107) | Cod sursa (job #3270890) | Cod sursa (job #1343410) | Cod sursa (job #3175432) | Cod sursa (job #282103)
Cod sursa(job #282103)
#include<stdio.h>
int st[30],top,n,k,viz[30];
void PrintSol()
{
int j;
for (j=1;j<=k;j++)
printf("%d ",st[j]);
printf("\n");
}
void Back(int top)
{
int i;
if (top == k+1) PrintSol();
else
for (i=st[top-1]+1;i<=n;i++)
if (!viz[i])
{
st[top] = i;
viz[i] = 1;
Back(top+1);
viz[i] = 0;
}
}
int main()
{
freopen("combinari.in","r",stdin) ;
freopen("combinari.out","w",stdout) ;
scanf("%d %d", &n, &k) ;
Back(1);
return 0;
}