Cod sursa(job #1416557)
| Utilizator | Data | 8 aprilie 2015 14:07:31 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
#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){
if(k == n+1)
Afiseaza();
else
{
for(int i = 1, ok = 1; i <= n; i++)
{
if(P[k-1] == i) ok = 0;
if(ok)
{
P[k] = i;
permutari(k+1);
}
}
}
}
int main()
{
fin >> n;
permutari(1);
return 0;
}
