Pagini recente » Cod sursa (job #1754362) | Cod sursa (job #625397) | Cod sursa (job #1575989) | Istoria paginii runda/icrisop/clasament | Cod sursa (job #936805)
Cod sursa(job #936805)
#include <fstream>
#include <cstdlib>
using namespace std;
const int NMAX = 20;
int N;
int v[NMAX];
bool was[NMAX];
ofstream out("permutari.out");
inline void back(int k)
{
if(N == k - 1)
{
for(int i = 1; i <= N; ++i) out << v[i] << ' ';
out << '\n';
return;
}
for(int i = 1; i <= N; ++i)
if(!was[i])
{
v[k] = i;
was[i] = true;
back(k + 1);
was[i] = false;
}
}
int main()
{
ifstream in("permutari.in");
in >> N;
back(1);
return EXIT_SUCCESS;
}