Cod sursa(job #502882)
| Utilizator | Data | 20 noiembrie 2010 17:39:22 | |
|---|---|---|---|
| Problema | Generare de permutari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.65 kb |
#include<fstream>
#define maxn 10
using namespace std;
int s[maxn], n;
ofstream g("permutari.out");
void back(int k) {
for (int i = 1; i <= n; i++) {
s[k] = i;
int j;
for (j = 1; j <= k-1; j++)
if (s[j] == s[k])
break;
if (j == k) {
if (k == n) {
for (int j = 1; j <= n; j++)
g << s[j] << " ";
g << '\n';
}
else
back(k+1);
}
}
}
int main() {
ifstream f("permutari.in");
f >> n;
back(1);
return 0;
}
