Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- #include <algorithm>
- using namespace std;
- int st[100], a[100], n;
- void Init(int k)
- {
- st[k] = 0;
- }
- int Succesor(int k)
- {
- if(st[k] < n)
- {
- st[k]++;
- return 1;
- }
- return 0;
- }
- int Valid(int k)
- {
- for(int i = 1; i < k; i++)
- if(st[k] == st[i])
- return 0;
- return 1;
- }
- int Solutie(int k)
- {
- if(k == n+1)
- return 1;
- return 0;
- }
- ofstream fout("permutari2.out");
- void Tipar()
- {
- for(int i = 1; i <= n; i++)
- fout << a[st[i]] << " ";
- fout << "\n";
- }
- void backtrack(int k)
- {
- if(Solutie(k))
- Tipar();
- else
- {
- Init(k);
- while(Succesor(k))
- if(Valid(k))
- backtrack(k+1);
- }
- }
- int main()
- {
- ifstream fin("permutari2.in");
- fin >> n;
- for(int i = 1; i <= n; i++)
- fin >> a[i];
- sort(a, a+n+1);
- for(int i = 1; i <= n; i++)
- cout<< a[i];
- backtrack(1);
- fin.close();
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement