Pagini recente » Cod sursa (job #931152) | Cod sursa (job #2220806) | Cod sursa (job #1572953) | Cod sursa (job #1699488) | Cod sursa (job #1782029)
#include <iostream>
#include <fstream>
using namespace std;
double n;
int v[9],used[10];
ifstream f("permutari.in");
ofstream g("permutari.out");
void print()
{
for (int i = 1; i <= n; i++)
g << v[i]<<" ";
g << "\n";
}
void back(int k)
{
for (v[k] = 1; v[k] <= n; v[k]++)
if (!used[v[k]])
{
used[v[k]]=1;
if (k == n)
print();
else
back(k + 1);
used[v[k]]=0;
}
}
int main()
{
f >> n;
back(1);
f.close();
g.close();
return 0;
}