Advertisement
Guest User

Untitled

a guest
Aug 24th, 2019
90
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.88 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. int main() {
  4. int n ;
  5. while(1) {
  6. freopen("input.txt","r",stdin);
  7. scanf("%d",&n);
  8. if ( n == 0) break ;
  9. int a,b;
  10. vector < pair <int,int> > vec;
  11. for ( int i = 0 ; i < n ; i++) {
  12. scanf("%d %d",&a,&b);
  13. vec.push_back(make_pair(min(a,b),max(a,b)));
  14. }
  15. sort(vec.begin(),vec.end());
  16. int fact = 0 ;
  17. for ( int i = 1 ; i < vec.size() ; i = i+2 ) {
  18. if (vec[i].first != vec[i-1].first || vec[i].second != vec[i-1].second) {
  19. fact = 1 ;
  20. break ;
  21. }
  22. }
  23. for ( int i = 0 ; i < vec.size() ; i++) {
  24. cout << vec[i].first << " " << vec[i].second << endl;
  25. }
  26. if ( fact == 1 ) printf("NO\n");
  27. else printf("YES\n");
  28. }
  29. return 0 ;
  30. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement