Pagini recente » Cod sursa (job #1972033) | Cod sursa (job #1140946) | Cod sursa (job #1963650) | Cod sursa (job #2354556) | Cod sursa (job #1337863)
#include<iostream>
#include<fstream>
using namespace std;
int st[100],n,i;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
void afisare(int p)
{
for(i=1;i<=p;++i)
fout<<st[i]<<" ";
fout<<endl;
}
int valid(int p)
{
for(i=1;i<p;++i)
if(st[i]==st[p]) return 0;
return 1;
}
void back(int p)
{
int pval;
for(pval=1;pval<=n;++pval)
{
st[p]=pval;
if(valid(p))
if(p==n) afisare(p);
else back(p+1);
}
}
int main()
{
fin>>n;
back(1);
return 0;
}