Pagini recente » Cod sursa (job #412658) | Cod sursa (job #697001) | Cod sursa (job #2449000) | Cod sursa (job #2559994) | Cod sursa (job #1000682)
#include <iostream>
#include <fstream>
using namespace std;
void back(int k);
int n;
int x[20];
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int main()
{
fin >> n;
back(0);
return 0;
}
bool cond(int k){
bool alreadyThere=true;
for(int i=0;i<k;i++){
if(x[i] == x[k])
alreadyThere=false;
}
return alreadyThere;
}
void back(int k)
{
if(k==n)
{
for(int i=0; i<n; i++)
{
fout << x[i] << " ";
}
fout << '\n';
}
else
{
for(int i=1; i<=n; i++)
{
x[k]=i;
if(cond(k))
back(k+1);
}
}
}