fork download
  1. #include <numeric>
  2. #include <iostream>
  3. #include <vector>
  4.  
  5. int main(int argc, const char *argv[])
  6. {
  7. // Get numbah of nodes
  8. int num_nodes;
  9. std::cin >> num_nodes;
  10.  
  11. // These will be initialized with 0
  12. std::vector<int> adj_matrix(num_nodes * num_nodes);
  13.  
  14. while(true) {
  15. // Track the beginning and end of each edge
  16. int begin, end;
  17. if (!(std::cin >> begin >> end)){
  18. break;
  19. }
  20.  
  21. // We use 0 based indexes, they use 1 based
  22. begin--;
  23. end--;
  24.  
  25. // Store them in our adjacency matrix
  26. adj_matrix[begin*num_nodes + end] = 1;
  27. adj_matrix[end*num_nodes + begin] = 1;
  28. }
  29.  
  30. // Generate degree from adj_matrix
  31. for(int i = 0; i < num_nodes; ++i) {
  32. int degrees = std::accumulate(adj_matrix.cbegin() + i*num_nodes,
  33. adj_matrix.cbegin() + (i+1)*num_nodes,
  34. 0);
  35.  
  36. std::cout << "Node "
  37. << i+1
  38. << " has a degree of "
  39. << degrees
  40. << std::endl;
  41. }
  42.  
  43. // Print result
  44. for(const auto &elem : adj_matrix) {
  45. auto i = &elem - &adj_matrix[0];
  46. std::cout << elem << " ";
  47. if (i % num_nodes == num_nodes - 1) {
  48. std::cout << std::endl;
  49. }
  50. }
  51.  
  52. return 0;
  53. }
Success #stdin #stdout 0s 3416KB
stdin
16
1 2
1 3
2 3
1 4
3 4
1 5
2 5
1 6
2 6
3 6
3 7
5 7
6 7
3 8
4 8
6 8
7 8
2 9
5 9
6 9
2 10
9 10
6 11
7 11
8 11
9 11
10 11
1 12
6 12
7 12
8 12
11 12
6 13
7 13
9 13
10 13
11 13
5 14
8 14
12 14
13 14
1 15
2 15
5 15
9 15
10 15
11 15
12 15
13 15
1 16
2 16
5 16
6 16
11 16
12 16
13 16
14 16
15 16
stdout
Node 1 has a degree of 8
Node 2 has a degree of 8
Node 3 has a degree of 6
Node 4 has a degree of 3
Node 5 has a degree of 7
Node 6 has a degree of 10
Node 7 has a degree of 7
Node 8 has a degree of 7
Node 9 has a degree of 7
Node 10 has a degree of 5
Node 11 has a degree of 9
Node 12 has a degree of 8
Node 13 has a degree of 8
Node 14 has a degree of 5
Node 15 has a degree of 9
Node 16 has a degree of 9
0 1 1 1 1 1 0 0 0 0 0 1 0 0 1 1 
1 0 1 0 1 1 0 0 1 1 0 0 0 0 1 1 
1 1 0 1 0 1 1 1 0 0 0 0 0 0 0 0 
1 0 1 0 0 0 0 1 0 0 0 0 0 0 0 0 
1 1 0 0 0 0 1 0 1 0 0 0 0 1 1 1 
1 1 1 0 0 0 1 1 1 0 1 1 1 0 0 1 
0 0 1 0 1 1 0 1 0 0 1 1 1 0 0 0 
0 0 1 1 0 1 1 0 0 0 1 1 0 1 0 0 
0 1 0 0 1 1 0 0 0 1 1 0 1 0 1 0 
0 1 0 0 0 0 0 0 1 0 1 0 1 0 1 0 
0 0 0 0 0 1 1 1 1 1 0 1 1 0 1 1 
1 0 0 0 0 1 1 1 0 0 1 0 0 1 1 1 
0 0 0 0 0 1 1 0 1 1 1 0 0 1 1 1 
0 0 0 0 1 0 0 1 0 0 0 1 1 0 0 1 
1 1 0 0 1 0 0 0 1 1 1 1 1 0 0 1 
1 1 0 0 1 1 0 0 0 0 1 1 1 1 1 0