Pagini recente » Cod sursa (job #1877040) | Cod sursa (job #2751918) | Cod sursa (job #2022831) | Cod sursa (job #2045105) | Cod sursa (job #1202789)
#include <fstream>
using namespace std;
ifstream is("permutari.in");
ofstream os("permutari.out");
int n, x[9];
bool ok[9];
void SOLVE(int k);
void WRITE();
int main()
{
is >> n;
SOLVE(1);
is.close();
os.close();
return 0;
}
void SOLVE(int k)
{
if ( k > n )
{
WRITE();
return;
}
for ( int i = 1; i <= n; ++i )
{
if ( ok[i] )
continue;
x[k] = i;
ok[i] = true;
SOLVE(k + 1);
ok[i] = false;
}
}
void WRITE()
{
for ( int i = 1; i <= n; ++i )
os << x[i] << " ";
os << "\n";
}