Pagini recente » Cod sursa (job #1375777) | Cod sursa (job #1238587) | Cod sursa (job #851422) | Cod sursa (job #737457) | Cod sursa (job #2961642)
#include <iostream>
#include <fstream>
using namespace std;
int n, fol[26], vocala;
ifstream fin("permutari.in");
ofstream fout("permutari.out");
void gen(int lg, char sir[11]) {
vocala = 0;
for(int i = 1; i < n; ++i) {
if((sir[i] == 'a' && sir[i + 1] == 'e') || (sir[i] == 'e' && sir[i + 1] == 'a') || (sir[i] == 'a' && sir[i + 1] == 'i') || (sir[i] == 'i' && sir[i + 1] == 'a') || (sir[i] == 'e' && sir[i + 1] == 'i' || (sir[i] == 'i' && sir[i + 1] == 'e'))) {
vocala++;
}
}
if (lg == n + 1) {
if(vocala == 0) {
for (int i = 1; i <= n; ++i) {
fout << sir[i] - 'a' + 1;
}
fout << "\n";
return;
}
}
for (char c = 'a'; c < 'a' + n; ++c) {
if (fol[c - 'a'] == 0) {
sir[lg] = c;
fol[c - 'a'] = 1;
gen(lg + 1, sir);
fol[c - 'a'] = 0;
}
}
}
int main() {
char sir[11];
fin >> n;
gen(1, sir);
return 0;
}