Cod sursa(job #778514)
| Utilizator | Data | 14 august 2012 22:17:52 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
using namespace std;
ifstream f("permutari.in");
ofstream g("permutari.out");
int a[100],n;
void print(int i)
{
int j;
for(j=1;j<=i;j++)
g<<a[j]<<" ";
g<<'\n';
}
int valid(int i)
{
int j;
for(j=1;j<i;j++)
if(a[i]==a[j])
return 0;
return 1;
}
void back(int i)
{
int val;
for(val=1;val<=n;val++)
{
a[i]=val;
if(valid(i))
if(i==n) print(i);
else back(i+1);
}
}
int main(){
f>>n;
back(1);
f.close();g.close();
return 0;
}
