Pagini recente » Cod sursa (job #938988) | Cod sursa (job #1491227) | Cod sursa (job #2395973) | Cod sursa (job #2905753) | Cod sursa (job #560257)
Cod sursa(job #560257)
#include <fstream>
using namespace std;
#define maxN 10
ofstream g("permutari.out");
int N, x[maxN];
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[i] == x[k] )
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()
{
ifstream f("permutari.in");
f >> N;
back (1);
f.close();
return 0;
}