Pagini recente » Cod sursa (job #2103184) | Cod sursa (job #364550) | Istoria paginii utilizator/mihaiprodann | Cod sursa (job #895089) | Cod sursa (job #742731)
Cod sursa(job #742731)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int x[100],n;
void scrie()
{
int i;
for(i=1;i<=n;i++)
g<<x[i]<<" ";
g<<endl;
}
int valid(int k)
{
int i;
for(i=1;i<k;i++)
if(x[i]==x[k]) return 0;
return 1;
}
void back(int k)
{
if(k==n+1) scrie();
else
for(x[k]=1;x[k]<=n;x[k]++)
if(valid(k)) back(k+1);
}
int main()
{
f>>n;
back(1);
return 0;
}