Pagini recente » Cod sursa (job #30265) | Cod sursa (job #2885388) | Cod sursa (job #1216825) | Cod sursa (job #165726) | Cod sursa (job #1541785)
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n,v[9];
int verif(int k)
{
for(int i=1;i<k;++i)if(v[i]==v[k]) return 0;
return 1;
}
void afis()
{
for(int i=1;i<=n;++i) g<<v[i]<<" ";
g<<endl;
}
void backt()
{
int k=1;v[k]=0;
do
{while(v[k]<n)
{
v[k]++;
if(verif(k))
if(k==n) afis();
else {k++;v[k]=0;}
}
k--;
}while(k>0);
}
int main()
{
f>>n;
backt();
g.close();
return 0;
}