Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- ifstream f("permutari.in");
- ofstream g("permutari.out");
- int st[100],n,v[100];
- int valid(int p)
- {
- int i;
- for (i=1;i<p;i++)
- {
- if(v[i]==1 && v[i+1]==3 || v[i]==3 && v[i+1]==1 && v[i]==4 && v[i+1]==5 || v[i]==5 && v[i+1]==4)
- return false;
- if(v[i]==v[i+1])
- return false;
- if(st[i]==st[p])
- return false;
- return true;
- }
- }
- void afis(int p)
- {
- int i;
- for (i=1;i<=p;i++)
- cout<<st[i]<<" ";
- cout<<'\n';
- }
- int solutie(int p)
- {
- if (p==n)
- return 1;
- return 0;
- }
- void backtr(int p)
- {
- int i;
- for (i=1;i<=n;i++)
- {
- st[p]=i;
- if (valid(p))
- if (solutie(p))
- afis(p);
- else
- backtr(p+1);
- }
- }
- int main()
- {
- cin>>n;
- for (int i=1;i<=n;i++)
- f>>v[i];
- for(int i=1;i<=n;i++)
- st[i]=i;
- backtr(1);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment