Pagini recente » Cod sursa (job #1725388) | Cod sursa (job #1830139) | Cod sursa (job #819465) | Cod sursa (job #2396535) | Cod sursa (job #3141729)
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int sol[40321];
bool ok[9];
int n;
void afisare()
{
for(int i = 1; i <= n; i++)
g << sol[i] << ' ';
g << '\n';
}
bool valid(int k)
{
for(int i = 1; i < k; i++)
if(sol[i] == sol[k])
return 0;
return 1;
}
void backt(int k)
{
for(int i = 1; i <= n; i++)
{
sol[k] = i;
if(valid(k))
{
if(k == n)
afisare();
else
backt(k + 1);
}
}
}
int main()
{
f >> n;
backt(1);
return 0;
}