Cod sursa(job #2001359)
Utilizator | Data | 16 iulie 2017 15:03:26 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n,p[10],used[10];
void bkt(int);
int main()
{
f>>n;
bkt(1);
return 0;
}
void bkt(int poz)
{
if(poz==n+1)
{
for(int i=1; i<=n; i++)
g<<p[i]<<' ';
g<<'\n';
return;
}
for(int i=1; i<=n; i++)
if(!used[i])
{
p[poz]=i;
used[i]=1;
bkt(poz+1);
used[i]=0;
}
}