Pagini recente » Cod sursa (job #1780374) | Cod sursa (job #2274303) | Cod sursa (job #2303255) | Cod sursa (job #2415206) | Cod sursa (job #653219)
Cod sursa(job #653219)
# include<stdio.h>
int i,n,m,k,sol[20];
void afis()
{
int i;
for (i=1; i<=m; i++)
printf("%d ",sol[i]);
printf("\n");
}
bool ok(int k)
{
int i;
for (i=1; i<k; i++)
{
if (sol[i]==sol[k]) return false;
if (sol[i]>sol[k]) return false;
}
return true;
}
void back(int k)
{
int i;
if (k>m) afis();
else
{
for (i=1; i<=n; i++)
{
sol[k]=i;
if (ok(k)) back(k+1);
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d %d\n",&n,&m);
back(1);
return 0;
}