Pagini recente » Cod sursa (job #873739) | Cod sursa (job #582303) | Cod sursa (job #310828) | Cod sursa (job #1464679) | Cod sursa (job #1249521)
#include <cstdio>
using namespace std;
int v[9],n;
bool continuare(int k)
{
for (int i=1;i<=k-1;i++)
if (v[i]==v[k])
return 0;
return 1;
}
void genpermutari(int k)
{
if (k==n+1)
{
for (int i=1;i<=n;i++)
printf("%d ",v[i]);
printf("\n");
}
else
{
for (int i=1;i<=n;i++)
{
v[k]=i;
if (continuare(k))
{
genpermutari(k+1);
}
}
}
}
int main()
{
freopen("permutari.in","r",stdin);
freopen("permutari.out","w",stdout);
scanf("%d",&n);
genpermutari(1);
return 0;
}