Pagini recente » Cod sursa (job #2518345) | Cod sursa (job #359752) | Cod sursa (job #2105545) | Cod sursa (job #3230325) | Cod sursa (job #654898)
Cod sursa(job #654898)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int n,st[10];
int afisare()
{int i;
for(i=1;i<=n;i++)
out<<st[i]<<" ";
out<<"\n";
}
bool valid(int p)
{int i;
for(i=1;i<p;i++)
if(st[i]==st[p])
return 0;
return 1;
}
void back(int p)
{
if(p-1 == n)
{afisare();
return ;
}
for(int i=1;i<=n;i++)
{
st[p]=i;
if(valid(p))
back(p+1);
}
}
int main()
{
in>>n;
back(1);
return 0;
}