Pagini recente » Cod sursa (job #2011251) | Cod sursa (job #1462989) | Cod sursa (job #2186945) | Monitorul de evaluare | Cod sursa (job #174936)
Cod sursa(job #174936)
#include<stdio.h>
int sol[101],n,m;
int ok (int i,int k)
{
int j;
for (j=1; j<k; ++j)
if (sol[j]==i)
return 0;
return 1;
}
void back (int k,int m)
{
int i,j;
if (k==m+1)
{
for (j=1; j<=m; ++j)
printf ("%d ",sol[j]);
printf ("\n");
}
else
for (i=1; i<=n; ++i)
if (ok(i,k))
{
sol[k]=i;
back (k+1,m);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&m);
back (1,m);
return 0;
}