Cod sursa(job #1553081)
| Utilizator | Data | 19 decembrie 2015 11:09:10 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream f("perm.in");
ofstream g("perm.out");
int a[10000],sol[10000],i,n;
bool ok (int k)
{
int i;
for(i=1;i<=k-1;i++)
if(sol[k]==sol[i])
return false;
return true;
}
void afis(){
int i; for(i=1;i<=n;i++)
g<<a[sol[i]]<<" ";
g<<'\n';
}
void back(int k)
{
if(k>n)afis();
else for(int i=1;i<=n;i++)
{
sol[k]=i;
if(ok(k))back(k+1);
}
}
int main()
{
f>>n;
while(i<=n)
{
a[i]=i;
i++;}
back(1);
return 0;
}
