Cod sursa(job #1384709)
Utilizator | Data | 11 martie 2015 12:44:10 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n, uz[100], s, a[100];
void wr()
{
for(int i=1;i<=n;i++)
g<<a[i]<<' ';
g<<'\n';
}
void PM(int k)
{
if(k==n)
wr();
for(int i=1;i<=n;i++)
{
if (!uz[i])
{
uz[i]=1; a[k+1]=i; PM(k+1); uz[i]=0;
}
}
}
int main()
{
f>>n;
PM(0);
return 0;
}