Pagini recente » Cod sursa (job #512093) | Cod sursa (job #1786986) | Cod sursa (job #1892793) | Cod sursa (job #2657619) | Cod sursa (job #875562)
Cod sursa(job #875562)
#include<cstdio>
using namespace std;
int x[2000],n;
void afiseaza()
{
for(int i=1;i<=n;i++)
printf("%d ",x[i]);
printf("\n");
}
bool bun(int a)
{
for(int i=1;i<a;i++)
if(x[i]==x[a])
return 0;
return 1;
}
void back(int i)
{
if(i>n)
{
afiseaza();return;
}
for(int j=1;j<=n;j++)
{
x[i]=j;
if(bun(i))
back(i+1);
}
}
int main()
{
freopen("permutari.in","r",stdin);freopen("permutari.out","w",stdout);
scanf("%d",&n);
back(1);
}