Mai intai trebuie sa te autentifici.
Cod sursa(job #1007143)
| Utilizator | Data | 8 octombrie 2013 13:12:51 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 80 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.74 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define MAXN 10
ifstream f("permutari.in");
ofstream g("permutari.out");
int a[MAXN], n;
void print()
{
for (int i = 1; i <= n; i++) {
g << a[i] << ' ';
}
g << endl;
}
bool check(int el, int n) {
for (int i = 1; i <= n; i++) {
if (a[i] == el) {
return false;
}
}
return true;
}
void back(int i = 1)
{
for (int j = 1; j <= n; j++) {
a[i] = j;
if (check(j, i - 1) == true) {
if (i < n) {
back(i + 1);
} else {
print();
}
}
}
}
int main()
{
f >> n;
back();
return 0;
}
