Cod sursa(job #714526)
| Utilizator | Data | 15 martie 2012 20:14:55 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream in("permutari.in");
ofstream out("permutari.out");
int n,j,st[19];
void tipar (int k)
{
for(int i=1;i<=k;i++)
out<<st[i]<<" ";
out<<"\n";
}
int valid(int k)
{
for(int i=1;i<k;i++)
if(st[k]==st[i])
return 0;
return 1;
}
void back(int k)
{
for(int i=1;i<=n;i++)
{
st[k]=i;
if(valid(k))
if(k==n)
tipar(k);
else
back(k+1);
}
}
int main ()
{
in>>n;
back(1);
in.close();
out.close();
}
