Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- int n, i, j, k, st[101], a[101][101],sw;
- void cit()
- {
- int x,y;
- cin>>n;
- k=n*(n-1)/2;
- for(int i=1;i<=k;i++)
- {
- cin>>x>>y;
- a[x][y]=1;
- }
- }
- void tip()
- {
- int i;
- for(i=1;i<=n;i++)
- cout<<st[i]<<" ";
- }
- int valid(int k)
- {
- for(int i=1;i<k;i++)
- if(st[k]==st[i]) return 0;
- if(k>1&&a[st[k-1]][st[k]]==0) return 0;
- return 1;
- }
- void back(int k)
- {
- if(sw==0)
- for(int i=1;i<=n;i++)
- {
- st[k]=i;
- if(valid(k))
- if(k==n)
- {
- tip();
- sw=1;
- }
- else back(k+1);
- }
- }
- int main()
- {
- cit();
- back(1);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement