Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <algorithm>
- #include <vector>
- using namespace std;
- vector<int> sol;
- int mat[101][101];
- int main()
- {
- int n ;
- cin >> n;
- for(int i = 1;i<=n*(n-1)/2;i++)
- {
- int a , b;
- cin >> a >> b;
- mat[a][b] = 1;
- }
- sol.push_back(1);
- for(int i = 2;i<=n;i++)
- {
- if(mat[sol.back()][i])
- sol.push_back(i);
- else if(mat[i][sol.front()])
- sol.insert(sol.begin(),i);
- else
- {
- for(int it = 1;it<sol.size();it++)
- {
- if(mat[i][sol[it]])
- {
- sol.insert(sol.begin() + it, i);
- break;
- }
- }
- }
- }
- for(auto it : sol)
- cout << it << ' ';
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
