Pagini recente » Cod sursa (job #434739) | Cod sursa (job #1424165) | Cod sursa (job #3003457) | Cod sursa (job #2053281) | Cod sursa (job #1184078)
/*
Keep It Simple!
*/
#include<fstream>
#include<fstream>
using namespace std;
int v[20], N;
ifstream f("permutari.in");
ofstream g("permutari.out");
void PrintFile(int k)
{
for (int j = 1; j <= k; j++)
g << v[j] << " ";
g << "\n";
}
bool valid(int k)
{
for (int i = 1; i < k;i++)
if (v[i] == v[k])
return 0;
return 1;
}
void Back(int k)
{
for (int i = 1; i <= N; i++)
{
v[k] = i;
if (valid(k))
{
if (k == N)
PrintFile(k);
else if (k < N)
Back(k + 1);
}
}
}
int main()
{
f >> N;
Back(1);
f.close();
g.close();
return 0;
}