Pagini recente » Cod sursa (job #2629969) | Cod sursa (job #2784558) | Cod sursa (job #2738979) | Cod sursa (job #2036010) | Cod sursa (job #2263451)
#include <fstream>
using namespace std;
int n, a[9];
ifstream fi ("permutari.in");
ofstream fo ("permutari.out");
bool cont (int k) {
int i;
for (i = 1; i < k; i++)
if (a[i] == a[k])
return false;
return true;
}
void permutari (int k) {
int i, j;
if (k <= n)
for (i = 1; i <= n; i++) {
a[k] = i;
if (cont(k))
permutari (k+1);
}
else {
for (j = 1; j <= n; j++)
fo << a[j] << ' ';
fo << '\n';
}
}
int main () {
fi >> n;
permutari (1);
}