Cod sursa(job #1892924)
Utilizator | Stefan Ionescu StefanIonescu | Data | 25 februarie 2017 13:18:03 |
---|---|---|---|
Problema | Generare de permutari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.59 kb |
#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
using namespace std;
bool sol[10];
int st[10];
unsigned long long int nr1,nr,n,m;
ifstream in("permutari.in");
ofstream out("permutari.out");
void afis()
{
for(int i=1;i<=n;i++)
cout<<st[i]<<" ";
cout<<'\n';
}
void backt(int k)
{
if(k==n+1)
afis();
else
for(st[k]=1;st[k]<=n;st[k]++)
if(sol[st[k]]==0)
{
sol[st[k]]=1;
backt(k+1);
sol[st[k]]=0;
}
}
int main()
{
cin>>n;
backt(1);
}