Pagini recente » Cod sursa (job #483702) | Cod sursa (job #609188) | Cod sursa (job #527811) | Cod sursa (job #1009285) | Cod sursa (job #2530911)
#include <fstream>
using namespace std;
ifstream f ("permutari.in");
ofstream g ("permutari.out");
int n, sol[9];
bool ok (int pozitie)
{
int i;
for (i=1; i<pozitie; i++)
if (sol[i] == sol[pozitie])
return false;
return true;
}
void afisare ()
{
int i;
for (i=1; i<=n; i++)
g << sol[i] << " ";
g << '\n';
}
void bkt (int k)
{
for (int i=1; i<=n; i++)
{
sol[k] = i;
if (ok(k))
{
if (k == n)
afisare();
else
bkt(k+1);
}
}
}
int main()
{
f >> n;
bkt(1);
return 0;
}