index
stringlengths 1
4
| input_prompt
stringlengths 489
1.07k
| answer
stringclasses 24
values | node_range
stringclasses 5
values | edge_range
stringclasses 5
values |
|---|---|---|---|---|
880 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 11, weights of nodes are: [0, 9] [1, 4] [2, 9] [3, 6] [4, 10] [5, 1] [6, 1] [7, 10] [8, 10] [9, 9] [10, 3] [11, 10], and the edges are: (0, 3) (1, 6) (1, 8) (1, 10) (2, 4) (2, 10) (2, 5) (3, 7) (3, 11) (5, 10) (6, 10). What is the maximum sum of the weights of three nodes? | ### 13 | [10, 15] | [2, 21] |
882 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 14, weights of nodes are: [0, 9] [1, 5] [2, 7] [3, 6] [4, 3] [5, 2] [6, 2] [7, 8] [8, 9] [9, 10] [10, 5] [11, 4] [12, 10] [13, 3] [14, 1], and the edges are: (0, 6) (0, 9) (2, 7) (2, 6) (2, 4) (4, 6) (4, 14) (4, 5) (4, 7) (5, 6) (5, 13) (5, 7) (7, 12) (7, 10) (9, 11) (11, 14). What is the maximum sum of the weights of three nodes? | ### 18 | [10, 15] | [2, 21] |
884 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 12, weights of nodes are: [0, 7] [1, 8] [2, 2] [3, 3] [4, 8] [5, 10] [6, 5] [7, 10] [8, 10] [9, 2] [10, 7] [11, 2] [12, 6], and the edges are: (0, 5) (1, 2) (1, 10) (2, 8) (3, 12) (5, 11) (5, 8) (5, 9) (5, 10) (6, 11) (7, 10) (7, 12) (8, 11). What is the maximum sum of the weights of three nodes? | ### 22 | [10, 15] | [2, 21] |
886 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 10, weights of nodes are: [0, 6] [1, 5] [2, 9] [3, 1] [4, 5] [5, 5] [6, 2] [7, 3] [8, 4] [9, 10] [10, 6], and the edges are: (0, 7) (0, 6) (0, 3) (1, 7) (3, 4) (3, 7) (6, 10). What is the maximum sum of the weights of three nodes? | ### 10 | [10, 15] | [2, 21] |
888 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 11, weights of nodes are: [0, 2] [1, 1] [2, 8] [3, 8] [4, 6] [5, 7] [6, 5] [7, 9] [8, 10] [9, 7] [10, 1] [11, 2], and the edges are: (1, 4) (3, 9) (3, 7) (4, 7) (5, 8) (5, 11) (6, 8) (7, 9) (8, 10). What is the maximum sum of the weights of three nodes? | ### 24 | [10, 15] | [2, 21] |
890 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 11, weights of nodes are: [0, 1] [1, 2] [2, 10] [3, 2] [4, 1] [5, 5] [6, 1] [7, 3] [8, 1] [9, 4] [10, 2] [11, 4], and the edges are: (1, 6) (1, 2) (2, 7) (2, 9) (2, 5) (2, 8) (3, 7) (3, 11) (3, 6) (4, 8) (6, 7) (7, 10) (7, 8). What is the maximum sum of the weights of three nodes? | ### 14 | [10, 15] | [2, 21] |
892 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 10, weights of nodes are: [0, 1] [1, 3] [2, 7] [3, 1] [4, 7] [5, 7] [6, 7] [7, 9] [8, 3] [9, 1] [10, 3], and the edges are: (0, 1) (0, 8) (1, 7) (1, 8) (3, 10) (3, 4) (4, 8) (4, 6) (5, 7). What is the maximum sum of the weights of three nodes? | ### 7 | [10, 15] | [2, 21] |
894 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 12, weights of nodes are: [0, 3] [1, 5] [2, 5] [3, 10] [4, 5] [5, 3] [6, 8] [7, 3] [8, 8] [9, 3] [10, 9] [11, 8] [12, 1], and the edges are: (0, 10) (0, 6) (0, 11) (1, 8) (3, 7) (3, 4) (4, 9) (4, 12) (6, 10) (7, 12) (10, 11). What is the maximum sum of the weights of three nodes? | ### 20 | [10, 15] | [2, 21] |
896 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 12, weights of nodes are: [0, 5] [1, 1] [2, 10] [3, 7] [4, 2] [5, 6] [6, 5] [7, 1] [8, 10] [9, 9] [10, 3] [11, 5] [12, 1], and the edges are: (0, 8) (0, 11) (1, 11) (2, 4) (2, 12) (2, 9) (3, 9) (3, 4) (4, 11) (8, 12) (8, 11). What is the maximum sum of the weights of three nodes? | ### 20 | [10, 15] | [2, 21] |
898 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 14, weights of nodes are: [0, 4] [1, 10] [2, 8] [3, 2] [4, 3] [5, 1] [6, 10] [7, 6] [8, 9] [9, 1] [10, 9] [11, 4] [12, 9] [13, 7] [14, 7], and the edges are: (2, 8) (3, 4) (4, 8) (4, 12) (5, 12) (6, 10) (6, 7) (6, 13) (7, 13) (9, 11) (9, 10) (12, 14). What is the maximum sum of the weights of three nodes? | ### 23 | [10, 15] | [2, 21] |
900 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 11, weights of nodes are: [0, 2] [1, 6] [2, 3] [3, 7] [4, 5] [5, 10] [6, 2] [7, 6] [8, 7] [9, 7] [10, 4] [11, 5], and the edges are: (0, 5) (0, 1) (0, 6) (1, 10) (2, 4) (3, 6) (4, 11) (5, 6) (6, 10). What is the maximum sum of the weights of three nodes? | ### 14 | [10, 15] | [2, 21] |
902 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 14, weights of nodes are: [0, 6] [1, 7] [2, 4] [3, 6] [4, 5] [5, 9] [6, 7] [7, 10] [8, 2] [9, 2] [10, 8] [11, 8] [12, 10] [13, 8] [14, 7], and the edges are: (0, 14) (0, 7) (0, 11) (1, 9) (2, 7) (2, 11) (2, 12) (3, 13) (3, 4) (3, 10) (4, 7) (4, 6) (4, 13) (5, 14) (5, 7) (5, 11) (6, 12) (7, 9) (8, 10) (9, 14) (11, 14). What is the maximum sum of the weights of three nodes? | ### 24 | [10, 15] | [2, 21] |
904 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 12, weights of nodes are: [0, 8] [1, 3] [2, 2] [3, 6] [4, 8] [5, 4] [6, 4] [7, 2] [8, 9] [9, 8] [10, 1] [11, 3] [12, 6], and the edges are: (0, 3) (0, 7) (0, 10) (1, 8) (1, 12) (2, 11) (3, 7) (3, 8) (4, 6) (7, 12) (7, 9) (9, 11) (9, 12) (10, 11). What is the maximum sum of the weights of three nodes? | ### 16 | [10, 15] | [2, 21] |
906 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 9, weights of nodes are: [0, 10] [1, 1] [2, 5] [3, 10] [4, 3] [5, 6] [6, 8] [7, 9] [8, 9] [9, 7], and the edges are: (0, 3) (0, 8) (0, 1) (0, 2) (1, 2) (2, 4) (6, 7). What is the maximum sum of the weights of three nodes? | ### 16 | [10, 15] | [2, 21] |
908 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 12, weights of nodes are: [0, 5] [1, 2] [2, 2] [3, 5] [4, 10] [5, 1] [6, 8] [7, 5] [8, 3] [9, 4] [10, 7] [11, 1] [12, 1], and the edges are: (0, 3) (0, 12) (1, 11) (1, 5) (2, 11) (3, 11) (4, 10) (4, 6) (4, 5) (5, 6) (5, 8) (6, 9) (7, 10). What is the maximum sum of the weights of three nodes? | ### 19 | [10, 15] | [2, 21] |
910 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 11, weights of nodes are: [0, 2] [1, 3] [2, 1] [3, 7] [4, 10] [5, 1] [6, 4] [7, 9] [8, 8] [9, 3] [10, 6] [11, 7], and the edges are: (0, 5) (0, 9) (1, 7) (1, 2) (2, 9) (3, 7) (3, 5) (3, 4) (4, 7) (4, 10) (7, 10). What is the maximum sum of the weights of three nodes? | ### 26 | [10, 15] | [2, 21] |
912 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 13, weights of nodes are: [0, 2] [1, 4] [2, 4] [3, 1] [4, 6] [5, 5] [6, 7] [7, 9] [8, 3] [9, 10] [10, 8] [11, 5] [12, 3] [13, 10], and the edges are: (0, 10) (1, 7) (1, 3) (2, 12) (2, 8) (2, 4) (3, 8) (3, 7) (3, 9) (4, 13) (4, 10) (6, 11) (6, 10) (8, 12). What is the maximum sum of the weights of three nodes? | ### 14 | [10, 15] | [2, 21] |
914 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 9, weights of nodes are: [0, 5] [1, 8] [2, 4] [3, 1] [4, 8] [5, 10] [6, 8] [7, 2] [8, 1] [9, 1], and the edges are: (0, 4) (0, 2) (1, 2) (2, 7) (2, 4) (3, 5). What is the maximum sum of the weights of three nodes? | ### 17 | [10, 15] | [2, 21] |
916 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 14, weights of nodes are: [0, 2] [1, 4] [2, 7] [3, 1] [4, 8] [5, 8] [6, 8] [7, 7] [8, 9] [9, 7] [10, 2] [11, 5] [12, 5] [13, 3] [14, 8], and the edges are: (0, 12) (0, 2) (0, 6) (0, 3) (1, 4) (1, 6) (2, 11) (2, 10) (2, 6) (3, 14) (3, 11) (3, 8) (4, 11) (5, 9) (5, 12) (5, 6) (7, 9) (8, 11) (9, 11) (9, 14). What is the maximum sum of the weights of three nodes? | ### 17 | [10, 15] | [2, 21] |
918 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 11, weights of nodes are: [0, 9] [1, 7] [2, 10] [3, 4] [4, 1] [5, 8] [6, 6] [7, 6] [8, 9] [9, 8] [10, 1] [11, 10], and the edges are: (0, 9) (0, 11) (2, 5) (5, 11) (5, 8) (7, 8) (8, 11). What is the maximum sum of the weights of three nodes? | ### 27 | [10, 15] | [2, 21] |
920 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 11, weights of nodes are: [0, 7] [1, 9] [2, 6] [3, 9] [4, 10] [5, 8] [6, 7] [7, 3] [8, 2] [9, 9] [10, 1] [11, 7], and the edges are: (0, 9) (0, 6) (1, 10) (1, 7) (1, 8) (2, 10) (2, 9) (5, 10) (5, 8) (6, 8) (7, 8) (7, 10). What is the maximum sum of the weights of three nodes? | ### 14 | [10, 15] | [2, 21] |
922 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 13, weights of nodes are: [0, 10] [1, 5] [2, 3] [3, 9] [4, 2] [5, 4] [6, 10] [7, 4] [8, 9] [9, 1] [10, 6] [11, 9] [12, 4] [13, 5], and the edges are: (0, 13) (2, 4) (2, 12) (4, 10) (4, 12) (4, 8) (5, 7) (5, 6) (5, 12) (6, 12) (8, 13). What is the maximum sum of the weights of three nodes? | ### 18 | [10, 15] | [2, 21] |
924 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 11, weights of nodes are: [0, 9] [1, 8] [2, 8] [3, 5] [4, 1] [5, 2] [6, 4] [7, 3] [8, 1] [9, 10] [10, 5] [11, 2], and the edges are: (0, 7) (1, 9) (2, 3) (2, 6) (2, 9) (3, 6) (5, 11) (6, 9) (9, 10). What is the maximum sum of the weights of three nodes? | ### 22 | [10, 15] | [2, 21] |
926 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 14, weights of nodes are: [0, 3] [1, 3] [2, 4] [3, 3] [4, 2] [5, 9] [6, 10] [7, 7] [8, 2] [9, 1] [10, 2] [11, 8] [12, 9] [13, 10] [14, 1], and the edges are: (0, 4) (0, 6) (0, 8) (0, 7) (0, 12) (1, 8) (1, 12) (1, 6) (2, 6) (2, 8) (3, 14) (3, 12) (4, 7) (6, 13) (6, 14) (7, 9) (7, 14) (9, 14) (9, 12) (10, 13) (12, 13). What is the maximum sum of the weights of three nodes? | ### 12 | [10, 15] | [2, 21] |
928 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 13, weights of nodes are: [0, 7] [1, 8] [2, 3] [3, 7] [4, 6] [5, 10] [6, 9] [7, 4] [8, 9] [9, 9] [10, 4] [11, 7] [12, 10] [13, 1], and the edges are: (0, 2) (1, 11) (1, 12) (1, 4) (1, 3) (1, 5) (1, 2) (3, 5) (3, 12) (4, 9) (5, 10) (5, 13) (6, 8) (6, 11) (7, 10) (8, 13) (9, 12) (10, 13). What is the maximum sum of the weights of three nodes? | ### 25 | [10, 15] | [2, 21] |
930 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 11, weights of nodes are: [0, 1] [1, 9] [2, 8] [3, 10] [4, 8] [5, 8] [6, 2] [7, 1] [8, 4] [9, 5] [10, 2] [11, 2], and the edges are: (1, 5) (4, 5) (5, 11) (5, 8) (5, 7) (7, 8) (10, 11). What is the maximum sum of the weights of three nodes? | ### 13 | [10, 15] | [2, 21] |
932 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 11, weights of nodes are: [0, 5] [1, 4] [2, 8] [3, 10] [4, 1] [5, 6] [6, 6] [7, 8] [8, 7] [9, 5] [10, 2] [11, 5], and the edges are: (0, 11) (0, 10) (0, 7) (0, 2) (1, 3) (2, 10) (2, 6) (3, 9) (3, 11) (3, 5) (4, 9) (5, 11). What is the maximum sum of the weights of three nodes? | ### 21 | [10, 15] | [2, 21] |
934 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 12, weights of nodes are: [0, 4] [1, 5] [2, 4] [3, 8] [4, 5] [5, 9] [6, 7] [7, 9] [8, 8] [9, 10] [10, 6] [11, 6] [12, 7], and the edges are: (0, 8) (0, 1) (1, 10) (1, 6) (1, 3) (1, 8) (1, 7) (2, 7) (2, 4) (2, 3) (3, 6) (5, 12). What is the maximum sum of the weights of three nodes? | ### 20 | [10, 15] | [2, 21] |
936 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 12, weights of nodes are: [0, 8] [1, 8] [2, 8] [3, 8] [4, 7] [5, 7] [6, 9] [7, 10] [8, 7] [9, 6] [10, 1] [11, 3] [12, 1], and the edges are: (0, 10) (2, 11) (2, 6) (2, 7) (4, 12) (5, 10) (5, 12) (5, 7) (6, 12) (8, 12) (9, 11) (10, 12). What is the maximum sum of the weights of three nodes? | ### 9 | [10, 15] | [2, 21] |
938 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 10, weights of nodes are: [0, 3] [1, 5] [2, 1] [3, 7] [4, 6] [5, 7] [6, 9] [7, 8] [8, 4] [9, 2] [10, 5], and the edges are: (1, 5) (1, 4) (1, 10) (1, 2) (2, 5) (2, 7) (3, 9) (5, 6). What is the maximum sum of the weights of three nodes? | ### 13 | [10, 15] | [2, 21] |
940 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 10, weights of nodes are: [0, 4] [1, 9] [2, 7] [3, 2] [4, 5] [5, 2] [6, 3] [7, 10] [8, 5] [9, 9] [10, 2], and the edges are: (0, 1) (1, 2) (3, 7) (3, 8) (3, 10) (4, 10) (6, 10) (7, 9) (8, 10). What is the maximum sum of the weights of three nodes? | ### 9 | [10, 15] | [2, 21] |
942 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 10, weights of nodes are: [0, 1] [1, 4] [2, 6] [3, 9] [4, 3] [5, 10] [6, 1] [7, 3] [8, 3] [9, 4] [10, 9], and the edges are: (1, 10) (2, 5) (4, 7) (4, 8) (4, 6) (5, 10) (7, 8). What is the maximum sum of the weights of three nodes? | ### 9 | [10, 15] | [2, 21] |
944 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 10, weights of nodes are: [0, 4] [1, 8] [2, 4] [3, 9] [4, 4] [5, 3] [6, 7] [7, 5] [8, 2] [9, 3] [10, 6], and the edges are: (0, 9) (0, 7) (1, 5) (1, 6) (2, 10) (2, 4) (3, 10) (3, 4) (3, 9) (6, 10) (7, 9). What is the maximum sum of the weights of three nodes? | ### 12 | [10, 15] | [2, 21] |
946 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 11, weights of nodes are: [0, 4] [1, 8] [2, 1] [3, 5] [4, 2] [5, 9] [6, 9] [7, 6] [8, 8] [9, 5] [10, 5] [11, 2], and the edges are: (0, 10) (0, 3) (1, 9) (1, 8) (1, 2) (1, 7) (2, 5) (2, 11) (2, 6) (4, 9) (4, 5) (5, 9) (7, 9). What is the maximum sum of the weights of three nodes? | ### 19 | [10, 15] | [2, 21] |
948 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 12, weights of nodes are: [0, 2] [1, 10] [2, 4] [3, 9] [4, 6] [5, 8] [6, 4] [7, 4] [8, 10] [9, 9] [10, 8] [11, 1] [12, 6], and the edges are: (0, 1) (0, 3) (0, 2) (1, 11) (2, 5) (2, 10) (2, 3) (3, 7) (3, 5) (3, 11) (4, 10) (4, 7) (5, 8) (6, 10) (9, 12). What is the maximum sum of the weights of three nodes? | ### 21 | [10, 15] | [2, 21] |
950 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 14, weights of nodes are: [0, 9] [1, 9] [2, 2] [3, 9] [4, 7] [5, 2] [6, 7] [7, 6] [8, 9] [9, 7] [10, 10] [11, 10] [12, 6] [13, 5] [14, 2], and the edges are: (0, 8) (1, 10) (1, 3) (1, 8) (2, 11) (2, 14) (2, 10) (3, 14) (4, 7) (4, 11) (5, 8) (6, 11) (6, 12) (7, 11) (8, 10) (8, 12) (9, 13) (9, 11) (9, 12) (11, 14) (11, 12). What is the maximum sum of the weights of three nodes? | ### 28 | [10, 15] | [2, 21] |
952 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 9, weights of nodes are: [0, 4] [1, 1] [2, 9] [3, 2] [4, 2] [5, 3] [6, 3] [7, 3] [8, 6] [9, 5], and the edges are: (0, 2) (0, 7) (0, 3) (0, 1) (1, 5) (1, 7) (3, 6) (5, 6) (7, 8). What is the maximum sum of the weights of three nodes? | ### 8 | [10, 15] | [2, 21] |
954 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 13, weights of nodes are: [0, 10] [1, 8] [2, 5] [3, 4] [4, 4] [5, 4] [6, 2] [7, 7] [8, 2] [9, 7] [10, 2] [11, 7] [12, 4] [13, 8], and the edges are: (0, 7) (1, 9) (1, 13) (1, 3) (2, 5) (2, 4) (3, 13) (3, 5) (3, 12) (7, 11) (8, 11) (9, 11) (9, 13) (10, 12). What is the maximum sum of the weights of three nodes? | ### 23 | [10, 15] | [2, 21] |
956 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 13, weights of nodes are: [0, 1] [1, 3] [2, 2] [3, 3] [4, 10] [5, 6] [6, 2] [7, 1] [8, 10] [9, 7] [10, 10] [11, 2] [12, 3] [13, 6], and the edges are: (1, 11) (2, 3) (2, 11) (3, 10) (3, 9) (3, 7) (4, 6) (4, 11) (5, 12) (5, 6) (6, 12) (6, 7) (11, 13) (11, 12). What is the maximum sum of the weights of three nodes? | ### 11 | [10, 15] | [2, 21] |
958 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 11, weights of nodes are: [0, 2] [1, 10] [2, 2] [3, 6] [4, 4] [5, 1] [6, 7] [7, 10] [8, 1] [9, 5] [10, 4] [11, 3], and the edges are: (0, 7) (1, 6) (1, 8) (3, 9) (3, 4) (4, 10) (4, 8) (6, 8) (6, 9) (7, 9) (8, 9). What is the maximum sum of the weights of three nodes? | ### 18 | [10, 15] | [2, 21] |
1200 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 16, weights of nodes are: [0, 7] [1, 9] [2, 1] [3, 6] [4, 3] [5, 10] [6, 1] [7, 4] [8, 1] [9, 8] [10, 9] [11, 1] [12, 7] [13, 5] [14, 8] [15, 4] [16, 9], and the edges are: (0, 7) (1, 11) (1, 13) (1, 5) (1, 2) (2, 7) (2, 5) (2, 14) (3, 15) (3, 14) (3, 10) (3, 9) (4, 9) (5, 15) (5, 9) (6, 15) (8, 14) (9, 12) (10, 16). What is the maximum sum of the weights of three nodes? | ### 20 | [15, 20] | [5, 38] |
1202 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 16, weights of nodes are: [0, 2] [1, 5] [2, 8] [3, 5] [4, 1] [5, 6] [6, 5] [7, 9] [8, 5] [9, 7] [10, 9] [11, 8] [12, 6] [13, 6] [14, 9] [15, 5] [16, 5], and the edges are: (1, 5) (1, 6) (2, 16) (2, 15) (3, 9) (3, 15) (3, 12) (3, 5) (7, 12) (8, 10) (8, 13) (8, 16) (9, 15) (9, 16). What is the maximum sum of the weights of three nodes? | ### 17 | [15, 20] | [5, 38] |
1204 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 19, weights of nodes are: [0, 3] [1, 8] [2, 10] [3, 10] [4, 7] [5, 4] [6, 1] [7, 3] [8, 8] [9, 5] [10, 10] [11, 5] [12, 2] [13, 1] [14, 3] [15, 1] [16, 3] [17, 4] [18, 10] [19, 7], and the edges are: (0, 5) (1, 5) (1, 4) (1, 3) (2, 8) (2, 17) (3, 7) (3, 9) (4, 11) (4, 17) (4, 13) (6, 10) (6, 18) (6, 8) (6, 16) (7, 18) (7, 13) (8, 10) (9, 17) (9, 12) (9, 14) (10, 16) (10, 18) (11, 15) (11, 19) (13, 16) (16, 17). What is the maximum sum of the weights of three nodes? | ### 21 | [15, 20] | [5, 38] |
1206 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 14, weights of nodes are: [0, 5] [1, 3] [2, 8] [3, 9] [4, 7] [5, 1] [6, 4] [7, 9] [8, 7] [9, 7] [10, 3] [11, 8] [12, 8] [13, 7] [14, 8], and the edges are: (0, 14) (0, 2) (0, 12) (1, 12) (1, 4) (1, 2) (3, 9) (4, 10) (4, 14) (5, 13) (5, 10) (6, 9) (6, 11) (6, 12) (8, 10) (9, 12) (9, 10) (10, 13) (12, 13). What is the maximum sum of the weights of three nodes? | ### 19 | [15, 20] | [5, 38] |
1208 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 19, weights of nodes are: [0, 5] [1, 5] [2, 3] [3, 5] [4, 9] [5, 2] [6, 8] [7, 4] [8, 7] [9, 6] [10, 8] [11, 2] [12, 3] [13, 6] [14, 2] [15, 10] [16, 2] [17, 3] [18, 5] [19, 5], and the edges are: (0, 4) (0, 11) (0, 8) (0, 10) (1, 18) (1, 4) (1, 8) (2, 13) (2, 12) (3, 6) (3, 15) (4, 13) (4, 11) (4, 8) (4, 17) (5, 10) (5, 17) (6, 7) (6, 10) (7, 8) (7, 19) (8, 14) (8, 15) (9, 14) (9, 16) (10, 13) (10, 15) (11, 18) (12, 19) (12, 18) (13, 16) (14, 17) (15, 19). What is the maximum sum of the weights of three nodes? | ### 21 | [15, 20] | [5, 38] |
1210 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 19, weights of nodes are: [0, 9] [1, 1] [2, 2] [3, 5] [4, 1] [5, 1] [6, 4] [7, 4] [8, 3] [9, 8] [10, 1] [11, 6] [12, 1] [13, 6] [14, 10] [15, 3] [16, 1] [17, 6] [18, 8] [19, 3], and the edges are: (0, 18) (0, 6) (0, 15) (1, 8) (1, 16) (1, 19) (1, 12) (2, 6) (2, 4) (3, 16) (3, 17) (4, 11) (4, 18) (4, 17) (4, 19) (5, 12) (5, 10) (5, 13) (5, 14) (7, 17) (7, 11) (7, 13) (8, 10) (9, 14) (9, 13) (10, 17) (10, 11) (10, 19) (11, 16) (11, 19) (11, 15) (13, 19) (14, 16) (15, 19) (18, 19). What is the maximum sum of the weights of three nodes? | ### 12 | [15, 20] | [5, 38] |
1212 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 15, weights of nodes are: [0, 4] [1, 4] [2, 9] [3, 2] [4, 7] [5, 3] [6, 6] [7, 8] [8, 3] [9, 5] [10, 3] [11, 6] [12, 1] [13, 1] [14, 5] [15, 1], and the edges are: (0, 14) (1, 10) (1, 12) (2, 4) (2, 10) (2, 13) (3, 9) (3, 10) (4, 5) (4, 10) (4, 7) (5, 12) (5, 6) (6, 12) (6, 8) (6, 11) (7, 12) (8, 9) (9, 10) (9, 14) (9, 15) (10, 14) (11, 14) (14, 15). What is the maximum sum of the weights of three nodes? | ### 19 | [15, 20] | [5, 38] |
1214 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 17, weights of nodes are: [0, 8] [1, 8] [2, 6] [3, 4] [4, 4] [5, 10] [6, 3] [7, 6] [8, 6] [9, 8] [10, 9] [11, 2] [12, 5] [13, 4] [14, 6] [15, 5] [16, 7] [17, 3], and the edges are: (0, 6) (0, 2) (0, 17) (1, 17) (1, 2) (1, 8) (3, 15) (3, 16) (3, 14) (4, 14) (4, 8) (6, 14) (6, 17) (6, 13) (7, 9) (7, 8) (8, 15) (8, 11) (10, 15) (11, 16) (12, 13) (13, 14) (15, 16). What is the maximum sum of the weights of three nodes? | ### 16 | [15, 20] | [5, 38] |
1216 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 18, weights of nodes are: [0, 2] [1, 6] [2, 1] [3, 7] [4, 2] [5, 5] [6, 6] [7, 3] [8, 3] [9, 2] [10, 5] [11, 3] [12, 9] [13, 7] [14, 8] [15, 3] [16, 1] [17, 6] [18, 5], and the edges are: (0, 15) (0, 13) (0, 1) (3, 14) (3, 13) (4, 16) (7, 12) (8, 12) (8, 10) (8, 9) (10, 13) (13, 18) (13, 15). What is the maximum sum of the weights of three nodes? | ### 12 | [15, 20] | [5, 38] |
1218 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 14, weights of nodes are: [0, 9] [1, 1] [2, 7] [3, 1] [4, 10] [5, 2] [6, 4] [7, 8] [8, 4] [9, 8] [10, 3] [11, 7] [12, 10] [13, 4] [14, 10], and the edges are: (0, 5) (1, 2) (1, 4) (1, 14) (2, 7) (2, 6) (3, 11) (3, 14) (3, 9) (3, 7) (4, 14) (5, 9) (5, 12) (5, 7) (6, 7) (7, 14) (8, 14) (9, 12) (10, 14). What is the maximum sum of the weights of three nodes? | ### 21 | [15, 20] | [5, 38] |
1220 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 19, weights of nodes are: [0, 8] [1, 1] [2, 5] [3, 4] [4, 2] [5, 5] [6, 9] [7, 5] [8, 9] [9, 10] [10, 8] [11, 2] [12, 1] [13, 3] [14, 6] [15, 1] [16, 1] [17, 3] [18, 8] [19, 9], and the edges are: (0, 16) (0, 13) (0, 18) (0, 1) (0, 7) (1, 3) (1, 13) (1, 19) (1, 14) (1, 16) (2, 9) (2, 18) (2, 10) (3, 15) (3, 12) (4, 12) (4, 19) (4, 9) (5, 16) (5, 15) (5, 10) (5, 8) (6, 16) (6, 14) (6, 19) (6, 12) (6, 15) (7, 12) (9, 15) (9, 18) (9, 16) (9, 19) (10, 12) (11, 16) (14, 15) (15, 16) (15, 19) (17, 18). What is the maximum sum of the weights of three nodes? | ### 23 | [15, 20] | [5, 38] |
1222 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 15, weights of nodes are: [0, 5] [1, 7] [2, 4] [3, 2] [4, 5] [5, 3] [6, 9] [7, 8] [8, 4] [9, 9] [10, 10] [11, 9] [12, 8] [13, 8] [14, 7] [15, 5], and the edges are: (0, 13) (0, 9) (1, 3) (1, 6) (1, 10) (1, 7) (3, 7) (4, 10) (4, 15) (4, 12) (5, 7) (5, 13) (5, 11) (7, 9) (8, 13) (8, 15) (9, 15) (10, 13). What is the maximum sum of the weights of three nodes? | ### 17 | [15, 20] | [5, 38] |
1224 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 18, weights of nodes are: [0, 10] [1, 1] [2, 9] [3, 1] [4, 7] [5, 9] [6, 8] [7, 3] [8, 1] [9, 8] [10, 9] [11, 3] [12, 7] [13, 9] [14, 5] [15, 2] [16, 1] [17, 6] [18, 3], and the edges are: (0, 17) (0, 1) (0, 4) (0, 8) (0, 5) (0, 15) (0, 9) (0, 12) (1, 14) (1, 2) (1, 16) (1, 11) (2, 7) (2, 5) (3, 5) (4, 9) (5, 9) (6, 11) (7, 13) (7, 8) (8, 11) (8, 13) (9, 14) (9, 15) (10, 13) (10, 14) (10, 18) (11, 13) (12, 17) (12, 14) (15, 17). What is the maximum sum of the weights of three nodes? | ### 27 | [15, 20] | [5, 38] |
1226 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 16, weights of nodes are: [0, 8] [1, 6] [2, 6] [3, 1] [4, 2] [5, 1] [6, 9] [7, 6] [8, 4] [9, 6] [10, 10] [11, 3] [12, 9] [13, 5] [14, 5] [15, 4] [16, 2], and the edges are: (0, 16) (0, 6) (0, 7) (1, 15) (1, 9) (1, 6) (2, 3) (2, 14) (2, 9) (3, 7) (3, 10) (4, 12) (4, 5) (9, 13) (9, 11) (9, 10) (9, 12) (9, 16) (10, 16) (10, 12) (11, 12) (12, 15) (13, 15). What is the maximum sum of the weights of three nodes? | ### 25 | [15, 20] | [5, 38] |
1228 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 17, weights of nodes are: [0, 4] [1, 3] [2, 4] [3, 4] [4, 5] [5, 6] [6, 6] [7, 10] [8, 5] [9, 3] [10, 3] [11, 9] [12, 5] [13, 5] [14, 10] [15, 7] [16, 3] [17, 10], and the edges are: (0, 11) (0, 1) (0, 17) (0, 14) (1, 13) (1, 9) (1, 5) (2, 9) (2, 10) (2, 4) (3, 12) (3, 8) (4, 13) (4, 10) (5, 15) (5, 6) (5, 13) (6, 8) (7, 8) (10, 17) (10, 12) (11, 12). What is the maximum sum of the weights of three nodes? | ### 14 | [15, 20] | [5, 38] |
1230 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 18, weights of nodes are: [0, 9] [1, 2] [2, 10] [3, 6] [4, 8] [5, 7] [6, 6] [7, 4] [8, 5] [9, 4] [10, 9] [11, 5] [12, 7] [13, 4] [14, 7] [15, 6] [16, 4] [17, 7] [18, 6], and the edges are: (0, 14) (0, 13) (1, 3) (2, 7) (3, 17) (3, 13) (4, 12) (4, 8) (4, 18) (5, 9) (6, 16) (6, 14) (12, 18) (12, 13) (14, 17). What is the maximum sum of the weights of three nodes? | ### 21 | [15, 20] | [5, 38] |
1232 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 17, weights of nodes are: [0, 10] [1, 7] [2, 6] [3, 2] [4, 5] [5, 7] [6, 4] [7, 8] [8, 2] [9, 6] [10, 10] [11, 2] [12, 1] [13, 6] [14, 9] [15, 2] [16, 1] [17, 7], and the edges are: (1, 4) (1, 7) (2, 4) (4, 16) (4, 7) (5, 10) (6, 11) (6, 8) (7, 15). What is the maximum sum of the weights of three nodes? | ### 20 | [15, 20] | [5, 38] |
1234 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 16, weights of nodes are: [0, 4] [1, 4] [2, 3] [3, 1] [4, 10] [5, 5] [6, 1] [7, 3] [8, 9] [9, 4] [10, 1] [11, 5] [12, 6] [13, 1] [14, 4] [15, 10] [16, 7], and the edges are: (0, 12) (0, 2) (0, 5) (1, 5) (1, 3) (1, 6) (2, 11) (3, 15) (3, 16) (5, 15) (6, 15) (6, 10) (8, 10) (9, 11) (10, 12) (10, 11) (10, 13) (11, 13) (12, 13) (13, 15). What is the maximum sum of the weights of three nodes? | ### 8 | [15, 20] | [5, 38] |
1236 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 16, weights of nodes are: [0, 6] [1, 2] [2, 6] [3, 2] [4, 9] [5, 3] [6, 8] [7, 3] [8, 5] [9, 6] [10, 9] [11, 6] [12, 9] [13, 5] [14, 8] [15, 4] [16, 9], and the edges are: (0, 11) (0, 14) (1, 15) (1, 3) (1, 4) (1, 5) (3, 7) (3, 6) (3, 16) (4, 9) (5, 12) (6, 16) (6, 11) (7, 15) (8, 9) (9, 14) (11, 16) (12, 13) (12, 15) (15, 16). What is the maximum sum of the weights of three nodes? | ### 23 | [15, 20] | [5, 38] |
1238 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 16, weights of nodes are: [0, 1] [1, 1] [2, 8] [3, 8] [4, 10] [5, 8] [6, 2] [7, 2] [8, 10] [9, 1] [10, 1] [11, 10] [12, 8] [13, 9] [14, 5] [15, 9] [16, 1], and the edges are: (0, 7) (0, 5) (0, 3) (1, 3) (2, 4) (2, 14) (3, 15) (3, 9) (3, 7) (4, 9) (4, 15) (4, 7) (5, 10) (6, 13) (6, 11) (7, 15) (7, 12) (7, 14) (9, 16) (11, 13). What is the maximum sum of the weights of three nodes? | ### 21 | [15, 20] | [5, 38] |
1240 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 18, weights of nodes are: [0, 1] [1, 4] [2, 4] [3, 6] [4, 4] [5, 6] [6, 8] [7, 8] [8, 2] [9, 5] [10, 4] [11, 9] [12, 5] [13, 2] [14, 3] [15, 8] [16, 2] [17, 4] [18, 7], and the edges are: (0, 11) (0, 16) (1, 10) (1, 12) (1, 2) (2, 12) (3, 5) (3, 17) (3, 12) (4, 5) (4, 11) (4, 8) (5, 15) (5, 12) (5, 9) (5, 11) (7, 10) (7, 9) (8, 14) (8, 12) (9, 16) (9, 17) (10, 14) (12, 16) (12, 15) (14, 16) (14, 17) (14, 15) (16, 18). What is the maximum sum of the weights of three nodes? | ### 19 | [15, 20] | [5, 38] |
1242 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 15, weights of nodes are: [0, 2] [1, 3] [2, 1] [3, 2] [4, 9] [5, 3] [6, 3] [7, 2] [8, 8] [9, 1] [10, 4] [11, 4] [12, 7] [13, 6] [14, 4] [15, 1], and the edges are: (1, 6) (1, 8) (2, 5) (2, 10) (3, 4) (4, 10) (4, 9) (5, 14) (5, 12) (5, 8) (6, 10) (6, 7) (6, 11) (7, 9) (7, 13) (7, 15) (9, 14) (10, 15) (11, 12) (11, 13) (12, 13) (12, 15). What is the maximum sum of the weights of three nodes? | ### 17 | [15, 20] | [5, 38] |
1244 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 19, weights of nodes are: [0, 1] [1, 1] [2, 3] [3, 7] [4, 1] [5, 2] [6, 2] [7, 4] [8, 1] [9, 3] [10, 8] [11, 5] [12, 7] [13, 5] [14, 6] [15, 3] [16, 8] [17, 5] [18, 5] [19, 1], and the edges are: (0, 16) (0, 17) (1, 8) (1, 6) (1, 14) (1, 19) (1, 4) (2, 15) (2, 16) (3, 8) (4, 10) (4, 12) (4, 14) (4, 5) (5, 13) (5, 18) (6, 9) (6, 14) (6, 10) (6, 18) (7, 8) (7, 19) (8, 12) (8, 15) (9, 17) (9, 16) (10, 19) (10, 18) (11, 17) (11, 13) (11, 18) (12, 19) (12, 16) (13, 18) (14, 17) (14, 18) (16, 17) (18, 19). What is the maximum sum of the weights of three nodes? | ### 16 | [15, 20] | [5, 38] |
1246 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 18, weights of nodes are: [0, 7] [1, 3] [2, 8] [3, 7] [4, 8] [5, 8] [6, 9] [7, 3] [8, 2] [9, 3] [10, 8] [11, 3] [12, 2] [13, 6] [14, 5] [15, 2] [16, 2] [17, 3] [18, 5], and the edges are: (0, 5) (0, 15) (0, 6) (0, 11) (1, 8) (1, 6) (1, 5) (2, 10) (2, 8) (2, 16) (2, 6) (3, 8) (3, 9) (4, 7) (4, 13) (4, 18) (5, 16) (5, 18) (6, 8) (6, 10) (6, 16) (7, 9) (7, 11) (8, 12) (8, 10) (8, 15) (9, 12) (9, 10) (9, 11) (9, 14) (11, 16) (13, 17) (16, 17). What is the maximum sum of the weights of three nodes? | ### 25 | [15, 20] | [5, 38] |
1248 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 14, weights of nodes are: [0, 7] [1, 6] [2, 2] [3, 7] [4, 1] [5, 8] [6, 3] [7, 6] [8, 9] [9, 1] [10, 10] [11, 5] [12, 7] [13, 1] [14, 10], and the edges are: (0, 12) (0, 4) (0, 2) (1, 4) (1, 2) (1, 12) (2, 8) (5, 13) (5, 6) (5, 12) (12, 13). What is the maximum sum of the weights of three nodes? | ### 16 | [15, 20] | [5, 38] |
1250 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 18, weights of nodes are: [0, 1] [1, 7] [2, 9] [3, 7] [4, 5] [5, 2] [6, 6] [7, 2] [8, 6] [9, 6] [10, 5] [11, 2] [12, 1] [13, 2] [14, 6] [15, 9] [16, 1] [17, 10] [18, 3], and the edges are: (0, 14) (0, 18) (1, 8) (1, 5) (2, 16) (2, 11) (3, 8) (3, 15) (3, 14) (4, 7) (4, 14) (4, 5) (5, 18) (6, 7) (6, 15) (6, 12) (8, 14) (8, 18) (9, 10) (9, 15) (10, 15) (11, 18) (11, 12) (11, 15) (13, 18) (14, 16) (16, 17). What is the maximum sum of the weights of three nodes? | ### 20 | [15, 20] | [5, 38] |
1252 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 15, weights of nodes are: [0, 5] [1, 1] [2, 2] [3, 3] [4, 6] [5, 4] [6, 6] [7, 7] [8, 3] [9, 4] [10, 3] [11, 8] [12, 2] [13, 3] [14, 8] [15, 8], and the edges are: (0, 1) (0, 12) (0, 14) (0, 3) (1, 8) (2, 7) (2, 9) (2, 12) (3, 14) (3, 13) (3, 15) (4, 6) (4, 13) (5, 10) (5, 8) (6, 15) (7, 15) (7, 10) (7, 11) (8, 10) (10, 14) (10, 11) (10, 13). What is the maximum sum of the weights of three nodes? | ### 18 | [15, 20] | [5, 38] |
1254 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 17, weights of nodes are: [0, 10] [1, 4] [2, 4] [3, 10] [4, 3] [5, 9] [6, 1] [7, 2] [8, 7] [9, 5] [10, 7] [11, 3] [12, 1] [13, 4] [14, 3] [15, 3] [16, 2] [17, 1], and the edges are: (0, 15) (0, 5) (0, 17) (1, 15) (1, 2) (1, 7) (2, 14) (2, 12) (2, 13) (4, 15) (4, 9) (4, 7) (4, 16) (5, 7) (5, 15) (6, 15) (8, 12) (9, 16) (10, 14) (12, 14). What is the maximum sum of the weights of three nodes? | ### 22 | [15, 20] | [5, 38] |
1256 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 19, weights of nodes are: [0, 3] [1, 2] [2, 3] [3, 5] [4, 4] [5, 1] [6, 8] [7, 5] [8, 9] [9, 9] [10, 3] [11, 6] [12, 5] [13, 8] [14, 8] [15, 3] [16, 1] [17, 10] [18, 9] [19, 2], and the edges are: (0, 7) (0, 6) (1, 4) (1, 18) (1, 14) (2, 17) (2, 15) (2, 5) (3, 14) (3, 5) (3, 15) (4, 9) (5, 18) (5, 19) (5, 6) (5, 7) (6, 14) (6, 17) (7, 15) (7, 13) (7, 17) (8, 19) (8, 15) (9, 11) (9, 10) (10, 11) (10, 15) (10, 12) (12, 14) (15, 18) (17, 19). What is the maximum sum of the weights of three nodes? | ### 18 | [15, 20] | [5, 38] |
1258 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 18, weights of nodes are: [0, 10] [1, 2] [2, 4] [3, 8] [4, 7] [5, 10] [6, 4] [7, 8] [8, 9] [9, 6] [10, 7] [11, 5] [12, 7] [13, 9] [14, 1] [15, 9] [16, 8] [17, 7] [18, 9], and the edges are: (0, 18) (1, 4) (2, 11) (3, 7) (5, 9) (7, 18) (7, 16) (7, 14) (8, 12) (9, 12) (12, 15) (13, 16) (16, 18). What is the maximum sum of the weights of three nodes? | ### 25 | [15, 20] | [5, 38] |
1260 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 19, weights of nodes are: [0, 9] [1, 4] [2, 1] [3, 9] [4, 1] [5, 6] [6, 5] [7, 2] [8, 5] [9, 6] [10, 8] [11, 5] [12, 7] [13, 1] [14, 8] [15, 4] [16, 10] [17, 2] [18, 10] [19, 5], and the edges are: (0, 19) (1, 10) (1, 19) (1, 5) (1, 16) (2, 11) (2, 19) (2, 4) (3, 4) (3, 8) (3, 13) (4, 17) (4, 8) (5, 9) (5, 14) (5, 12) (6, 13) (6, 11) (7, 18) (7, 17) (7, 11) (7, 8) (8, 10) (8, 17) (9, 18) (10, 18) (10, 15) (10, 16) (11, 16) (12, 16) (12, 18) (12, 14) (12, 19) (13, 14) (15, 16). What is the maximum sum of the weights of three nodes? | ### 22 | [15, 20] | [5, 38] |
1262 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 19, weights of nodes are: [0, 10] [1, 1] [2, 8] [3, 6] [4, 4] [5, 8] [6, 3] [7, 8] [8, 9] [9, 9] [10, 8] [11, 3] [12, 9] [13, 4] [14, 9] [15, 1] [16, 5] [17, 5] [18, 2] [19, 1], and the edges are: (0, 3) (0, 6) (1, 11) (1, 3) (1, 10) (1, 4) (1, 13) (2, 6) (2, 14) (3, 5) (3, 7) (3, 9) (4, 5) (5, 12) (6, 12) (7, 11) (7, 19) (8, 19) (8, 12) (8, 11) (8, 17) (10, 14) (10, 19) (12, 18) (12, 17) (15, 17) (16, 19) (17, 19). What is the maximum sum of the weights of three nodes? | ### 23 | [15, 20] | [5, 38] |
1264 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 14, weights of nodes are: [0, 5] [1, 6] [2, 9] [3, 7] [4, 9] [5, 8] [6, 4] [7, 4] [8, 10] [9, 9] [10, 9] [11, 4] [12, 5] [13, 3] [14, 8], and the edges are: (0, 12) (0, 10) (1, 9) (1, 8) (1, 12) (1, 13) (1, 3) (2, 11) (3, 4) (3, 5) (3, 9) (4, 6) (5, 8) (5, 9) (6, 10) (6, 13) (8, 13) (8, 14). What is the maximum sum of the weights of three nodes? | ### 24 | [15, 20] | [5, 38] |
1266 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 17, weights of nodes are: [0, 1] [1, 3] [2, 1] [3, 2] [4, 7] [5, 1] [6, 6] [7, 2] [8, 2] [9, 2] [10, 8] [11, 10] [12, 2] [13, 4] [14, 10] [15, 3] [16, 3] [17, 3], and the edges are: (0, 6) (0, 1) (0, 7) (0, 12) (1, 9) (4, 6) (5, 7) (6, 12) (6, 14) (10, 15) (14, 17). What is the maximum sum of the weights of three nodes? | ### 9 | [15, 20] | [5, 38] |
1268 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 15, weights of nodes are: [0, 2] [1, 7] [2, 7] [3, 1] [4, 1] [5, 7] [6, 8] [7, 8] [8, 5] [9, 3] [10, 2] [11, 3] [12, 8] [13, 7] [14, 7] [15, 6], and the edges are: (0, 9) (1, 7) (1, 5) (1, 10) (1, 4) (1, 15) (2, 7) (2, 15) (3, 13) (3, 8) (3, 12) (3, 6) (3, 11) (4, 9) (4, 7) (4, 11) (6, 9) (6, 8) (8, 11) (8, 15) (9, 13) (10, 14) (10, 13) (11, 14). What is the maximum sum of the weights of three nodes? | ### 16 | [15, 20] | [5, 38] |
1270 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 18, weights of nodes are: [0, 5] [1, 5] [2, 2] [3, 6] [4, 8] [5, 9] [6, 3] [7, 10] [8, 9] [9, 6] [10, 8] [11, 7] [12, 3] [13, 10] [14, 2] [15, 2] [16, 4] [17, 7] [18, 6], and the edges are: (0, 2) (0, 13) (1, 4) (1, 15) (1, 11) (2, 9) (2, 5) (2, 7) (3, 15) (3, 9) (4, 8) (4, 10) (4, 16) (4, 7) (4, 13) (4, 6) (5, 12) (5, 17) (6, 13) (7, 18) (8, 17) (8, 11) (8, 16) (9, 10) (11, 15) (12, 18) (13, 16) (13, 17) (15, 17). What is the maximum sum of the weights of three nodes? | ### 22 | [15, 20] | [5, 38] |
1272 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 17, weights of nodes are: [0, 6] [1, 5] [2, 1] [3, 8] [4, 6] [5, 9] [6, 7] [7, 4] [8, 10] [9, 2] [10, 2] [11, 2] [12, 2] [13, 4] [14, 5] [15, 10] [16, 3] [17, 9], and the edges are: (0, 4) (0, 11) (1, 6) (2, 14) (3, 6) (3, 15) (5, 15) (5, 8) (6, 15) (7, 13) (8, 11) (8, 13) (9, 10) (12, 15) (15, 17). What is the maximum sum of the weights of three nodes? | ### 25 | [15, 20] | [5, 38] |
1274 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 14, weights of nodes are: [0, 2] [1, 1] [2, 9] [3, 2] [4, 6] [5, 4] [6, 7] [7, 6] [8, 7] [9, 1] [10, 7] [11, 5] [12, 6] [13, 5] [14, 7], and the edges are: (0, 1) (1, 7) (1, 10) (2, 3) (2, 8) (2, 13) (3, 14) (4, 11) (4, 5) (4, 12) (5, 6) (5, 12) (6, 14). What is the maximum sum of the weights of three nodes? | ### 16 | [15, 20] | [5, 38] |
1276 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 17, weights of nodes are: [0, 10] [1, 10] [2, 10] [3, 7] [4, 3] [5, 4] [6, 8] [7, 3] [8, 8] [9, 4] [10, 4] [11, 5] [12, 1] [13, 4] [14, 6] [15, 9] [16, 1] [17, 2], and the edges are: (0, 7) (0, 14) (0, 12) (0, 15) (1, 5) (1, 14) (2, 3) (2, 13) (2, 15) (2, 7) (5, 16) (5, 12) (6, 7) (6, 16) (7, 16) (8, 12) (10, 12) (10, 13) (11, 16) (11, 15) (12, 13) (13, 17) (14, 16). What is the maximum sum of the weights of three nodes? | ### 12 | [15, 20] | [5, 38] |
1278 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 14, weights of nodes are: [0, 7] [1, 4] [2, 2] [3, 1] [4, 7] [5, 10] [6, 5] [7, 2] [8, 5] [9, 3] [10, 7] [11, 7] [12, 9] [13, 1] [14, 8], and the edges are: (0, 13) (0, 2) (0, 11) (0, 9) (1, 6) (3, 7) (3, 5) (3, 9) (4, 12) (5, 7) (6, 10) (10, 11) (11, 13) (11, 12). What is the maximum sum of the weights of three nodes? | ### 15 | [15, 20] | [5, 38] |
1280 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 17, weights of nodes are: [0, 2] [1, 1] [2, 10] [3, 2] [4, 8] [5, 2] [6, 1] [7, 6] [8, 4] [9, 7] [10, 3] [11, 9] [12, 5] [13, 5] [14, 8] [15, 5] [16, 10] [17, 3], and the edges are: (0, 9) (0, 14) (0, 10) (0, 15) (1, 6) (1, 14) (2, 3) (2, 7) (2, 17) (2, 6) (3, 8) (3, 6) (3, 16) (4, 10) (5, 6) (5, 7) (5, 10) (6, 17) (6, 8) (7, 13) (7, 15) (7, 11) (7, 8) (8, 12) (8, 9) (9, 17) (10, 12) (11, 12) (14, 15) (16, 17). What is the maximum sum of the weights of three nodes? | ### 15 | [15, 20] | [5, 38] |
1282 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 18, weights of nodes are: [0, 4] [1, 4] [2, 8] [3, 3] [4, 3] [5, 8] [6, 9] [7, 10] [8, 10] [9, 9] [10, 6] [11, 6] [12, 7] [13, 6] [14, 4] [15, 9] [16, 7] [17, 6] [18, 5], and the edges are: (0, 18) (0, 17) (0, 14) (0, 4) (1, 4) (1, 15) (2, 16) (2, 7) (2, 17) (2, 13) (4, 9) (4, 7) (5, 18) (5, 11) (5, 17) (7, 18) (7, 13) (8, 12) (8, 18) (8, 9) (8, 13) (10, 12) (11, 13) (12, 18) (13, 16) (13, 15) (14, 18) (14, 17). What is the maximum sum of the weights of three nodes? | ### 24 | [15, 20] | [5, 38] |
1284 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 16, weights of nodes are: [0, 2] [1, 4] [2, 6] [3, 4] [4, 3] [5, 1] [6, 7] [7, 7] [8, 3] [9, 2] [10, 10] [11, 8] [12, 8] [13, 2] [14, 3] [15, 6] [16, 6], and the edges are: (0, 8) (1, 7) (1, 15) (1, 11) (1, 5) (2, 5) (2, 13) (2, 12) (2, 3) (2, 6) (3, 12) (3, 10) (3, 4) (4, 6) (5, 11) (5, 15) (5, 8) (6, 11) (6, 8) (6, 15) (8, 11) (8, 13) (9, 15) (9, 12) (10, 16) (12, 16). What is the maximum sum of the weights of three nodes? | ### 18 | [15, 20] | [5, 38] |
1286 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 18, weights of nodes are: [0, 4] [1, 10] [2, 7] [3, 9] [4, 8] [5, 3] [6, 7] [7, 7] [8, 6] [9, 4] [10, 3] [11, 3] [12, 10] [13, 4] [14, 6] [15, 5] [16, 7] [17, 9] [18, 3], and the edges are: (0, 3) (0, 5) (0, 14) (0, 6) (0, 12) (1, 10) (1, 14) (2, 17) (2, 9) (2, 3) (2, 13) (2, 7) (3, 16) (3, 10) (3, 12) (4, 15) (4, 6) (4, 8) (4, 14) (5, 18) (6, 13) (6, 7) (8, 16) (9, 14) (9, 13) (10, 18) (11, 15) (11, 14) (12, 13) (13, 17) (13, 15) (15, 18) (15, 17) (16, 18). What is the maximum sum of the weights of three nodes? | ### 23 | [15, 20] | [5, 38] |
1288 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 17, weights of nodes are: [0, 8] [1, 3] [2, 3] [3, 2] [4, 3] [5, 2] [6, 4] [7, 5] [8, 9] [9, 9] [10, 7] [11, 9] [12, 3] [13, 7] [14, 3] [15, 6] [16, 6] [17, 8], and the edges are: (0, 9) (0, 4) (0, 17) (0, 15) (0, 7) (2, 10) (2, 5) (2, 17) (2, 15) (4, 17) (5, 13) (5, 8) (5, 9) (5, 14) (5, 11) (6, 17) (6, 14) (9, 15) (9, 11) (11, 14) (15, 17). What is the maximum sum of the weights of three nodes? | ### 23 | [15, 20] | [5, 38] |
1290 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 18, weights of nodes are: [0, 4] [1, 10] [2, 5] [3, 8] [4, 2] [5, 5] [6, 4] [7, 3] [8, 6] [9, 10] [10, 8] [11, 10] [12, 2] [13, 5] [14, 4] [15, 7] [16, 3] [17, 2] [18, 8], and the edges are: (0, 9) (0, 4) (1, 15) (1, 12) (1, 11) (1, 2) (1, 4) (2, 4) (2, 18) (2, 11) (2, 10) (2, 6) (3, 16) (3, 18) (3, 17) (3, 12) (4, 18) (4, 10) (4, 7) (5, 10) (5, 9) (5, 12) (7, 10) (7, 9) (8, 13) (8, 12) (9, 10) (10, 18) (11, 14) (12, 16) (14, 18) (15, 16) (16, 18). What is the maximum sum of the weights of three nodes? | ### 25 | [15, 20] | [5, 38] |
1292 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 18, weights of nodes are: [0, 1] [1, 4] [2, 10] [3, 2] [4, 9] [5, 6] [6, 2] [7, 4] [8, 9] [9, 3] [10, 4] [11, 4] [12, 6] [13, 9] [14, 3] [15, 6] [16, 6] [17, 5] [18, 9], and the edges are: (0, 16) (0, 5) (0, 4) (0, 1) (0, 14) (1, 5) (1, 12) (1, 3) (1, 2) (1, 18) (2, 14) (2, 6) (3, 14) (3, 8) (4, 8) (4, 7) (5, 15) (5, 7) (5, 14) (6, 11) (6, 17) (6, 16) (7, 13) (7, 12) (7, 14) (8, 14) (10, 12) (12, 18) (13, 17) (13, 18) (13, 14). What is the maximum sum of the weights of three nodes? | ### 19 | [15, 20] | [5, 38] |
1294 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 18, weights of nodes are: [0, 5] [1, 10] [2, 5] [3, 6] [4, 1] [5, 8] [6, 4] [7, 9] [8, 9] [9, 1] [10, 9] [11, 4] [12, 8] [13, 1] [14, 3] [15, 8] [16, 5] [17, 7] [18, 4], and the edges are: (1, 14) (6, 17) (7, 13) (7, 10) (8, 11) (8, 18) (10, 15) (11, 18) (13, 16) (14, 18). What is the maximum sum of the weights of three nodes? | ### 17 | [15, 20] | [5, 38] |
1296 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 15, weights of nodes are: [0, 5] [1, 7] [2, 10] [3, 3] [4, 3] [5, 7] [6, 9] [7, 7] [8, 2] [9, 4] [10, 4] [11, 6] [12, 1] [13, 2] [14, 8] [15, 1], and the edges are: (0, 6) (0, 12) (1, 12) (2, 8) (2, 6) (2, 12) (2, 3) (3, 9) (4, 12) (5, 14) (5, 9) (6, 8) (6, 14) (7, 15) (7, 9) (8, 11) (8, 15) (8, 14) (9, 13). What is the maximum sum of the weights of three nodes? | ### 21 | [15, 20] | [5, 38] |
1298 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 15, weights of nodes are: [0, 7] [1, 2] [2, 6] [3, 2] [4, 2] [5, 3] [6, 4] [7, 6] [8, 2] [9, 10] [10, 4] [11, 3] [12, 9] [13, 2] [14, 6] [15, 4], and the edges are: (0, 5) (0, 13) (0, 8) (2, 15) (3, 11) (3, 15) (3, 8) (4, 14) (4, 11) (5, 13) (5, 15) (5, 12) (6, 7) (8, 12) (8, 11) (8, 15) (11, 14) (11, 12). What is the maximum sum of the weights of three nodes? | ### 14 | [15, 20] | [5, 38] |
1300 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 14, weights of nodes are: [0, 10] [1, 7] [2, 7] [3, 8] [4, 5] [5, 9] [6, 1] [7, 10] [8, 6] [9, 1] [10, 2] [11, 10] [12, 1] [13, 6] [14, 4], and the edges are: (0, 1) (0, 10) (1, 11) (1, 12) (2, 5) (2, 6) (4, 9) (6, 7) (6, 12) (8, 14) (9, 12) (9, 10) (9, 11) (10, 11) (10, 12) (10, 14) (10, 13) (11, 12). What is the maximum sum of the weights of three nodes? | ### 18 | [15, 20] | [5, 38] |
1302 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 15, weights of nodes are: [0, 4] [1, 9] [2, 6] [3, 3] [4, 7] [5, 10] [6, 9] [7, 6] [8, 9] [9, 2] [10, 9] [11, 5] [12, 9] [13, 9] [14, 7] [15, 8], and the edges are: (0, 3) (0, 7) (0, 11) (0, 1) (1, 11) (2, 9) (3, 5) (4, 12) (4, 8) (4, 15) (4, 10) (4, 7) (4, 9) (5, 14) (5, 8) (6, 8) (7, 11) (7, 13) (8, 12) (9, 12). What is the maximum sum of the weights of three nodes? | ### 25 | [15, 20] | [5, 38] |
1304 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 14, weights of nodes are: [0, 1] [1, 6] [2, 6] [3, 2] [4, 3] [5, 1] [6, 8] [7, 10] [8, 10] [9, 6] [10, 5] [11, 3] [12, 3] [13, 1] [14, 4], and the edges are: (0, 2) (0, 5) (0, 12) (1, 13) (1, 4) (1, 3) (2, 12) (3, 4) (3, 11) (4, 8) (4, 12) (4, 9) (5, 8) (5, 12) (6, 7) (6, 14) (10, 14). What is the maximum sum of the weights of three nodes? | ### 11 | [15, 20] | [5, 38] |
1306 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 18, weights of nodes are: [0, 4] [1, 6] [2, 10] [3, 4] [4, 4] [5, 4] [6, 5] [7, 7] [8, 6] [9, 5] [10, 1] [11, 4] [12, 9] [13, 8] [14, 8] [15, 7] [16, 7] [17, 6] [18, 2], and the edges are: (0, 1) (0, 11) (0, 9) (1, 13) (2, 11) (2, 17) (2, 14) (3, 14) (3, 15) (4, 17) (4, 11) (5, 14) (5, 12) (6, 16) (6, 8) (6, 15) (6, 10) (8, 15) (8, 11) (8, 16) (9, 15) (10, 17) (10, 15) (10, 18) (11, 14) (11, 16) (11, 18) (12, 15) (12, 14) (14, 18) (16, 18). What is the maximum sum of the weights of three nodes? | ### 22 | [15, 20] | [5, 38] |
1308 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 14, weights of nodes are: [0, 1] [1, 1] [2, 10] [3, 9] [4, 7] [5, 7] [6, 8] [7, 3] [8, 1] [9, 6] [10, 7] [11, 9] [12, 4] [13, 10] [14, 2], and the edges are: (0, 7) (0, 14) (0, 1) (0, 8) (4, 14) (4, 12) (4, 9) (6, 11) (6, 13) (6, 8) (7, 13) (8, 9) (8, 13) (10, 14). What is the maximum sum of the weights of three nodes? | ### 19 | [15, 20] | [5, 38] |
1310 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 14, weights of nodes are: [0, 7] [1, 3] [2, 3] [3, 4] [4, 10] [5, 9] [6, 8] [7, 3] [8, 5] [9, 9] [10, 8] [11, 5] [12, 4] [13, 3] [14, 7], and the edges are: (0, 14) (1, 3) (1, 11) (1, 8) (2, 5) (4, 10) (5, 8) (6, 7) (6, 13) (6, 11) (7, 9) (7, 11) (7, 10) (8, 13) (8, 14) (8, 12) (9, 11) (9, 13) (10, 14) (12, 13). What is the maximum sum of the weights of three nodes? | ### 17 | [15, 20] | [5, 38] |
1312 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 18, weights of nodes are: [0, 1] [1, 9] [2, 5] [3, 1] [4, 2] [5, 1] [6, 5] [7, 8] [8, 2] [9, 9] [10, 3] [11, 6] [12, 5] [13, 3] [14, 8] [15, 8] [16, 1] [17, 2] [18, 1], and the edges are: (0, 6) (0, 15) (1, 8) (1, 15) (1, 6) (1, 16) (1, 13) (4, 5) (5, 8) (5, 18) (5, 12) (6, 9) (8, 13) (9, 15) (9, 14) (11, 12) (11, 13) (12, 14) (15, 18). What is the maximum sum of the weights of three nodes? | ### 14 | [15, 20] | [5, 38] |
1314 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 15, weights of nodes are: [0, 10] [1, 10] [2, 6] [3, 4] [4, 1] [5, 2] [6, 6] [7, 2] [8, 8] [9, 8] [10, 4] [11, 8] [12, 5] [13, 5] [14, 10] [15, 5], and the edges are: (0, 13) (0, 12) (0, 1) (0, 6) (1, 6) (2, 3) (2, 7) (2, 13) (4, 7) (4, 10) (5, 9) (5, 15) (7, 12) (9, 11) (10, 13). What is the maximum sum of the weights of three nodes? | ### 26 | [15, 20] | [5, 38] |
1316 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 18, weights of nodes are: [0, 7] [1, 2] [2, 9] [3, 1] [4, 1] [5, 6] [6, 2] [7, 9] [8, 1] [9, 4] [10, 9] [11, 5] [12, 5] [13, 4] [14, 8] [15, 9] [16, 9] [17, 8] [18, 6], and the edges are: (0, 1) (0, 5) (0, 10) (0, 3) (1, 15) (1, 4) (2, 5) (2, 8) (2, 7) (3, 16) (3, 13) (3, 18) (3, 12) (4, 12) (4, 7) (4, 17) (4, 14) (5, 9) (6, 12) (6, 15) (6, 7) (7, 13) (7, 18) (8, 18) (8, 14) (8, 17) (12, 13) (12, 15) (13, 17) (15, 17). What is the maximum sum of the weights of three nodes? | ### 16 | [15, 20] | [5, 38] |
1318 | Find the maximum sum of the weights of three interconnected nodes. In an undirected graph, [i, k] means that node i has the weight k. (i,j) means that node i and node j are connected with an undirected edge. Given a graph, you need to output the maximum sum of the weights of three interconnected nodes. Q: The nodes are numbered from 0 to 15, weights of nodes are: [0, 8] [1, 4] [2, 9] [3, 2] [4, 6] [5, 3] [6, 8] [7, 3] [8, 5] [9, 7] [10, 10] [11, 8] [12, 2] [13, 3] [14, 2] [15, 3], and the edges are: (0, 10) (0, 11) (1, 12) (1, 2) (3, 6) (3, 9) (3, 15) (4, 11) (4, 5) (4, 8) (5, 14) (5, 6) (6, 8) (6, 9) (6, 11) (8, 11) (9, 14) (9, 13) (10, 15) (11, 14). What is the maximum sum of the weights of three nodes? | ### 21 | [15, 20] | [5, 38] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.