Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <bits/stdc++.h>
- using namespace std;
- ifstream fin("permutari.in");
- ofstream fout("permutari.out");
- int n, x[11];
- int ok(int k) {
- for (int i = 1; i < k; i++)
- if (x[i] == x[k])
- return false;
- return true;
- }
- void afisare(int k) {
- for (int i = 1; i <= k; i++)
- fout << x[i] << " ";
- fout << "\n";
- }
- void Back(int k) {
- for (int i = 1; i <= n; i++) {
- x[k] = i;
- if (ok(k))
- if (k == n)
- afisare(k);
- else
- Back(k + 1);
- }
- }
- int main() {
- fin >> n;
- Back(1);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement