Pagini recente » Cod sursa (job #2272635) | Cod sursa (job #2332199) | Cod sursa (job #3161090) | Cod sursa (job #2578947) | Cod sursa (job #2773747)
#include <fstream>
using namespace std;
ifstream cin("permutari.in");
ofstream cout("permutari.out");
#define DIM 10
int v[DIM], n;
static inline bool check(int k) {
int i = 1;
while(v[i] != v[k])
i++;
return(i == k); ///verific daca am ajuns la final;
}
static inline bool solutie(int k) {
return (n == k);
}
static inline void Afis() {
for(int i = 1; i <= n; i++)
cout << v[i] << " ";
cout << '\n';
}
static inline void Back(int k) {
for(int i = 1; i <= n; i++) {
v[k] = i;
if(check(k)) { ///daca sirul e valid;
if(solutie(k)) ///daca am n elemente;
Afis();
else Back(k + 1); ///mai adaug un element;
}
}
}
int main() {
cin >> n;
Back(1);
return 0;
}