Pagini recente » Cod sursa (job #2857354) | Solutia problemei shoturi | Cod sursa (job #350016) | Cod sursa (job #876636) | Cod sursa (job #1845566)
#include <vector>
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("permutari.in");
ofstream cout("permutari.out");
vector <int> a;
void bk(int k)
{
if (k==a.size())
{
for (int i=0; i<a.size(); i++)
cout << a[i]+1 << ' ';
cout << '\n';
return;
}
for (a[k]=0; a[k]<a.size(); a[k]++)
if (count(a.begin(),a.begin()+k+1,a[k])==1) bk(k+1);
}
main()
{
int n;
cin >> n;
a.resize(n);
bk(0);
}