Cod sursa(job #2237529)
| Utilizator | Data | 2 septembrie 2018 10:35:05 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
const int N = 10;
int n,p[N];
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++)
{
bool gasit=false;
for(int j=1; j<poz; j++)
if(p[j]==i)
{
gasit=true;
break;
}
if(!gasit)
{
p[poz]=i;
bkt(poz+1);
}
}
}
