Pagini recente » Cod sursa (job #474055) | Cod sursa (job #2395649) | Cod sursa (job #1631452) | Cod sursa (job #2655494) | Cod sursa (job #2153185)
#include <fstream>
#define N 8
using namespace std;
ifstream fin ("permutari.in");
ofstream fout ("permutari.out");
int n, v[N];
bool check ( int k )
{
for ( int j = 1; j < k; ++j )
if ( v[j] == v[k] )
return 0;
return 1;
}
void print ();
void bt ( int k )
{
for ( int i = 1; i <= n; ++i )
{
v[k] = i;
if ( check (k) )
if ( k == n )
print();
else
bt ( k + 1 );
}
}
int main()
{
fin >> n;
bt (1);
}
void print ()
{
for ( int i = 1; i <= n; ++i )
fout << v[i] << " ";
fout << '\n';
}