Cod sursa(job #1135071)
| Utilizator | Data | 7 martie 2014 11:56:30 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
using namespace std;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
int i, k, n, st[100];
void tip()
{
int i;
for(i=1;i<=n;i++)
{
fout<<st[i]<<" ";
}
fout<<"\n";
}
int valid(int k)
{
for(i=1;i<k;i++)
{
if(st[i]==st[k]) return 0;
}
return 1;
}
void back(int k)
{
int i;
for(i=1;i<=n;i++)
{
st[k]=i;
if(valid(k))
{
if(k==n)
{
tip();
}
else back(k+1);
}
}
}
int main()
{
fin>>n;
back(1);
return 0;
}
