Mai intai trebuie sa te autentifici.
Cod sursa(job #1012353)
| Utilizator | Data | 18 octombrie 2013 20:15:10 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <iostream>
#include <fstream>
#define maxn 9
using namespace std;
int n;
int a[maxn];
ifstream f("permutari.in");
ofstream g("permutari.out");
void scrie() {
int i;
for (i=1;i<=n;i++)
g << a[i] << " ";
g << endl;
}
bool valid(int i,int k){
for(int j=1;j<=k;j++)
if(a[j]==i)
return false;
return true;
}
void back(int k){
if (k==n)
scrie();
else {
for(int i=1;i<=n;i++)
if(valid(i,k)) {
a[k+1]=i;
back(k+1);
}
}
}
int main()
{
f >> n;
fill(a,a+n,0);
back(0);
return 0;
}
