Pagini recente » Cod sursa (job #2630995) | Cod sursa (job #1561103) | Cod sursa (job #1579333) | Cod sursa (job #2664464) | Cod sursa (job #1626586)
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int a[9],sol[9],n;
void load(){f>>n;}
void dload(){for (int i=1;i<=n;i++) g<<sol[i]<<' '; g<<'\n';}
bool ok(int k){for (int i=1;i<=k-1;i++) if (sol[i]==sol[k]) return false; return true;}
void back(int k)
{
if (k>n) dload();
else
for (int i=1;i<=n;i++)
{
sol[k]=i;
if (ok(k)) back(k+1);
}
}
int main()
{
load(),back(1);
return 0;
}