Cod sursa(job #2398773)
Utilizator | Data | 6 aprilie 2019 09:08:35 | |
---|---|---|---|
Problema | Generare de permutari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n,sol[100];
void afis_de_campanie()
{
int i;
for(i=1;i<=n;++i)g<<sol[i]<<" ";
g<<'\n';
}
bool okie(int k)
{
int i;
for(i=1;i<k;++i)if(sol[k]==sol[i])return false;
return true;
}
void bec(int k)
{
int i;
if(k>n)afis_de_campanie();
else
for(i=1;i<=n;++i)
{
sol[k]=i;
if(okie(k))bec(k+1);
}
}
int main()
{
f>>n;
bec(1);
return 0;
}