Cod sursa(job #2242189)
Utilizator | Din Iulian Andrulian | Data | 17 septembrie 2018 23:48:14 |
---|---|---|---|
Problema | Generare de permutari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.56 kb |
#include <bits/stdc++.h>
using namespace std;
int a[10],x[10],n,i,k,nr;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
void backt();
void solutie();
int valid(int k);
int main()
{
fin>>n;
backt();
return 0;
}
int valid(int k)
{
for(i=1; i<=k-1; i++)
if(x[k]==x[i])return 0;
return 1;
}
void solutie()
{
//cout<<++nr<<") ";
for(i=1; i<=n; i++)
fout<<x[i]<<" ";
fout<<"\n";
}
void backt()
{
for(i=1; i<=n; i++)
{
x[k]=i;
if(valid(k))
}
}