Pagini recente » Cod sursa (job #1450808) | Cod sursa (job #3148522) | Cod sursa (job #499213) | Cod sursa (job #1902726) | Cod sursa (job #523295)
Cod sursa(job #523295)
#include<iostream>
#include<fstream>
using namespace std;
ifstream f ("permutari.in");
ofstream g ("permutari.out");
int x[100], n;
void afisare (int k)
{
for (int i=1; i<=k; ++i)
g << x[i] << " ";
g << "\n";
}
int valid (int k)
{
for (int i=1; i<k; ++i)
for (int j=i+1; j<=k; ++j)
if (x[i]==x[j])
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 (k);
else back (k+1);
}
}
int main ()
{
f >> n;
back(1);
return 0;
}