Pagini recente » Cod sursa (job #2668017) | Cod sursa (job #1636926) | Cod sursa (job #1140672) | Cod sursa (job #1559415) | Cod sursa (job #1267625)
#include<fstream>
using namespace std;
#define nmax 8
int v[nmax + 1];
bool used[nmax + 1];
int n;
void print(ofstream& out)
{
for(int i = 0;i < n;++i)
{
out<<v[i]<<" ";
}
out<<"\n";
}
void gen(int k, ofstream& out)
{
if(k == n)
{
print(out);
return;
}
for(int i = 1;i <= n;++i)
{
if(!used[i - 1])
{
used[i - 1] = true;
v[k] = i;
gen(k + 1, out);
used[i - 1] = false;
}
}
}
int main()
{
ifstream in("permutari.in");
ofstream out("permutari.out");
in >> n;
gen(0, out);
in.close();
out.close();
return 0;
}