Pagini recente » Cod sursa (job #2746312) | Cod sursa (job #1454284) | Borderou de evaluare (job #1036125) | Cod sursa (job #2745642) | Cod sursa (job #1416560)
#include <fstream>
#define MAX 9
using namespace std;
int P[MAX], n;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
void Afiseaza()
{
for(int i = 1; i <= n; i++)
fout << P[i] << " ";
fout << '\n';
}
void permutari(int k){
int ok;
if(k == n+1)
Afiseaza();
else
{
for(int i = 1;i <= n; i++)
{
ok = 1;
for(int j = 1; j < k; j++)
{
if(P[j] == i) ok = 0;
}
if(ok)
{
P[k] = i;
permutari(k+1);
}
}
}
}
int main()
{
fin >> n;
permutari(1);
return 0;
}