Pagini recente » Cod sursa (job #2142796) | Cod sursa (job #4125) | bruschete | Cod sursa (job #1110151) | Cod sursa (job #536351)
Cod sursa(job #536351)
#include <fstream>
#define MAXN 10
using namespace std;
int n, x[MAXN];
ifstream f("permutari.in");
ofstream g("permutari.out");
void afisare()
{
for(int i = 1; i <= n; ++i)
g << x[i] << " ";
g << '\n';
}
int valid(int k)
{
for(int i = 1; i < k; ++i)
if(x[k] == x[i])
return 0;
return 1;
}
void back(int k)
{
for(int i = 1; i <= n; ++i)
{
x[k] = i;
if(valid(k))
if(k == n)
afisare();
else
back(k + 1);
}
}
int main()
{
f >> n;
back(1);
f.close();
g.close();
return 0;
}