Pagini recente » Cod sursa (job #3332661) | Cod sursa (job #1624391) | Cod sursa (job #2785730) | Cod sursa (job #1953416) | Cod sursa (job #2698711)
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int x[9], n;
void Afis()
{
for (int j = 1; j <= n; j++)
fout << x[j] << " ";
fout << endl;
}
bool OK(int k) {
for (int i = 1; i < k; ++i)
if (x[k] == x[i])
return false;
return true;
}
bool Solutie(int k)
{
return k == n;
}
void back(int k) {
for (int i = 1; i <= n; ++i)
{
x[k] = i;
if (OK(k))
if (Solutie(k))
Afis();
else
back(k + 1);
}
}
int main() {
fin >> n;
back(1);
return 0;
}