Pagini recente » Cod sursa (job #2715430) | Cod sursa (job #2585554) | Cod sursa (job #957104) | Cod sursa (job #1327570) | Cod sursa (job #2329433)
#include <fstream>
#define in "permutari.in"
#define out "permutari.out"
#define len 9
using namespace std;
ifstream f(in);
ofstream g(out);
short n, sol[len];
bool ebun(short k)
{
for(short i = 1; i < k; ++i)
if(sol[i] == sol[k])
return false;
return true;
}
void Tipar()
{
for(short i = 1; i <= n; ++i)
g << sol[i] << ' ';
g << '\n';
}
void back(short k)
{
for(short i = 1; i <= n; ++i)
{
sol[k] = i;
if(ebun(k))
if(k == n)
Tipar();
else back(k + 1);
}
}
int main()
{
f >> n;
back(1);
return 0;
}