Advertisement
Guest User

Untitled

a guest
Oct 20th, 2019
100
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.75 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. int main(){
  4. int n;
  5. cin >> n;
  6.  
  7. vector<pair<int, int>> edges;
  8.  
  9. int matrix[n][n];
  10.  
  11. for (int i = 0; i < n; i++){
  12. for (int j = 0; j < n; j++)
  13. matrix[i][j] = 0;
  14. }
  15.  
  16. int a, b;
  17.  
  18. for (int i = 0; i < n - 1; i++){
  19. cin >> a >> b;
  20. matrix[a - 1][b - 1] = 1;
  21. matrix[b - 1][a - 1] = 1;
  22. }
  23.  
  24. int max_i = 0, max_roads = 0;
  25.  
  26. int coun = 0;
  27.  
  28. for (int i = 0; i < n; i++){
  29. coun = 0;
  30.  
  31. for (int j = 0; j < n; j++){
  32. coun += matrix[i][j];
  33. }
  34.  
  35. if (coun > max_roads) {
  36. max_roads = coun;
  37. max_i = i + 1;
  38. }
  39. }
  40.  
  41. cout << max_roads << " " << max_i;
  42. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement