Cod sursa(job #1983118)
| Utilizator | Data | 21 mai 2017 12:35:13 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int sum[100],n;
int valid(int x)
{
for(int i=1;i<x;i++)
if(sum[i]==sum[x])
return 0;
return 1;
}
void back(int lvl)
{
for(int i=1;i<=n;i++)
{
sum[lvl]=i;
if(valid(lvl))
{
if(lvl==n)
{
for(int j=1;j<=lvl;j++)
fout<<sum[j]<<" ";
fout<<"\n";
}
else
back(lvl+1);
}
}
}
int main()
{
fin>>n;
back(1);
return 0;
}
