Cod sursa(job #1553069)
| Utilizator | Data | 19 decembrie 2015 10:43:49 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int a[10],sol[108],n,k;
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<<sol[i]<<" ";
g<<'\n';
}
void backt(int k)
{
int i;
if (k>n) afis();
else
for(i=1; i<=n; ++i)
{
sol[k]=i;
if(ok(k)) backt(k+1);
}
}
int main()
{
f>>n;
int i=0;
while(i<=n)
{
a[++i]=i;
}
backt(1);
return 0;
}
