Cod sursa(job #2370010)
Utilizator | Tiberiu Ungurianu tiberiu392 | Data | 6 martie 2019 10:16:23 |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n, k, i, s[10], uz[10];
void afisare(int n)
{
for ( int i = 1 ; i <= n ; i ++ )
g << s[i]<<" " ;
g << '\n' ;
}
void bkt(int k)
{
if( k == n + 1)
afisare(n);
else
{
for( int i = 1 ; i <= n ; i ++ )
if ( uz[i] == 0)
{
s[k]=i;
uz[i]=1;
bkt(k+1);
uz[i]=0;
}
}
}
int main()
{
f >> n;
bkt(1);
return 0;
}