Cod sursa(job #1010063)
| Utilizator | Data | 14 octombrie 2013 11:18:16 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.57 kb |
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int n,k,sol[10];
void afis()
{
int i;
for (i=1; i<=n; i++)
g<<sol[i];
g<<endl;
}
bool ok(int k)
{
int j;
for (j=1; j<=k-1; j++)
if (sol[j]==sol[k]) return false;
return true;
}
void back(int k)
{
int i;
if (k>n)
afis();
else
for (i=1; i<=n; i++)
{
sol[k]=i;
if (ok(k)) back(k+1);
}
}
int main()
{
f>>n;
back(1);
return 0;
}
