Pagini recente » Istoria paginii runda/4_ian_2014 | Cod sursa (job #2644218) | Cod sursa (job #668032) | Cod sursa (job #2882314) | Cod sursa (job #996445)
Cod sursa(job #996445)
#include <iostream>
#include <fstream>
#include <cstring>
#include <string>
#include <climits>
#include <algorithm>
#include <cmath>
using namespace std;
ifstream fin ("permutari.in" );
ofstream fout("permutari.out");
#define baza 1
#define MAX 2000004
#define MOD 9973
typedef long long int lli;
int a[17],n;
bool valid(int* s, int k)
{
for(int i=1;i<k;i++)
{
if(s[i]==s[k])
return false;
}
return true;
}
void back(int k)
{
if(k==n+1)
{
for(int i=1;i<=n;i++)
{
fout<<a[i]<<" ";
}
fout<<"\n";
}
else
{
for(int i=1;i<=n;i++)
{
a[k]=i;
if(valid(a, k))
{
back(k+1);
}
}
}
}
int main()
{
fin>>n;
back(1);
return 0;
}