Pagini recente » Cod sursa (job #3178802) | Cod sursa (job #1907961) | Cod sursa (job #788436) | Cod sursa (job #2287570) | Cod sursa (job #2742875)
#include <iostream>
#include <fstream>
#include <iomanip>
#include <cmath>
#include <algorithm>
#include <cstring>
using namespace std;
string NumeFisier = "permutari";
ifstream fin(NumeFisier + ".in");
ofstream fout(NumeFisier + ".out");
typedef unsigned long long int ull;
int n,sol[10];
void print()
{
for (int i = 1; i <= n; i++)
fout << sol[i] << " ";
fout << '\n';
}
bool check(int k)
{
for (int i = 1; i < k; i++)
if (sol[i] == sol[k])
return 0;
return 1;
}
void back(int k)
{
if (k == n + 1)
print();
else
for (int i = 1; i <= n; i++)
{
sol[k] = i;
if (check(k))
back(k + 1);
}
}
int main()
{
fin >> n;
back(1);
}