Cod sursa(job #1473931)
| Utilizator | Data | 20 august 2015 15:14:10 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.61 kb |
// (・⊝・)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
long long int v[20],u[20];
int n;
inline void bk(int k)
{
int i;
if(k==n+1)
{
for(i=1; i<=n; i++)
out<<v[i]<<" ";
out<<'\n';
}
else for(i=1; i<=n; i++)
{
if(u[i]==0)
{
u[i]=u[i]^1;
v[k]=i;
bk(k+1);
u[i]=u[i]^1;
}
}
}
int main()
{
in>>n;
bk(1);
return 0;
}
