Cod sursa(job #2206411)
Utilizator | Data | 22 mai 2018 17:25:35 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
int v[10];
int n;
ifstream f("permutari.in");
ofstream g("permutari.out");
bool ok(int k)
{
for(int i=1; i<k; i++)
{
if(v[k]==v[i])
return 0;
}
return 1;
}
void back(int k)
{
if(k<=n)
{
for(int i=1; i<=n; i++)
{v[k]=i;
if(ok(k))
back(k+1);}
}
else
{for(int i=1; i<=n; i++)
g<<v[i]<<" ";
g<<endl;}
}
int main()
{
f>>n;
back(1);
return 0;
}