Cod sursa(job #3132929)
Utilizator | Panaete Adrian proflaurian | Data | 24 mai 2023 14:28:21 |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
const int N = 10;
int n,k,s[N],viz[N];
void bkt(int);
int main()
{
f>>n>>k;
bkt(1);
return 0;
}
void bkt(int p)
{
/// conditia de oprire
if(p==n+1)
{
for(int i=1;i<=n;i++)
g<<s[i]<<' ';
g<<'\n';
return;
}
/// generez solutie partiala
for(int j=1;j<=n;j++)
if(!viz[j])
{
s[p]=j;
viz[j]=1;
bkt(p+1);/// avansez la pozitia urmatoare
viz[j]=0;
/// apoi revin la pozitia mea
}
}