Cod sursa(job #2955799)
Utilizator | Data | 17 decembrie 2022 20:20:16 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
#define MaxN 10
int v[MaxN];
int f[MaxN];
void perm(int pos, int n)
{
int i;
if(pos==n+1)
{
for(i=1; i<=n; i++)
out<<v[i]<<" ";
out<<'\n';
}
else
{
for(i=1; i<=n; i++)
{
if(f[i]==0)
{
v[pos]=i;
f[i]=1;
perm(pos+1, n);
f[i]=0;
}
}
}
}
int main()
{
int n;
in>>n;
perm(1, n);
return 0;
}