index
stringlengths 1
4
| input_prompt
stringlengths 489
1.07k
| answer
stringclasses 24
values | node_range
stringclasses 5
values | edge_range
stringclasses 5
values |
|---|---|---|---|---|
1320 | 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, 9] [3, 10] [4, 7] [5, 9] [6, 6] [7, 7] [8, 10] [9, 7] [10, 7] [11, 3] [12, 3] [13, 5] [14, 5], and the edges are: (0, 13) (0, 1) (1, 13) (1, 9) (1, 11) (2, 14) (2, 7) (3, 6) (3, 4) (3, 9) (4, 12) (4, 9) (4, 14) (4, 7) (6, 11) (6, 7) (7, 14) (9, 14) (10, 13) (10, 14). What is the maximum sum of the weights of three nodes? | ### 24 | [15, 20] | [5, 38] |
1322 | 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, 5] [2, 1] [3, 10] [4, 5] [5, 3] [6, 9] [7, 6] [8, 1] [9, 9] [10, 2] [11, 6] [12, 10] [13, 9] [14, 3] [15, 4] [16, 3] [17, 9] [18, 8], and the edges are: (0, 16) (1, 5) (1, 15) (2, 6) (2, 10) (5, 9) (6, 16) (6, 13) (6, 7) (6, 12) (7, 12) (7, 17) (8, 18) (9, 17) (9, 18) (12, 13) (14, 15) (14, 18) (16, 18). What is the maximum sum of the weights of three nodes? | ### 28 | [15, 20] | [5, 38] |
1324 | 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, 9] [2, 6] [3, 10] [4, 2] [5, 3] [6, 8] [7, 2] [8, 2] [9, 9] [10, 10] [11, 7] [12, 3] [13, 4] [14, 3] [15, 5], and the edges are: (0, 13) (0, 10) (1, 15) (1, 3) (1, 13) (1, 4) (2, 8) (2, 5) (2, 10) (2, 7) (2, 12) (2, 15) (3, 4) (3, 8) (3, 11) (4, 15) (4, 10) (5, 13) (6, 7). What is the maximum sum of the weights of three nodes? | ### 21 | [15, 20] | [5, 38] |
1326 | 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, 7] [3, 10] [4, 9] [5, 1] [6, 4] [7, 5] [8, 8] [9, 9] [10, 4] [11, 5] [12, 2] [13, 4] [14, 4] [15, 2] [16, 4] [17, 6] [18, 5], and the edges are: (0, 10) (1, 10) (1, 5) (1, 14) (2, 3) (3, 6) (3, 16) (3, 10) (3, 8) (4, 13) (4, 16) (5, 11) (5, 14) (6, 8) (6, 16) (6, 14) (6, 15) (7, 12) (9, 11) (9, 14) (9, 17) (10, 17) (11, 15) (11, 14) (12, 17) (12, 18) (14, 16). What is the maximum sum of the weights of three nodes? | ### 22 | [15, 20] | [5, 38] |
1328 | 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, 9] [2, 6] [3, 5] [4, 2] [5, 1] [6, 9] [7, 3] [8, 10] [9, 2] [10, 10] [11, 1] [12, 7] [13, 3] [14, 2] [15, 8] [16, 9] [17, 1] [18, 10], and the edges are: (0, 12) (0, 10) (0, 6) (0, 11) (1, 4) (1, 11) (1, 10) (1, 7) (2, 3) (3, 7) (3, 4) (3, 17) (4, 14) (4, 11) (4, 8) (4, 9) (5, 9) (5, 12) (5, 6) (6, 15) (6, 17) (6, 11) (6, 9) (7, 14) (8, 16) (9, 15) (9, 10) (10, 11) (11, 18) (12, 14) (12, 13) (13, 17) (14, 16) (15, 18). What is the maximum sum of the weights of three nodes? | ### 21 | [15, 20] | [5, 38] |
1330 | 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, 3] [3, 10] [4, 3] [5, 8] [6, 8] [7, 5] [8, 7] [9, 4] [10, 7] [11, 7] [12, 8] [13, 10] [14, 1] [15, 7] [16, 3], and the edges are: (0, 3) (0, 13) (0, 12) (0, 4) (1, 4) (1, 5) (2, 5) (2, 9) (3, 14) (4, 5) (4, 6) (5, 7) (6, 16) (6, 10) (7, 16) (7, 8) (8, 13) (10, 15) (12, 15) (13, 14) (13, 16). What is the maximum sum of the weights of three nodes? | ### 12 | [15, 20] | [5, 38] |
1332 | 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, 10] [2, 4] [3, 3] [4, 9] [5, 5] [6, 4] [7, 9] [8, 10] [9, 6] [10, 7] [11, 3] [12, 5] [13, 2] [14, 5] [15, 10] [16, 6] [17, 3] [18, 3] [19, 7], and the edges are: (0, 17) (0, 6) (1, 3) (4, 13) (5, 19) (5, 17) (6, 17) (9, 12) (9, 10) (12, 14) (13, 18). What is the maximum sum of the weights of three nodes? | ### 12 | [15, 20] | [5, 38] |
1334 | 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, 7] [1, 4] [2, 3] [3, 3] [4, 5] [5, 3] [6, 8] [7, 2] [8, 10] [9, 4] [10, 2] [11, 10] [12, 3] [13, 3] [14, 10] [15, 7] [16, 9] [17, 3] [18, 7] [19, 10], and the edges are: (0, 12) (0, 6) (0, 15) (0, 13) (1, 9) (2, 7) (3, 14) (3, 13) (3, 19) (3, 6) (4, 9) (4, 10) (4, 13) (4, 8) (4, 11) (4, 15) (5, 10) (5, 19) (6, 16) (6, 15) (7, 16) (7, 10) (8, 17) (8, 10) (8, 11) (8, 13) (9, 15) (10, 14) (10, 11) (10, 13) (11, 14) (11, 18) (12, 15) (13, 16) (15, 18) (16, 17). What is the maximum sum of the weights of three nodes? | ### 25 | [15, 20] | [5, 38] |
1336 | 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, 5] [2, 7] [3, 2] [4, 6] [5, 1] [6, 4] [7, 8] [8, 8] [9, 7] [10, 10] [11, 10] [12, 5] [13, 6] [14, 7] [15, 9] [16, 7], and the edges are: (0, 3) (0, 5) (1, 13) (1, 15) (1, 7) (1, 2) (2, 6) (2, 16) (2, 10) (2, 11) (3, 9) (3, 13) (3, 6) (3, 11) (4, 13) (4, 6) (5, 9) (5, 12) (7, 8) (7, 12) (8, 15) (9, 15) (9, 13) (10, 11) (10, 12) (11, 13) (14, 16). What is the maximum sum of the weights of three nodes? | ### 27 | [15, 20] | [5, 38] |
1338 | 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, 7] [2, 10] [3, 7] [4, 7] [5, 5] [6, 2] [7, 10] [8, 3] [9, 7] [10, 4] [11, 3] [12, 2] [13, 3] [14, 4] [15, 9] [16, 7] [17, 8] [18, 4], and the edges are: (1, 10) (1, 5) (1, 15) (2, 8) (2, 10) (2, 5) (4, 14) (4, 6) (4, 13) (5, 15) (5, 12) (5, 16) (6, 10) (6, 15) (6, 11) (6, 18) (7, 14) (7, 17) (9, 13) (10, 18) (10, 14) (10, 16) (12, 13). What is the maximum sum of the weights of three nodes? | ### 21 | [15, 20] | [5, 38] |
1340 | 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, 8] [2, 7] [3, 7] [4, 4] [5, 4] [6, 2] [7, 2] [8, 5] [9, 4] [10, 5] [11, 10] [12, 3] [13, 3] [14, 9] [15, 2], and the edges are: (0, 5) (0, 9) (1, 15) (1, 7) (2, 7) (2, 14) (2, 12) (4, 10) (4, 6) (5, 8) (6, 14) (6, 12) (9, 12) (10, 13) (10, 11) (12, 15) (12, 13) (13, 15). What is the maximum sum of the weights of three nodes? | ### 8 | [15, 20] | [5, 38] |
1342 | 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, 5] [2, 10] [3, 2] [4, 4] [5, 8] [6, 4] [7, 7] [8, 8] [9, 8] [10, 8] [11, 7] [12, 3] [13, 10] [14, 7] [15, 9] [16, 10] [17, 4], and the edges are: (0, 1) (1, 8) (1, 16) (2, 14) (3, 9) (3, 8) (3, 5) (3, 4) (4, 9) (5, 14) (5, 13) (5, 9) (7, 9) (7, 13) (7, 10) (7, 15) (10, 13) (11, 16) (12, 17) (15, 16). What is the maximum sum of the weights of three nodes? | ### 25 | [15, 20] | [5, 38] |
1344 | 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, 9] [2, 9] [3, 10] [4, 6] [5, 1] [6, 10] [7, 6] [8, 4] [9, 10] [10, 6] [11, 5] [12, 3] [13, 4] [14, 3] [15, 2] [16, 4] [17, 5], and the edges are: (0, 14) (0, 13) (2, 10) (2, 14) (4, 17) (4, 8) (5, 11) (5, 13) (6, 13) (6, 15) (6, 9) (8, 11) (8, 15) (10, 12) (13, 15). What is the maximum sum of the weights of three nodes? | ### 16 | [15, 20] | [5, 38] |
1346 | 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, 6] [1, 3] [2, 7] [3, 7] [4, 1] [5, 1] [6, 4] [7, 5] [8, 3] [9, 8] [10, 5] [11, 3] [12, 8] [13, 7] [14, 6] [15, 4], and the edges are: (0, 10) (0, 6) (1, 12) (1, 9) (1, 8) (2, 15) (2, 11) (2, 5) (2, 12) (3, 12) (3, 9) (3, 7) (3, 15) (5, 8) (8, 11) (9, 14) (9, 12) (10, 12) (10, 11). What is the maximum sum of the weights of three nodes? | ### 23 | [15, 20] | [5, 38] |
1348 | 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, 8] [1, 10] [2, 9] [3, 9] [4, 5] [5, 2] [6, 5] [7, 9] [8, 4] [9, 5] [10, 1] [11, 7] [12, 7] [13, 8] [14, 8], and the edges are: (0, 9) (0, 6) (1, 3) (1, 11) (1, 4) (3, 7) (4, 11) (5, 14) (6, 8) (11, 12). What is the maximum sum of the weights of three nodes? | ### 22 | [15, 20] | [5, 38] |
1350 | 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, 7] [1, 10] [2, 3] [3, 10] [4, 8] [5, 3] [6, 2] [7, 10] [8, 10] [9, 3] [10, 1] [11, 5] [12, 4] [13, 2] [14, 9] [15, 4] [16, 7] [17, 3] [18, 1] [19, 1], and the edges are: (0, 7) (0, 14) (0, 17) (0, 3) (0, 12) (0, 2) (1, 15) (2, 14) (4, 12) (5, 11) (5, 19) (6, 17) (7, 13) (8, 14) (9, 17) (11, 16) (11, 19) (13, 18). What is the maximum sum of the weights of three nodes? | ### 19 | [15, 20] | [5, 38] |
1352 | 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, 3] [1, 7] [2, 6] [3, 7] [4, 8] [5, 10] [6, 6] [7, 8] [8, 10] [9, 8] [10, 2] [11, 2] [12, 8] [13, 6] [14, 3] [15, 7] [16, 10] [17, 1], and the edges are: (1, 3) (1, 10) (1, 14) (1, 11) (2, 10) (2, 9) (3, 6) (3, 7) (5, 7) (5, 13) (6, 8) (6, 7) (7, 13) (7, 9) (9, 15) (9, 10) (11, 15) (12, 13) (12, 16). What is the maximum sum of the weights of three nodes? | ### 24 | [15, 20] | [5, 38] |
1354 | 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, 10] [3, 6] [4, 9] [5, 6] [6, 4] [7, 8] [8, 4] [9, 2] [10, 7] [11, 5] [12, 8] [13, 3] [14, 1], and the edges are: (0, 2) (1, 14) (3, 7) (3, 8) (3, 12) (3, 5) (4, 10) (5, 6) (6, 8) (6, 12) (7, 14) (8, 12) (9, 12). What is the maximum sum of the weights of three nodes? | ### 18 | [15, 20] | [5, 38] |
1356 | 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, 5] [2, 7] [3, 9] [4, 1] [5, 9] [6, 3] [7, 1] [8, 1] [9, 9] [10, 1] [11, 9] [12, 5] [13, 5] [14, 2] [15, 1] [16, 6], and the edges are: (0, 4) (0, 15) (1, 7) (1, 12) (1, 6) (2, 11) (2, 4) (3, 8) (4, 12) (5, 15) (8, 14) (8, 13) (12, 14) (13, 14) (14, 15) (14, 16). What is the maximum sum of the weights of three nodes? | ### 8 | [15, 20] | [5, 38] |
1358 | 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, 7] [1, 3] [2, 8] [3, 8] [4, 4] [5, 2] [6, 2] [7, 4] [8, 9] [9, 10] [10, 5] [11, 8] [12, 3] [13, 7] [14, 2] [15, 9] [16, 2] [17, 5], and the edges are: (0, 17) (0, 2) (0, 14) (2, 4) (3, 11) (4, 13) (5, 13) (5, 10) (5, 14) (8, 13) (8, 14) (8, 16) (8, 10) (9, 16) (10, 13) (13, 17). What is the maximum sum of the weights of three nodes? | ### 21 | [15, 20] | [5, 38] |
1600 | 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 21, weights of nodes are: [0, 4] [1, 1] [2, 3] [3, 6] [4, 4] [5, 9] [6, 5] [7, 6] [8, 8] [9, 7] [10, 6] [11, 10] [12, 8] [13, 9] [14, 1] [15, 9] [16, 4] [17, 9] [18, 2] [19, 9] [20, 1] [21, 8], and the edges are: (0, 3) (0, 5) (0, 7) (1, 12) (1, 10) (1, 9) (2, 5) (3, 17) (3, 21) (4, 18) (4, 21) (6, 13) (7, 17) (8, 21) (9, 18) (11, 15) (13, 14) (13, 17) (13, 19) (15, 16) (16, 17) (18, 21). What is the maximum sum of the weights of three nodes? | ### 14 | [20, 25] | [7, 60] |
1602 | 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, 7] [2, 1] [3, 3] [4, 4] [5, 2] [6, 4] [7, 3] [8, 10] [9, 8] [10, 6] [11, 7] [12, 5] [13, 5] [14, 3] [15, 8] [16, 9] [17, 3] [18, 2] [19, 8], and the edges are: (1, 13) (2, 4) (2, 8) (2, 7) (4, 7) (4, 15) (5, 15) (5, 11) (5, 16) (6, 18) (6, 17) (7, 11) (8, 14) (10, 15) (10, 19). What is the maximum sum of the weights of three nodes? | ### 8 | [20, 25] | [7, 60] |
1604 | 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 21, weights of nodes are: [0, 4] [1, 7] [2, 6] [3, 8] [4, 9] [5, 2] [6, 3] [7, 5] [8, 1] [9, 2] [10, 6] [11, 10] [12, 3] [13, 8] [14, 2] [15, 8] [16, 9] [17, 2] [18, 6] [19, 3] [20, 7] [21, 5], and the edges are: (1, 12) (1, 15) (1, 6) (1, 4) (2, 21) (2, 8) (3, 14) (3, 18) (4, 8) (4, 12) (4, 13) (5, 10) (5, 21) (5, 11) (6, 20) (8, 15) (9, 19) (9, 20) (10, 14) (11, 13) (12, 21) (12, 20) (12, 17) (13, 19) (13, 17) (13, 18) (14, 16) (15, 20) (17, 18) (18, 19) (19, 20). What is the maximum sum of the weights of three nodes? | ### 19 | [20, 25] | [7, 60] |
1606 | 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 23, weights of nodes are: [0, 8] [1, 7] [2, 8] [3, 6] [4, 8] [5, 9] [6, 2] [7, 1] [8, 6] [9, 2] [10, 3] [11, 3] [12, 8] [13, 9] [14, 2] [15, 8] [16, 10] [17, 7] [18, 3] [19, 8] [20, 1] [21, 5] [22, 7] [23, 9], and the edges are: (0, 22) (0, 4) (0, 7) (1, 16) (1, 15) (1, 18) (1, 21) (2, 18) (2, 6) (2, 5) (2, 10) (2, 21) (3, 13) (3, 4) (3, 23) (3, 21) (3, 5) (4, 18) (4, 19) (4, 21) (5, 9) (6, 7) (6, 20) (6, 12) (6, 15) (6, 22) (7, 20) (7, 11) (7, 9) (8, 20) (9, 13) (9, 10) (10, 12) (11, 17) (13, 19) (13, 15) (14, 18) (14, 15) (15, 21) (17, 19) (17, 23) (19, 20) (20, 22). What is the maximum sum of the weights of three nodes? | ### 20 | [20, 25] | [7, 60] |
1608 | 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 23, weights of nodes are: [0, 8] [1, 7] [2, 2] [3, 8] [4, 5] [5, 6] [6, 1] [7, 4] [8, 9] [9, 1] [10, 8] [11, 7] [12, 2] [13, 10] [14, 4] [15, 7] [16, 4] [17, 10] [18, 3] [19, 5] [20, 8] [21, 2] [22, 10] [23, 1], and the edges are: (0, 2) (0, 8) (1, 4) (1, 14) (1, 22) (1, 7) (1, 16) (2, 16) (2, 9) (2, 13) (2, 11) (3, 12) (3, 19) (3, 6) (4, 16) (4, 21) (5, 17) (6, 9) (6, 12) (6, 11) (7, 9) (7, 12) (8, 16) (8, 23) (9, 23) (9, 22) (10, 15) (10, 12) (11, 14) (11, 20) (11, 23) (12, 20) (12, 13) (12, 23) (14, 17) (15, 20) (15, 21) (15, 16) (16, 22) (17, 22) (18, 22) (19, 23). What is the maximum sum of the weights of three nodes? | ### 21 | [20, 25] | [7, 60] |
1610 | 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 22, weights of nodes are: [0, 6] [1, 9] [2, 6] [3, 8] [4, 5] [5, 10] [6, 2] [7, 1] [8, 2] [9, 2] [10, 3] [11, 7] [12, 10] [13, 1] [14, 10] [15, 5] [16, 3] [17, 9] [18, 10] [19, 8] [20, 1] [21, 7] [22, 10], and the edges are: (0, 10) (0, 8) (0, 2) (1, 3) (2, 19) (3, 12) (3, 10) (4, 17) (4, 7) (4, 19) (5, 19) (8, 16) (9, 21) (9, 20) (10, 16) (10, 11) (10, 14) (14, 19) (14, 16) (16, 22) (17, 19) (18, 20). What is the maximum sum of the weights of three nodes? | ### 22 | [20, 25] | [7, 60] |
1612 | 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 24, weights of nodes are: [0, 6] [1, 7] [2, 8] [3, 1] [4, 1] [5, 3] [6, 6] [7, 6] [8, 8] [9, 2] [10, 4] [11, 9] [12, 7] [13, 3] [14, 7] [15, 3] [16, 1] [17, 8] [18, 1] [19, 10] [20, 1] [21, 3] [22, 3] [23, 7] [24, 8], and the edges are: (0, 9) (0, 3) (1, 18) (1, 9) (1, 24) (1, 10) (2, 8) (2, 11) (3, 11) (3, 13) (3, 5) (3, 4) (4, 10) (4, 16) (5, 19) (5, 14) (5, 11) (6, 19) (6, 17) (8, 14) (8, 20) (9, 23) (9, 22) (13, 20) (13, 18) (14, 19) (14, 21) (18, 24) (19, 20). What is the maximum sum of the weights of three nodes? | ### 20 | [20, 25] | [7, 60] |
1614 | 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 21, weights of nodes are: [0, 3] [1, 6] [2, 8] [3, 1] [4, 8] [5, 1] [6, 3] [7, 9] [8, 5] [9, 7] [10, 3] [11, 4] [12, 7] [13, 2] [14, 1] [15, 3] [16, 3] [17, 10] [18, 5] [19, 9] [20, 2] [21, 1], and the edges are: (0, 14) (0, 9) (1, 10) (1, 9) (1, 16) (1, 20) (2, 5) (2, 13) (3, 5) (3, 19) (3, 17) (3, 13) (4, 15) (4, 10) (4, 16) (4, 7) (4, 17) (4, 18) (5, 11) (5, 8) (5, 14) (6, 18) (6, 15) (7, 10) (7, 11) (7, 19) (8, 19) (9, 15) (10, 13) (10, 19) (11, 17) (12, 21) (13, 17) (14, 19) (14, 16) (15, 19) (15, 16) (17, 19). What is the maximum sum of the weights of three nodes? | ### 21 | [20, 25] | [7, 60] |
1616 | 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 24, weights of nodes are: [0, 1] [1, 10] [2, 10] [3, 6] [4, 1] [5, 5] [6, 10] [7, 1] [8, 7] [9, 2] [10, 9] [11, 8] [12, 3] [13, 1] [14, 6] [15, 3] [16, 9] [17, 4] [18, 9] [19, 9] [20, 7] [21, 10] [22, 4] [23, 2] [24, 4], and the edges are: (0, 3) (0, 11) (0, 24) (1, 21) (1, 20) (1, 3) (1, 12) (2, 21) (2, 20) (2, 6) (2, 15) (2, 22) (2, 5) (3, 18) (3, 5) (3, 10) (3, 4) (3, 17) (4, 11) (4, 12) (5, 11) (5, 14) (5, 19) (6, 10) (6, 18) (6, 12) (6, 14) (7, 19) (7, 17) (8, 20) (10, 19) (10, 24) (10, 12) (11, 19) (11, 12) (12, 24) (12, 19) (12, 13) (13, 24) (13, 20) (13, 16) (14, 16) (14, 21) (15, 19) (15, 16) (16, 24) (17, 22) (17, 19) (18, 19) (18, 22) (19, 23). What is the maximum sum of the weights of three nodes? | ### 22 | [20, 25] | [7, 60] |
1618 | 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 22, weights of nodes are: [0, 7] [1, 8] [2, 10] [3, 1] [4, 10] [5, 8] [6, 10] [7, 4] [8, 5] [9, 6] [10, 10] [11, 5] [12, 5] [13, 3] [14, 9] [15, 5] [16, 10] [17, 10] [18, 9] [19, 5] [20, 8] [21, 2] [22, 10], and the edges are: (0, 8) (0, 6) (0, 5) (1, 12) (1, 16) (1, 2) (1, 9) (2, 19) (2, 21) (2, 4) (3, 17) (3, 8) (3, 9) (3, 16) (4, 8) (4, 9) (4, 6) (4, 19) (4, 16) (4, 5) (5, 17) (6, 19) (6, 8) (7, 21) (7, 12) (7, 9) (8, 18) (9, 22) (9, 12) (9, 16) (10, 13) (11, 22) (11, 16) (12, 20) (13, 18) (13, 14) (13, 17) (14, 17) (14, 18) (14, 15) (14, 20) (15, 22) (15, 20) (15, 21) (16, 20) (17, 22) (18, 22) (20, 21). What is the maximum sum of the weights of three nodes? | ### 26 | [20, 25] | [7, 60] |
1620 | 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 24, weights of nodes are: [0, 1] [1, 7] [2, 1] [3, 8] [4, 7] [5, 2] [6, 3] [7, 4] [8, 5] [9, 9] [10, 8] [11, 2] [12, 6] [13, 10] [14, 1] [15, 8] [16, 1] [17, 10] [18, 6] [19, 8] [20, 4] [21, 3] [22, 4] [23, 4] [24, 2], and the edges are: (0, 3) (0, 6) (0, 19) (0, 4) (0, 14) (1, 22) (1, 9) (2, 5) (3, 14) (3, 4) (3, 16) (4, 5) (4, 11) (4, 17) (4, 16) (4, 24) (5, 6) (5, 7) (5, 21) (5, 9) (5, 14) (6, 11) (6, 23) (6, 21) (6, 13) (7, 19) (8, 20) (8, 9) (8, 17) (8, 12) (9, 23) (9, 12) (10, 22) (10, 20) (10, 16) (11, 20) (12, 14) (12, 24) (12, 23) (13, 22) (13, 20) (14, 18) (14, 24) (16, 20) (16, 17) (18, 23). What is the maximum sum of the weights of three nodes? | ### 20 | [20, 25] | [7, 60] |
1622 | 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 22, weights of nodes are: [0, 5] [1, 4] [2, 7] [3, 2] [4, 5] [5, 9] [6, 8] [7, 9] [8, 2] [9, 6] [10, 2] [11, 9] [12, 2] [13, 3] [14, 5] [15, 4] [16, 10] [17, 4] [18, 6] [19, 4] [20, 6] [21, 5] [22, 1], and the edges are: (0, 4) (0, 3) (0, 16) (0, 21) (1, 2) (2, 8) (2, 7) (3, 7) (3, 8) (4, 20) (6, 9) (7, 10) (7, 21) (8, 11) (8, 10) (8, 9) (9, 15) (9, 17) (9, 20) (10, 16) (10, 11) (11, 14) (12, 18) (13, 18) (14, 17) (15, 18) (15, 17). What is the maximum sum of the weights of three nodes? | ### 14 | [20, 25] | [7, 60] |
1624 | 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 23, weights of nodes are: [0, 6] [1, 7] [2, 5] [3, 7] [4, 10] [5, 1] [6, 4] [7, 9] [8, 5] [9, 7] [10, 5] [11, 1] [12, 8] [13, 7] [14, 4] [15, 4] [16, 7] [17, 1] [18, 10] [19, 7] [20, 1] [21, 2] [22, 8] [23, 6], and the edges are: (1, 7) (1, 5) (1, 11) (2, 3) (2, 18) (2, 15) (3, 16) (3, 5) (3, 12) (3, 14) (3, 18) (4, 16) (4, 13) (4, 20) (4, 7) (5, 17) (5, 23) (5, 22) (6, 11) (6, 22) (7, 18) (8, 12) (9, 12) (10, 21) (10, 19) (10, 17) (10, 13) (12, 20) (12, 16) (13, 21) (14, 20) (15, 18) (15, 17) (16, 20) (16, 23) (16, 18) (17, 23) (20, 21) (20, 22) (21, 22) (22, 23). What is the maximum sum of the weights of three nodes? | ### 24 | [20, 25] | [7, 60] |
1626 | 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 24, weights of nodes are: [0, 4] [1, 2] [2, 5] [3, 1] [4, 9] [5, 4] [6, 1] [7, 8] [8, 2] [9, 9] [10, 6] [11, 4] [12, 6] [13, 1] [14, 6] [15, 8] [16, 7] [17, 2] [18, 9] [19, 7] [20, 3] [21, 6] [22, 2] [23, 4] [24, 4], and the edges are: (0, 23) (0, 15) (0, 24) (0, 1) (2, 14) (2, 12) (2, 5) (2, 15) (3, 16) (3, 21) (3, 8) (4, 13) (4, 22) (5, 9) (5, 17) (6, 11) (6, 12) (8, 11) (9, 20) (10, 20) (11, 22) (11, 12) (20, 21) (20, 22). What is the maximum sum of the weights of three nodes? | ### 11 | [20, 25] | [7, 60] |
1628 | 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 20, weights of nodes are: [0, 10] [1, 10] [2, 6] [3, 2] [4, 4] [5, 9] [6, 8] [7, 8] [8, 9] [9, 5] [10, 2] [11, 3] [12, 8] [13, 10] [14, 6] [15, 6] [16, 4] [17, 1] [18, 4] [19, 7] [20, 10], and the edges are: (0, 14) (0, 1) (0, 17) (1, 16) (1, 4) (1, 12) (2, 7) (2, 15) (3, 18) (3, 15) (3, 8) (3, 7) (3, 19) (4, 15) (4, 8) (4, 17) (4, 11) (5, 12) (5, 11) (5, 9) (5, 19) (5, 13) (6, 15) (8, 9) (8, 17) (8, 10) (8, 16) (9, 20) (9, 15) (9, 16) (9, 19) (11, 17) (11, 19) (11, 12) (14, 17) (15, 16) (17, 20) (19, 20). What is the maximum sum of the weights of three nodes? | ### 22 | [20, 25] | [7, 60] |
1630 | 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 23, weights of nodes are: [0, 7] [1, 10] [2, 9] [3, 1] [4, 4] [5, 7] [6, 7] [7, 2] [8, 6] [9, 2] [10, 6] [11, 8] [12, 5] [13, 4] [14, 6] [15, 4] [16, 5] [17, 2] [18, 1] [19, 7] [20, 8] [21, 6] [22, 2] [23, 9], and the edges are: (0, 15) (0, 9) (0, 20) (2, 3) (2, 13) (2, 7) (3, 15) (5, 18) (5, 23) (6, 20) (6, 15) (8, 9) (8, 10) (9, 20) (9, 16) (9, 17) (10, 23) (10, 12) (10, 14) (11, 19) (12, 21) (12, 17) (13, 18) (14, 22) (15, 22) (16, 21) (18, 22) (19, 23) (20, 23) (22, 23). What is the maximum sum of the weights of three nodes? | ### 17 | [20, 25] | [7, 60] |
1632 | 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 21, weights of nodes are: [0, 8] [1, 1] [2, 6] [3, 3] [4, 6] [5, 2] [6, 2] [7, 6] [8, 9] [9, 2] [10, 4] [11, 9] [12, 3] [13, 6] [14, 1] [15, 8] [16, 6] [17, 4] [18, 4] [19, 6] [20, 9] [21, 5], and the edges are: (0, 3) (0, 2) (0, 16) (0, 10) (0, 1) (1, 14) (1, 8) (1, 17) (1, 4) (1, 19) (2, 5) (2, 4) (2, 15) (3, 7) (3, 5) (3, 16) (5, 7) (5, 15) (5, 10) (5, 12) (6, 19) (6, 7) (6, 14) (7, 15) (7, 20) (7, 9) (8, 19) (8, 11) (8, 16) (8, 12) (9, 18) (9, 12) (10, 17) (10, 14) (11, 12) (11, 13) (12, 18) (12, 14) (13, 19) (13, 17) (14, 21) (14, 15) (17, 18) (19, 20). What is the maximum sum of the weights of three nodes? | ### 21 | [20, 25] | [7, 60] |
1634 | 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 20, weights of nodes are: [0, 9] [1, 2] [2, 7] [3, 9] [4, 6] [5, 4] [6, 10] [7, 4] [8, 3] [9, 3] [10, 6] [11, 9] [12, 7] [13, 1] [14, 10] [15, 7] [16, 4] [17, 8] [18, 5] [19, 9] [20, 1], and the edges are: (0, 2) (0, 7) (0, 14) (0, 8) (1, 19) (1, 12) (1, 16) (1, 9) (1, 14) (1, 15) (2, 10) (2, 18) (3, 12) (3, 14) (3, 8) (4, 6) (5, 13) (5, 18) (6, 9) (7, 11) (7, 17) (7, 15) (10, 16) (11, 17) (12, 16) (14, 16) (17, 20). What is the maximum sum of the weights of three nodes? | ### 21 | [20, 25] | [7, 60] |
1636 | 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 21, weights of nodes are: [0, 6] [1, 7] [2, 3] [3, 5] [4, 10] [5, 1] [6, 8] [7, 7] [8, 3] [9, 2] [10, 1] [11, 5] [12, 7] [13, 8] [14, 7] [15, 4] [16, 6] [17, 7] [18, 8] [19, 8] [20, 5] [21, 4], and the edges are: (0, 1) (0, 7) (0, 16) (0, 13) (0, 12) (1, 4) (1, 18) (2, 15) (2, 9) (2, 13) (2, 11) (3, 17) (4, 14) (5, 6) (8, 18) (8, 16) (8, 21) (8, 9) (8, 14) (9, 15) (9, 11) (9, 20) (10, 16) (12, 20) (12, 15) (14, 20) (16, 18) (18, 21) (18, 20). What is the maximum sum of the weights of three nodes? | ### 17 | [20, 25] | [7, 60] |
1638 | 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, 3] [3, 7] [4, 9] [5, 4] [6, 6] [7, 2] [8, 9] [9, 4] [10, 4] [11, 4] [12, 4] [13, 9] [14, 7] [15, 2] [16, 8] [17, 8] [18, 9] [19, 9], and the edges are: (0, 6) (1, 11) (1, 5) (2, 6) (3, 14) (3, 15) (3, 10) (3, 13) (3, 16) (3, 8) (4, 10) (4, 11) (4, 14) (6, 19) (7, 17) (7, 18) (8, 13) (9, 16) (9, 17) (10, 11) (10, 12) (10, 14) (12, 16) (12, 13) (12, 19) (13, 19) (14, 17) (14, 18). What is the maximum sum of the weights of three nodes? | ### 25 | [20, 25] | [7, 60] |
1640 | 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 23, weights of nodes are: [0, 8] [1, 3] [2, 4] [3, 6] [4, 8] [5, 7] [6, 10] [7, 10] [8, 9] [9, 9] [10, 1] [11, 6] [12, 1] [13, 3] [14, 5] [15, 8] [16, 4] [17, 8] [18, 3] [19, 9] [20, 9] [21, 5] [22, 7] [23, 7], and the edges are: (0, 3) (0, 22) (0, 6) (1, 5) (1, 4) (1, 23) (1, 2) (1, 15) (1, 8) (2, 18) (2, 10) (2, 6) (2, 13) (2, 22) (2, 14) (2, 7) (3, 21) (3, 11) (4, 19) (4, 15) (4, 20) (5, 12) (5, 13) (5, 14) (5, 9) (6, 18) (6, 11) (6, 22) (7, 13) (7, 18) (7, 10) (7, 12) (8, 22) (9, 15) (10, 14) (10, 23) (10, 15) (11, 19) (13, 18) (13, 19) (13, 20) (13, 17) (14, 22) (14, 16) (15, 22) (15, 18) (17, 18) (18, 20) (18, 23) (18, 21) (19, 20) (21, 22) (22, 23). What is the maximum sum of the weights of three nodes? | ### 26 | [20, 25] | [7, 60] |
1642 | 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 24, weights of nodes are: [0, 1] [1, 6] [2, 4] [3, 8] [4, 8] [5, 10] [6, 10] [7, 6] [8, 3] [9, 6] [10, 10] [11, 7] [12, 4] [13, 5] [14, 2] [15, 5] [16, 9] [17, 4] [18, 10] [19, 8] [20, 3] [21, 3] [22, 10] [23, 4] [24, 7], and the edges are: (0, 16) (2, 17) (2, 22) (2, 18) (3, 17) (3, 18) (4, 7) (4, 13) (5, 9) (5, 14) (5, 17) (6, 18) (7, 13) (8, 17) (8, 20) (10, 24) (10, 12) (12, 14) (13, 16) (16, 17) (18, 19) (19, 22) (19, 20) (20, 24) (20, 21) (21, 24). What is the maximum sum of the weights of three nodes? | ### 19 | [20, 25] | [7, 60] |
1644 | 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 24, weights of nodes are: [0, 2] [1, 9] [2, 9] [3, 7] [4, 3] [5, 10] [6, 7] [7, 3] [8, 3] [9, 3] [10, 6] [11, 10] [12, 9] [13, 8] [14, 8] [15, 7] [16, 2] [17, 8] [18, 3] [19, 10] [20, 7] [21, 8] [22, 10] [23, 5] [24, 3], and the edges are: (0, 16) (0, 20) (0, 3) (1, 6) (1, 16) (1, 5) (2, 14) (2, 17) (2, 19) (2, 16) (2, 8) (3, 21) (3, 20) (3, 5) (3, 15) (3, 7) (4, 18) (4, 9) (4, 24) (4, 12) (5, 6) (5, 11) (5, 18) (5, 12) (5, 21) (5, 14) (6, 16) (6, 13) (8, 16) (8, 12) (8, 14) (8, 13) (9, 15) (10, 24) (10, 23) (10, 16) (11, 24) (11, 14) (12, 24) (14, 23) (14, 24) (14, 22) (15, 21) (15, 22) (15, 18) (17, 21) (18, 22) (18, 21) (20, 21) (22, 24) (22, 23). What is the maximum sum of the weights of three nodes? | ### 28 | [20, 25] | [7, 60] |
1646 | 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 21, weights of nodes are: [0, 9] [1, 10] [2, 6] [3, 6] [4, 7] [5, 2] [6, 2] [7, 1] [8, 9] [9, 9] [10, 7] [11, 10] [12, 3] [13, 1] [14, 1] [15, 4] [16, 10] [17, 8] [18, 2] [19, 6] [20, 1] [21, 6], and the edges are: (0, 10) (0, 3) (1, 2) (2, 7) (2, 5) (2, 11) (3, 19) (3, 10) (3, 5) (4, 11) (4, 14) (4, 20) (5, 10) (5, 9) (5, 6) (6, 7) (6, 18) (6, 10) (6, 11) (6, 13) (6, 8) (6, 14) (7, 8) (7, 10) (7, 9) (7, 20) (7, 19) (8, 20) (8, 19) (9, 10) (9, 19) (10, 20) (10, 18) (11, 20) (11, 14) (12, 19) (13, 15) (13, 18) (13, 17) (14, 20) (15, 19) (15, 20) (16, 21) (17, 18). What is the maximum sum of the weights of three nodes? | ### 22 | [20, 25] | [7, 60] |
1648 | 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 22, weights of nodes are: [0, 8] [1, 9] [2, 10] [3, 2] [4, 10] [5, 3] [6, 8] [7, 1] [8, 5] [9, 8] [10, 1] [11, 1] [12, 6] [13, 7] [14, 4] [15, 3] [16, 10] [17, 8] [18, 1] [19, 4] [20, 1] [21, 7] [22, 10], and the edges are: (0, 1) (1, 15) (1, 17) (2, 18) (2, 4) (2, 12) (3, 13) (4, 21) (4, 15) (4, 14) (5, 8) (6, 14) (7, 19) (7, 12) (8, 20) (9, 12) (12, 18) (13, 17) (15, 20) (17, 20) (18, 20). What is the maximum sum of the weights of three nodes? | ### 17 | [20, 25] | [7, 60] |
1650 | 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 21, weights of nodes are: [0, 9] [1, 5] [2, 7] [3, 1] [4, 9] [5, 5] [6, 6] [7, 8] [8, 7] [9, 8] [10, 6] [11, 6] [12, 6] [13, 7] [14, 8] [15, 6] [16, 10] [17, 8] [18, 4] [19, 4] [20, 2] [21, 5], and the edges are: (0, 7) (1, 7) (1, 21) (1, 4) (1, 5) (2, 21) (2, 11) (3, 6) (3, 9) (4, 10) (4, 11) (5, 6) (5, 18) (6, 17) (7, 19) (8, 21) (8, 12) (9, 10) (9, 13) (9, 17) (10, 15) (10, 18) (10, 11) (11, 18) (13, 19) (14, 21) (14, 16) (17, 18) (19, 21). What is the maximum sum of the weights of three nodes? | ### 21 | [20, 25] | [7, 60] |
1652 | 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 21, weights of nodes are: [0, 9] [1, 9] [2, 2] [3, 1] [4, 3] [5, 5] [6, 7] [7, 8] [8, 8] [9, 4] [10, 1] [11, 2] [12, 5] [13, 3] [14, 2] [15, 6] [16, 7] [17, 6] [18, 10] [19, 2] [20, 1] [21, 1], and the edges are: (0, 9) (0, 16) (0, 18) (0, 17) (1, 19) (1, 8) (1, 6) (1, 9) (1, 21) (1, 2) (2, 15) (2, 11) (2, 3) (3, 4) (3, 6) (3, 13) (3, 9) (3, 14) (4, 21) (4, 5) (4, 20) (4, 7) (4, 9) (5, 20) (5, 15) (6, 21) (6, 14) (7, 9) (7, 16) (7, 11) (8, 12) (9, 11) (9, 13) (10, 20) (10, 17) (13, 17) (13, 20) (13, 21) (13, 16) (14, 21) (15, 19) (16, 19) (16, 21) (16, 20) (18, 21). What is the maximum sum of the weights of three nodes? | ### 17 | [20, 25] | [7, 60] |
1654 | 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 21, weights of nodes are: [0, 2] [1, 4] [2, 5] [3, 7] [4, 10] [5, 4] [6, 1] [7, 1] [8, 7] [9, 9] [10, 2] [11, 2] [12, 7] [13, 5] [14, 6] [15, 9] [16, 9] [17, 2] [18, 1] [19, 1] [20, 7] [21, 2], and the edges are: (1, 18) (1, 7) (1, 20) (2, 21) (3, 11) (5, 8) (14, 19) (15, 20) (15, 17) (17, 20). What is the maximum sum of the weights of three nodes? | ### 18 | [20, 25] | [7, 60] |
1656 | 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 22, weights of nodes are: [0, 4] [1, 7] [2, 1] [3, 5] [4, 2] [5, 6] [6, 7] [7, 3] [8, 8] [9, 8] [10, 1] [11, 1] [12, 9] [13, 8] [14, 10] [15, 7] [16, 2] [17, 4] [18, 10] [19, 7] [20, 5] [21, 5] [22, 1], and the edges are: (0, 2) (1, 17) (1, 13) (1, 16) (2, 17) (2, 11) (2, 22) (2, 12) (2, 4) (3, 18) (3, 20) (3, 6) (3, 21) (4, 8) (4, 21) (4, 17) (6, 12) (6, 14) (6, 8) (7, 20) (7, 15) (7, 10) (8, 20) (8, 9) (9, 19) (9, 13) (10, 18) (10, 13) (11, 21) (12, 17) (12, 19) (13, 14) (15, 16) (15, 18) (18, 20). What is the maximum sum of the weights of three nodes? | ### 20 | [20, 25] | [7, 60] |
1658 | 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, 2] [4, 1] [5, 8] [6, 2] [7, 1] [8, 6] [9, 5] [10, 7] [11, 9] [12, 8] [13, 8] [14, 5] [15, 10] [16, 5] [17, 10] [18, 4] [19, 8], and the edges are: (0, 17) (0, 1) (0, 7) (0, 16) (0, 18) (0, 2) (1, 7) (1, 4) (3, 5) (3, 11) (3, 9) (3, 6) (5, 10) (5, 6) (5, 12) (5, 9) (6, 12) (6, 18) (6, 9) (6, 11) (7, 18) (7, 12) (8, 15) (9, 10) (10, 12) (10, 11) (11, 14) (12, 13) (13, 15) (13, 14) (14, 17) (14, 15) (15, 17) (15, 19) (16, 18). What is the maximum sum of the weights of three nodes? | ### 25 | [20, 25] | [7, 60] |
1660 | 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 20, weights of nodes are: [0, 10] [1, 7] [2, 2] [3, 2] [4, 7] [5, 10] [6, 7] [7, 5] [8, 6] [9, 10] [10, 7] [11, 2] [12, 10] [13, 1] [14, 5] [15, 10] [16, 4] [17, 1] [18, 3] [19, 8] [20, 10], and the edges are: (0, 20) (0, 6) (0, 9) (0, 15) (1, 20) (2, 15) (2, 13) (2, 18) (2, 12) (3, 10) (3, 6) (4, 6) (4, 12) (4, 15) (4, 7) (4, 13) (5, 7) (5, 6) (5, 11) (6, 15) (6, 13) (7, 18) (7, 8) (9, 14) (10, 11) (10, 17) (11, 20) (11, 13) (14, 17) (14, 16) (15, 19) (16, 19) (16, 17) (16, 18) (17, 19). What is the maximum sum of the weights of three nodes? | ### 27 | [20, 25] | [7, 60] |
1662 | 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 22, weights of nodes are: [0, 9] [1, 8] [2, 3] [3, 5] [4, 2] [5, 9] [6, 9] [7, 7] [8, 4] [9, 1] [10, 10] [11, 8] [12, 9] [13, 5] [14, 9] [15, 2] [16, 10] [17, 4] [18, 9] [19, 9] [20, 7] [21, 3] [22, 9], and the edges are: (0, 9) (0, 20) (0, 11) (1, 7) (1, 5) (1, 10) (1, 16) (2, 15) (2, 16) (2, 6) (2, 18) (3, 14) (3, 22) (3, 17) (4, 17) (4, 12) (4, 8) (5, 13) (5, 9) (5, 17) (5, 20) (6, 15) (6, 17) (6, 18) (7, 12) (7, 22) (7, 19) (7, 13) (8, 20) (8, 22) (8, 14) (8, 17) (8, 19) (9, 14) (9, 19) (11, 15) (11, 14) (12, 15) (14, 15) (17, 21) (19, 20) (19, 22) (20, 21) (21, 22). What is the maximum sum of the weights of three nodes? | ### 25 | [20, 25] | [7, 60] |
1664 | 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 23, weights of nodes are: [0, 7] [1, 4] [2, 7] [3, 8] [4, 2] [5, 7] [6, 8] [7, 8] [8, 1] [9, 6] [10, 3] [11, 4] [12, 5] [13, 9] [14, 2] [15, 6] [16, 2] [17, 7] [18, 10] [19, 2] [20, 9] [21, 3] [22, 6] [23, 3], and the edges are: (0, 2) (0, 13) (1, 9) (1, 5) (1, 21) (1, 17) (1, 19) (1, 3) (2, 6) (2, 13) (2, 10) (2, 22) (2, 7) (2, 21) (2, 16) (3, 17) (4, 8) (4, 11) (5, 11) (6, 23) (6, 16) (7, 19) (7, 12) (7, 13) (7, 9) (8, 21) (9, 11) (9, 13) (9, 15) (9, 21) (9, 23) (10, 21) (10, 11) (10, 15) (11, 23) (12, 20) (12, 19) (12, 21) (13, 22) (13, 17) (13, 23) (14, 17) (14, 19) (15, 19) (15, 17) (17, 21) (18, 19) (18, 21) (20, 22). What is the maximum sum of the weights of three nodes? | ### 24 | [20, 25] | [7, 60] |
1666 | 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 21, weights of nodes are: [0, 3] [1, 6] [2, 9] [3, 2] [4, 6] [5, 2] [6, 5] [7, 3] [8, 6] [9, 2] [10, 1] [11, 9] [12, 10] [13, 8] [14, 4] [15, 1] [16, 10] [17, 1] [18, 4] [19, 3] [20, 3] [21, 1], and the edges are: (2, 3) (2, 16) (3, 5) (3, 18) (4, 14) (4, 6) (5, 17) (8, 15) (8, 11) (8, 21) (9, 19) (9, 18) (10, 18) (11, 15) (13, 17) (14, 18) (15, 17) (17, 19) (18, 19). What is the maximum sum of the weights of three nodes? | ### 16 | [20, 25] | [7, 60] |
1668 | 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 23, weights of nodes are: [0, 10] [1, 6] [2, 7] [3, 9] [4, 2] [5, 7] [6, 9] [7, 2] [8, 10] [9, 6] [10, 10] [11, 3] [12, 6] [13, 5] [14, 1] [15, 7] [16, 6] [17, 5] [18, 10] [19, 9] [20, 1] [21, 10] [22, 9] [23, 5], and the edges are: (0, 9) (0, 13) (1, 6) (1, 18) (1, 8) (1, 12) (2, 9) (2, 19) (3, 10) (3, 23) (3, 17) (5, 12) (5, 23) (6, 9) (6, 7) (6, 8) (6, 11) (6, 18) (6, 14) (7, 18) (7, 20) (7, 15) (7, 16) (8, 20) (8, 16) (8, 11) (8, 22) (9, 18) (9, 20) (9, 11) (10, 18) (10, 11) (12, 23) (12, 17) (14, 17) (15, 16) (16, 23) (16, 21) (17, 22) (18, 22) (18, 21) (21, 22). What is the maximum sum of the weights of three nodes? | ### 29 | [20, 25] | [7, 60] |
1670 | 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, 2] [2, 6] [3, 10] [4, 2] [5, 6] [6, 7] [7, 10] [8, 10] [9, 5] [10, 1] [11, 9] [12, 6] [13, 4] [14, 9] [15, 3] [16, 10] [17, 7] [18, 8] [19, 3], and the edges are: (0, 3) (0, 11) (1, 18) (1, 6) (2, 13) (2, 9) (2, 7) (2, 8) (3, 17) (3, 16) (3, 5) (3, 11) (3, 6) (4, 11) (4, 9) (5, 6) (5, 8) (5, 11) (5, 13) (6, 19) (6, 15) (6, 10) (7, 10) (7, 8) (7, 19) (8, 18) (9, 12) (9, 16) (9, 19) (10, 19) (12, 16) (12, 18) (13, 14) (14, 16) (14, 17) (15, 17) (18, 19). What is the maximum sum of the weights of three nodes? | ### 27 | [20, 25] | [7, 60] |
1672 | 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 21, weights of nodes are: [0, 2] [1, 6] [2, 9] [3, 2] [4, 3] [5, 6] [6, 10] [7, 9] [8, 2] [9, 2] [10, 9] [11, 1] [12, 10] [13, 5] [14, 4] [15, 7] [16, 4] [17, 4] [18, 10] [19, 10] [20, 3] [21, 10], and the edges are: (0, 4) (0, 1) (1, 4) (1, 2) (1, 5) (2, 18) (2, 10) (2, 5) (3, 5) (4, 7) (5, 16) (6, 13) (6, 11) (6, 21) (6, 14) (7, 17) (7, 19) (7, 18) (8, 21) (8, 18) (9, 19) (10, 16) (10, 11) (12, 21) (13, 15) (16, 20) (17, 21) (18, 21). What is the maximum sum of the weights of three nodes? | ### 22 | [20, 25] | [7, 60] |
1674 | 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 21, weights of nodes are: [0, 3] [1, 8] [2, 2] [3, 8] [4, 3] [5, 1] [6, 9] [7, 4] [8, 8] [9, 8] [10, 1] [11, 6] [12, 3] [13, 6] [14, 4] [15, 8] [16, 3] [17, 5] [18, 7] [19, 2] [20, 6] [21, 2], and the edges are: (0, 10) (0, 13) (1, 18) (1, 4) (1, 17) (1, 7) (1, 13) (2, 13) (2, 18) (2, 17) (3, 9) (3, 21) (4, 17) (4, 10) (5, 6) (5, 9) (6, 9) (8, 11) (9, 19) (9, 21) (9, 18) (10, 16) (11, 18) (13, 21) (18, 21) (18, 19). What is the maximum sum of the weights of three nodes? | ### 18 | [20, 25] | [7, 60] |
1676 | 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 21, weights of nodes are: [0, 1] [1, 4] [2, 9] [3, 7] [4, 7] [5, 10] [6, 6] [7, 5] [8, 1] [9, 6] [10, 5] [11, 3] [12, 1] [13, 1] [14, 4] [15, 3] [16, 8] [17, 6] [18, 5] [19, 3] [20, 4] [21, 7], and the edges are: (0, 16) (1, 18) (1, 8) (1, 17) (4, 7) (4, 14) (5, 13) (5, 16) (5, 17) (5, 11) (6, 17) (7, 18) (9, 16) (9, 18) (10, 20) (11, 14) (13, 16) (14, 15) (16, 19). What is the maximum sum of the weights of three nodes? | ### 19 | [20, 25] | [7, 60] |
1678 | 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 24, weights of nodes are: [0, 10] [1, 1] [2, 3] [3, 4] [4, 4] [5, 10] [6, 3] [7, 9] [8, 5] [9, 1] [10, 2] [11, 5] [12, 10] [13, 9] [14, 5] [15, 5] [16, 3] [17, 7] [18, 6] [19, 5] [20, 5] [21, 2] [22, 10] [23, 10] [24, 5], and the edges are: (0, 20) (0, 22) (0, 1) (0, 21) (1, 21) (1, 12) (2, 7) (2, 13) (2, 3) (2, 9) (2, 16) (3, 11) (3, 23) (3, 8) (3, 19) (3, 20) (4, 19) (4, 16) (4, 21) (5, 12) (5, 7) (6, 10) (6, 24) (6, 23) (7, 12) (7, 19) (7, 22) (8, 17) (8, 9) (8, 12) (8, 22) (9, 23) (9, 12) (9, 20) (10, 21) (11, 18) (11, 14) (11, 22) (11, 20) (12, 14) (12, 15) (12, 13) (14, 21) (15, 24) (18, 22) (18, 20) (19, 21) (19, 23) (20, 23) (20, 24) (20, 22) (22, 24) (22, 23). What is the maximum sum of the weights of three nodes? | ### 29 | [20, 25] | [7, 60] |
1680 | 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 21, weights of nodes are: [0, 9] [1, 9] [2, 9] [3, 7] [4, 3] [5, 9] [6, 4] [7, 10] [8, 1] [9, 3] [10, 6] [11, 5] [12, 3] [13, 4] [14, 4] [15, 8] [16, 6] [17, 8] [18, 6] [19, 6] [20, 6] [21, 4], and the edges are: (1, 8) (2, 11) (3, 13) (3, 21) (4, 16) (4, 14) (5, 7) (5, 16) (5, 19) (5, 17) (6, 17) (6, 9) (7, 14) (8, 14) (11, 17) (12, 20) (14, 18) (14, 16) (14, 21) (19, 21) (19, 20). What is the maximum sum of the weights of three nodes? | ### 13 | [20, 25] | [7, 60] |
1682 | 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 22, weights of nodes are: [0, 9] [1, 2] [2, 2] [3, 6] [4, 4] [5, 10] [6, 9] [7, 9] [8, 8] [9, 10] [10, 9] [11, 2] [12, 1] [13, 4] [14, 7] [15, 4] [16, 4] [17, 5] [18, 6] [19, 7] [20, 6] [21, 10] [22, 5], and the edges are: (0, 13) (0, 19) (0, 21) (0, 1) (1, 6) (1, 5) (1, 16) (1, 14) (2, 14) (2, 19) (3, 11) (4, 22) (4, 17) (4, 21) (5, 9) (5, 12) (5, 16) (5, 6) (6, 16) (6, 18) (7, 12) (7, 11) (8, 22) (11, 19) (12, 17) (14, 15) (15, 16) (17, 20) (20, 22). What is the maximum sum of the weights of three nodes? | ### 23 | [20, 25] | [7, 60] |
1684 | 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 21, weights of nodes are: [0, 6] [1, 3] [2, 2] [3, 6] [4, 10] [5, 5] [6, 4] [7, 7] [8, 1] [9, 4] [10, 3] [11, 2] [12, 10] [13, 2] [14, 10] [15, 1] [16, 9] [17, 8] [18, 2] [19, 3] [20, 2] [21, 3], and the edges are: (0, 19) (1, 14) (1, 21) (2, 19) (2, 9) (2, 6) (2, 3) (3, 19) (4, 16) (4, 8) (4, 5) (5, 11) (5, 20) (5, 9) (5, 10) (6, 12) (6, 19) (6, 8) (6, 15) (7, 14) (8, 17) (10, 16) (10, 17) (11, 12) (11, 21) (12, 18) (12, 17) (15, 16) (16, 21) (20, 21). What is the maximum sum of the weights of three nodes? | ### 11 | [20, 25] | [7, 60] |
1686 | 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 20, weights of nodes are: [0, 1] [1, 7] [2, 5] [3, 6] [4, 4] [5, 3] [6, 7] [7, 8] [8, 1] [9, 7] [10, 5] [11, 8] [12, 7] [13, 10] [14, 6] [15, 10] [16, 10] [17, 5] [18, 2] [19, 3] [20, 4], and the edges are: (0, 5) (0, 6) (0, 7) (1, 10) (1, 8) (1, 7) (1, 14) (2, 15) (3, 17) (3, 20) (3, 14) (3, 8) (3, 13) (4, 18) (4, 5) (4, 10) (4, 17) (5, 13) (5, 8) (5, 6) (5, 18) (6, 14) (6, 16) (9, 20) (9, 13) (9, 14) (10, 17) (10, 11) (10, 20) (11, 13) (11, 15) (11, 16) (13, 16) (17, 20). What is the maximum sum of the weights of three nodes? | ### 28 | [20, 25] | [7, 60] |
1688 | 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 24, weights of nodes are: [0, 10] [1, 8] [2, 2] [3, 4] [4, 4] [5, 5] [6, 2] [7, 5] [8, 5] [9, 3] [10, 8] [11, 7] [12, 3] [13, 5] [14, 4] [15, 7] [16, 9] [17, 3] [18, 10] [19, 7] [20, 8] [21, 2] [22, 3] [23, 5] [24, 10], and the edges are: (0, 2) (0, 24) (0, 3) (0, 5) (1, 15) (1, 3) (1, 24) (1, 12) (1, 16) (2, 17) (2, 23) (2, 9) (2, 7) (2, 14) (2, 15) (2, 13) (3, 10) (3, 8) (3, 23) (3, 21) (3, 5) (4, 13) (4, 16) (4, 12) (4, 5) (5, 11) (6, 21) (6, 13) (6, 14) (7, 13) (7, 15) (9, 24) (9, 14) (9, 21) (9, 18) (10, 24) (11, 24) (12, 16) (12, 22) (13, 21) (13, 24) (13, 15) (16, 23) (16, 22) (18, 20) (19, 23) (19, 20) (20, 23) (21, 23) (22, 24). What is the maximum sum of the weights of three nodes? | ### 20 | [20, 25] | [7, 60] |
1690 | 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 24, weights of nodes are: [0, 10] [1, 1] [2, 3] [3, 3] [4, 5] [5, 2] [6, 8] [7, 3] [8, 2] [9, 7] [10, 4] [11, 3] [12, 4] [13, 4] [14, 8] [15, 3] [16, 6] [17, 5] [18, 6] [19, 6] [20, 4] [21, 3] [22, 6] [23, 10] [24, 1], and the edges are: (0, 3) (1, 24) (1, 16) (1, 18) (2, 14) (2, 10) (2, 21) (2, 12) (2, 22) (3, 15) (3, 5) (3, 13) (3, 21) (4, 14) (4, 13) (5, 10) (5, 12) (5, 18) (6, 18) (6, 20) (6, 17) (7, 13) (7, 20) (7, 16) (7, 21) (7, 23) (8, 9) (8, 24) (8, 14) (9, 13) (9, 12) (9, 17) (10, 19) (11, 22) (12, 19) (12, 22) (12, 15) (12, 18) (12, 16) (13, 20) (13, 19) (13, 16) (15, 18) (15, 21) (16, 18) (16, 23) (16, 17) (17, 18) (18, 23) (18, 20) (19, 20) (20, 22). What is the maximum sum of the weights of three nodes? | ### 22 | [20, 25] | [7, 60] |
1692 | 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, 6] [2, 7] [3, 3] [4, 5] [5, 1] [6, 4] [7, 6] [8, 9] [9, 7] [10, 9] [11, 4] [12, 2] [13, 6] [14, 7] [15, 1] [16, 10] [17, 3] [18, 7] [19, 6], and the edges are: (1, 11) (1, 5) (2, 18) (3, 9) (4, 14) (6, 9) (7, 17) (7, 10) (7, 13) (7, 11) (8, 12) (9, 15) (10, 15) (11, 17). What is the maximum sum of the weights of three nodes? | ### 13 | [20, 25] | [7, 60] |
1694 | 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 22, weights of nodes are: [0, 3] [1, 8] [2, 9] [3, 10] [4, 1] [5, 4] [6, 5] [7, 4] [8, 4] [9, 5] [10, 9] [11, 7] [12, 3] [13, 6] [14, 8] [15, 4] [16, 3] [17, 8] [18, 4] [19, 4] [20, 1] [21, 5] [22, 2], and the edges are: (0, 6) (0, 2) (1, 19) (2, 14) (3, 19) (3, 21) (3, 11) (4, 13) (5, 9) (6, 14) (6, 8) (6, 9) (7, 15) (7, 12) (8, 21) (8, 10) (9, 11) (9, 16) (10, 16) (10, 11) (11, 19) (13, 18) (13, 21) (15, 18) (16, 20) (16, 19) (17, 22) (19, 20) (20, 22). What is the maximum sum of the weights of three nodes? | ### 21 | [20, 25] | [7, 60] |
1696 | 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 22, weights of nodes are: [0, 1] [1, 5] [2, 10] [3, 8] [4, 2] [5, 10] [6, 3] [7, 10] [8, 8] [9, 1] [10, 2] [11, 10] [12, 5] [13, 9] [14, 3] [15, 4] [16, 9] [17, 4] [18, 1] [19, 7] [20, 3] [21, 2] [22, 5], and the edges are: (0, 5) (1, 12) (1, 18) (1, 10) (2, 21) (2, 14) (2, 12) (2, 9) (2, 18) (3, 16) (3, 8) (3, 5) (4, 13) (4, 20) (4, 18) (4, 8) (5, 10) (5, 9) (5, 18) (6, 21) (6, 8) (6, 9) (6, 13) (7, 11) (7, 9) (7, 20) (8, 22) (9, 15) (10, 22) (10, 15) (10, 20) (10, 12) (10, 19) (11, 14) (11, 20) (11, 12) (12, 21) (14, 21) (15, 21) (16, 17) (17, 18) (17, 20) (17, 22) (18, 22) (18, 19) (19, 21) (20, 21). What is the maximum sum of the weights of three nodes? | ### 23 | [20, 25] | [7, 60] |
1698 | 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, 6] [1, 5] [2, 5] [3, 9] [4, 8] [5, 6] [6, 7] [7, 9] [8, 6] [9, 8] [10, 5] [11, 4] [12, 8] [13, 8] [14, 5] [15, 2] [16, 8] [17, 4] [18, 1] [19, 4], and the edges are: (0, 11) (0, 15) (0, 14) (1, 3) (1, 14) (1, 5) (1, 15) (2, 14) (2, 17) (2, 9) (3, 12) (3, 16) (3, 9) (4, 13) (4, 7) (4, 15) (4, 10) (4, 19) (5, 16) (5, 9) (6, 15) (7, 13) (7, 11) (7, 16) (8, 11) (8, 16) (9, 16) (9, 13) (10, 12) (10, 13) (11, 15) (12, 14) (13, 17) (17, 19). What is the maximum sum of the weights of three nodes? | ### 25 | [20, 25] | [7, 60] |
1700 | 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 20, weights of nodes are: [0, 3] [1, 4] [2, 4] [3, 3] [4, 6] [5, 10] [6, 1] [7, 7] [8, 9] [9, 10] [10, 5] [11, 6] [12, 8] [13, 1] [14, 4] [15, 5] [16, 3] [17, 7] [18, 7] [19, 8] [20, 6], and the edges are: (0, 14) (0, 17) (0, 15) (0, 1) (0, 16) (1, 6) (2, 13) (2, 14) (3, 10) (3, 11) (4, 14) (4, 5) (4, 10) (4, 8) (5, 11) (6, 18) (7, 17) (9, 15) (10, 15) (11, 17) (11, 18) (12, 17) (12, 15) (15, 20) (16, 18) (16, 19) (17, 18) (19, 20). What is the maximum sum of the weights of three nodes? | ### 20 | [20, 25] | [7, 60] |
1702 | 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 22, weights of nodes are: [0, 10] [1, 10] [2, 5] [3, 3] [4, 1] [5, 5] [6, 2] [7, 2] [8, 3] [9, 2] [10, 5] [11, 9] [12, 6] [13, 2] [14, 9] [15, 8] [16, 6] [17, 10] [18, 8] [19, 8] [20, 10] [21, 1] [22, 1], and the edges are: (0, 13) (1, 9) (1, 3) (1, 11) (2, 8) (2, 4) (2, 14) (3, 9) (3, 6) (4, 15) (5, 22) (5, 16) (7, 13) (7, 12) (7, 11) (8, 9) (8, 11) (9, 19) (9, 13) (10, 18) (11, 15) (12, 15) (13, 17) (14, 16) (15, 21) (16, 20) (18, 20) (18, 21) (19, 21). What is the maximum sum of the weights of three nodes? | ### 15 | [20, 25] | [7, 60] |
1704 | 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 23, weights of nodes are: [0, 7] [1, 3] [2, 6] [3, 3] [4, 7] [5, 1] [6, 3] [7, 7] [8, 6] [9, 7] [10, 4] [11, 9] [12, 8] [13, 1] [14, 1] [15, 6] [16, 8] [17, 5] [18, 9] [19, 6] [20, 3] [21, 9] [22, 2] [23, 8], and the edges are: (0, 9) (0, 20) (1, 13) (1, 21) (1, 20) (2, 3) (4, 14) (4, 20) (5, 23) (6, 7) (8, 18) (9, 23) (9, 11) (9, 15) (10, 16) (10, 17) (10, 22) (11, 12) (11, 13) (11, 18) (12, 13) (12, 22) (13, 15) (13, 19) (13, 20) (14, 15) (19, 20). What is the maximum sum of the weights of three nodes? | ### 18 | [20, 25] | [7, 60] |
1706 | 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 24, weights of nodes are: [0, 5] [1, 8] [2, 4] [3, 8] [4, 8] [5, 8] [6, 7] [7, 7] [8, 6] [9, 9] [10, 5] [11, 5] [12, 9] [13, 5] [14, 1] [15, 2] [16, 1] [17, 3] [18, 7] [19, 8] [20, 5] [21, 1] [22, 6] [23, 2] [24, 9], and the edges are: (0, 23) (0, 1) (0, 3) (0, 15) (2, 4) (2, 23) (2, 24) (2, 14) (3, 19) (4, 12) (4, 14) (4, 16) (5, 16) (6, 13) (9, 12) (10, 14) (11, 23) (12, 15) (12, 20) (13, 19) (13, 22) (14, 21) (14, 16) (16, 22) (18, 22) (20, 23). What is the maximum sum of the weights of three nodes? | ### 13 | [20, 25] | [7, 60] |
1708 | 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 22, weights of nodes are: [0, 5] [1, 8] [2, 1] [3, 2] [4, 7] [5, 6] [6, 1] [7, 9] [8, 9] [9, 1] [10, 2] [11, 1] [12, 9] [13, 7] [14, 6] [15, 1] [16, 7] [17, 5] [18, 3] [19, 2] [20, 5] [21, 4] [22, 3], and the edges are: (0, 2) (0, 1) (0, 14) (0, 19) (1, 12) (1, 21) (1, 7) (2, 20) (3, 10) (3, 15) (3, 17) (4, 22) (4, 7) (5, 18) (5, 8) (5, 16) (6, 13) (6, 14) (7, 9) (8, 15) (8, 18) (8, 16) (9, 18) (9, 20) (9, 17) (11, 15) (12, 20) (12, 22) (13, 22) (17, 20) (17, 21) (18, 19) (20, 21). What is the maximum sum of the weights of three nodes? | ### 22 | [20, 25] | [7, 60] |
1710 | 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 21, weights of nodes are: [0, 1] [1, 6] [2, 8] [3, 7] [4, 1] [5, 3] [6, 5] [7, 5] [8, 5] [9, 9] [10, 9] [11, 8] [12, 10] [13, 7] [14, 4] [15, 6] [16, 5] [17, 2] [18, 5] [19, 3] [20, 5] [21, 5], and the edges are: (0, 9) (0, 7) (1, 10) (1, 21) (2, 5) (2, 8) (2, 6) (3, 21) (3, 11) (4, 9) (5, 8) (6, 16) (7, 16) (7, 13) (9, 11) (9, 12) (12, 13) (12, 16) (12, 21) (12, 15) (13, 21) (15, 16) (15, 20) (16, 18) (17, 21) (18, 19). What is the maximum sum of the weights of three nodes? | ### 22 | [20, 25] | [7, 60] |
1712 | 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 23, weights of nodes are: [0, 9] [1, 4] [2, 7] [3, 7] [4, 5] [5, 9] [6, 2] [7, 3] [8, 1] [9, 5] [10, 8] [11, 7] [12, 10] [13, 9] [14, 8] [15, 5] [16, 8] [17, 8] [18, 7] [19, 9] [20, 10] [21, 2] [22, 10] [23, 5], and the edges are: (0, 4) (0, 2) (0, 3) (1, 22) (1, 3) (1, 21) (1, 12) (2, 19) (2, 7) (2, 10) (2, 8) (3, 12) (3, 17) (3, 8) (3, 10) (3, 23) (3, 13) (4, 14) (4, 22) (5, 11) (5, 17) (5, 8) (6, 16) (6, 13) (6, 7) (6, 10) (7, 15) (8, 22) (8, 23) (9, 17) (9, 21) (9, 20) (9, 15) (10, 17) (10, 11) (11, 17) (12, 15) (12, 13) (13, 20) (13, 16) (14, 19) (15, 21) (15, 18) (15, 17) (16, 19) (16, 21) (17, 19) (18, 21) (19, 21) (20, 21). What is the maximum sum of the weights of three nodes? | ### 26 | [20, 25] | [7, 60] |
1714 | 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 22, weights of nodes are: [0, 4] [1, 3] [2, 8] [3, 6] [4, 2] [5, 6] [6, 4] [7, 9] [8, 10] [9, 2] [10, 7] [11, 4] [12, 2] [13, 7] [14, 4] [15, 7] [16, 9] [17, 6] [18, 6] [19, 3] [20, 6] [21, 1] [22, 3], and the edges are: (0, 20) (0, 17) (0, 5) (0, 6) (1, 6) (1, 9) (1, 12) (2, 16) (2, 9) (2, 11) (2, 4) (2, 13) (3, 13) (3, 22) (4, 8) (5, 18) (5, 19) (5, 11) (6, 22) (6, 20) (7, 21) (7, 15) (7, 12) (7, 8) (8, 19) (9, 15) (9, 12) (9, 16) (11, 16) (11, 21) (12, 22) (12, 21) (14, 20) (14, 22) (14, 19) (16, 21) (18, 21). What is the maximum sum of the weights of three nodes? | ### 21 | [20, 25] | [7, 60] |
1716 | 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 23, weights of nodes are: [0, 9] [1, 10] [2, 9] [3, 5] [4, 4] [5, 5] [6, 3] [7, 3] [8, 10] [9, 10] [10, 4] [11, 5] [12, 10] [13, 1] [14, 8] [15, 9] [16, 1] [17, 7] [18, 6] [19, 10] [20, 3] [21, 6] [22, 4] [23, 4], and the edges are: (1, 3) (1, 15) (2, 10) (2, 5) (2, 14) (2, 16) (2, 6) (3, 19) (4, 6) (4, 15) (5, 14) (5, 8) (5, 16) (5, 15) (5, 20) (6, 19) (6, 10) (6, 11) (7, 21) (7, 8) (7, 15) (7, 12) (8, 20) (9, 18) (9, 23) (10, 18) (10, 22) (12, 22) (14, 23) (15, 23) (15, 22) (16, 17) (16, 20) (17, 21) (17, 18) (17, 23) (18, 22) (19, 21). What is the maximum sum of the weights of three nodes? | ### 22 | [20, 25] | [7, 60] |
1718 | 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 22, weights of nodes are: [0, 5] [1, 6] [2, 9] [3, 2] [4, 8] [5, 5] [6, 1] [7, 3] [8, 5] [9, 6] [10, 9] [11, 8] [12, 6] [13, 4] [14, 9] [15, 9] [16, 7] [17, 2] [18, 2] [19, 4] [20, 1] [21, 8] [22, 6], and the edges are: (0, 16) (0, 19) (1, 2) (2, 18) (2, 22) (2, 19) (3, 17) (3, 9) (4, 5) (4, 22) (5, 10) (5, 15) (5, 16) (5, 7) (6, 16) (6, 9) (6, 7) (7, 14) (7, 13) (7, 17) (8, 22) (8, 17) (8, 20) (9, 13) (10, 19) (10, 17) (11, 18) (11, 21) (11, 22) (11, 15) (12, 22) (12, 21) (12, 16) (13, 19) (13, 21) (15, 19) (15, 22) (16, 17) (17, 22) (18, 19) (19, 21) (21, 22). What is the maximum sum of the weights of three nodes? | ### 23 | [20, 25] | [7, 60] |
1720 | 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 20, weights of nodes are: [0, 4] [1, 7] [2, 10] [3, 3] [4, 6] [5, 7] [6, 7] [7, 6] [8, 4] [9, 7] [10, 9] [11, 2] [12, 1] [13, 6] [14, 3] [15, 4] [16, 5] [17, 7] [18, 5] [19, 1] [20, 6], and the edges are: (0, 16) (0, 19) (0, 6) (0, 11) (0, 9) (1, 9) (1, 7) (2, 14) (2, 9) (2, 20) (2, 4) (2, 3) (3, 11) (3, 15) (4, 19) (4, 8) (5, 16) (5, 18) (5, 19) (6, 8) (6, 18) (7, 16) (7, 12) (8, 9) (8, 17) (9, 17) (10, 18) (11, 17) (12, 13) (12, 14) (13, 19) (13, 16) (14, 20) (16, 18) (16, 19). What is the maximum sum of the weights of three nodes? | ### 19 | [20, 25] | [7, 60] |
1722 | 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 20, weights of nodes are: [0, 3] [1, 7] [2, 7] [3, 2] [4, 7] [5, 3] [6, 2] [7, 4] [8, 6] [9, 6] [10, 9] [11, 3] [12, 8] [13, 3] [14, 7] [15, 8] [16, 7] [17, 3] [18, 10] [19, 5] [20, 3], and the edges are: (0, 12) (0, 7) (1, 2) (1, 7) (1, 3) (1, 18) (2, 16) (3, 8) (3, 19) (4, 12) (4, 5) (6, 20) (6, 14) (7, 9) (7, 18) (7, 8) (7, 15) (8, 20) (9, 12) (10, 18) (10, 14) (14, 17). What is the maximum sum of the weights of three nodes? | ### 21 | [20, 25] | [7, 60] |
1724 | 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 24, weights of nodes are: [0, 1] [1, 4] [2, 10] [3, 3] [4, 9] [5, 10] [6, 10] [7, 7] [8, 10] [9, 8] [10, 7] [11, 5] [12, 9] [13, 4] [14, 3] [15, 9] [16, 4] [17, 9] [18, 1] [19, 2] [20, 5] [21, 8] [22, 1] [23, 1] [24, 6], and the edges are: (0, 21) (1, 2) (1, 9) (2, 23) (2, 20) (2, 15) (3, 11) (3, 22) (4, 22) (6, 12) (6, 21) (7, 18) (7, 10) (7, 12) (8, 22) (8, 20) (8, 24) (9, 18) (12, 17) (12, 22) (12, 21) (13, 16) (13, 14) (14, 17) (14, 24) (15, 19) (18, 23) (19, 20) (20, 22) (20, 21). What is the maximum sum of the weights of three nodes? | ### 27 | [20, 25] | [7, 60] |
1726 | 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 22, weights of nodes are: [0, 4] [1, 5] [2, 7] [3, 10] [4, 9] [5, 6] [6, 7] [7, 6] [8, 8] [9, 6] [10, 9] [11, 3] [12, 2] [13, 5] [14, 10] [15, 4] [16, 5] [17, 1] [18, 2] [19, 9] [20, 5] [21, 10] [22, 7], and the edges are: (0, 8) (1, 20) (1, 9) (1, 10) (1, 14) (1, 15) (2, 22) (2, 15) (2, 11) (2, 14) (2, 13) (3, 20) (4, 14) (4, 9) (4, 11) (5, 19) (5, 12) (6, 19) (6, 21) (7, 13) (7, 15) (7, 11) (7, 14) (7, 18) (8, 22) (8, 16) (9, 19) (9, 12) (10, 15) (10, 16) (11, 22) (11, 19) (13, 17) (13, 15) (14, 20) (15, 19) (16, 18) (17, 18) (17, 20) (18, 22) (19, 20) (19, 22). What is the maximum sum of the weights of three nodes? | ### 20 | [20, 25] | [7, 60] |
1728 | 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 22, weights of nodes are: [0, 7] [1, 9] [2, 2] [3, 10] [4, 2] [5, 5] [6, 2] [7, 4] [8, 3] [9, 4] [10, 2] [11, 3] [12, 2] [13, 2] [14, 5] [15, 10] [16, 1] [17, 10] [18, 4] [19, 4] [20, 3] [21, 3] [22, 7], and the edges are: (0, 12) (0, 20) (0, 9) (1, 11) (1, 18) (2, 13) (2, 7) (2, 18) (2, 22) (3, 11) (3, 12) (3, 14) (3, 16) (4, 21) (4, 8) (4, 10) (4, 22) (4, 9) (4, 15) (5, 8) (5, 6) (6, 16) (7, 13) (8, 14) (8, 19) (9, 11) (10, 21) (10, 18) (10, 13) (11, 12) (11, 19) (11, 15) (11, 20) (11, 22) (14, 16) (14, 21) (16, 19) (18, 19) (18, 20) (19, 22). What is the maximum sum of the weights of three nodes? | ### 16 | [20, 25] | [7, 60] |
1730 | 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 23, weights of nodes are: [0, 5] [1, 9] [2, 9] [3, 3] [4, 10] [5, 5] [6, 4] [7, 5] [8, 10] [9, 6] [10, 5] [11, 9] [12, 6] [13, 9] [14, 1] [15, 5] [16, 6] [17, 10] [18, 9] [19, 8] [20, 3] [21, 2] [22, 8] [23, 5], and the edges are: (1, 12) (3, 7) (3, 21) (5, 23) (6, 18) (6, 22) (7, 21) (7, 12) (9, 19) (11, 20) (12, 14) (15, 22). What is the maximum sum of the weights of three nodes? | ### 10 | [20, 25] | [7, 60] |
1732 | 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 21, weights of nodes are: [0, 3] [1, 10] [2, 5] [3, 6] [4, 2] [5, 10] [6, 2] [7, 3] [8, 2] [9, 4] [10, 9] [11, 1] [12, 5] [13, 8] [14, 9] [15, 10] [16, 9] [17, 4] [18, 4] [19, 10] [20, 7] [21, 10], and the edges are: (0, 14) (0, 20) (0, 3) (0, 10) (1, 7) (1, 3) (1, 19) (2, 11) (2, 7) (3, 15) (3, 18) (3, 9) (3, 14) (4, 7) (4, 14) (4, 16) (4, 17) (5, 16) (5, 18) (6, 18) (6, 8) (7, 16) (7, 20) (8, 15) (12, 18) (12, 15) (13, 16) (13, 15) (15, 20) (17, 20) (19, 21) (20, 21). What is the maximum sum of the weights of three nodes? | ### 18 | [20, 25] | [7, 60] |
1734 | 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 22, weights of nodes are: [0, 9] [1, 6] [2, 3] [3, 7] [4, 2] [5, 5] [6, 6] [7, 1] [8, 2] [9, 10] [10, 4] [11, 6] [12, 3] [13, 2] [14, 10] [15, 3] [16, 2] [17, 2] [18, 5] [19, 9] [20, 1] [21, 10] [22, 7], and the edges are: (0, 4) (0, 9) (1, 6) (1, 10) (1, 12) (2, 13) (3, 20) (3, 6) (5, 17) (5, 20) (5, 10) (6, 8) (6, 12) (7, 12) (7, 21) (10, 13) (11, 19) (13, 16) (17, 20) (21, 22). What is the maximum sum of the weights of three nodes? | ### 15 | [20, 25] | [7, 60] |
1736 | 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 24, weights of nodes are: [0, 3] [1, 2] [2, 10] [3, 8] [4, 8] [5, 5] [6, 9] [7, 4] [8, 4] [9, 10] [10, 6] [11, 2] [12, 9] [13, 8] [14, 2] [15, 3] [16, 5] [17, 1] [18, 8] [19, 3] [20, 9] [21, 1] [22, 6] [23, 1] [24, 5], and the edges are: (0, 20) (0, 17) (0, 11) (0, 1) (0, 24) (1, 8) (1, 5) (1, 10) (1, 22) (2, 16) (2, 22) (2, 7) (2, 9) (2, 11) (3, 24) (3, 7) (3, 15) (4, 5) (4, 10) (5, 10) (5, 20) (5, 14) (6, 11) (6, 7) (6, 14) (7, 13) (9, 22) (10, 24) (11, 21) (12, 14) (12, 22) (14, 16) (14, 17) (15, 22) (15, 18) (18, 23) (19, 20) (19, 24) (20, 23) (21, 23). What is the maximum sum of the weights of three nodes? | ### 26 | [20, 25] | [7, 60] |
1738 | 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 22, weights of nodes are: [0, 9] [1, 10] [2, 8] [3, 5] [4, 7] [5, 1] [6, 6] [7, 1] [8, 4] [9, 1] [10, 1] [11, 6] [12, 9] [13, 1] [14, 4] [15, 1] [16, 2] [17, 4] [18, 9] [19, 2] [20, 6] [21, 5] [22, 9], and the edges are: (0, 7) (0, 14) (0, 17) (0, 13) (0, 19) (0, 15) (1, 6) (1, 17) (1, 19) (1, 8) (1, 7) (1, 9) (2, 18) (2, 13) (2, 12) (2, 19) (3, 20) (4, 21) (4, 11) (4, 12) (4, 18) (5, 7) (6, 16) (6, 18) (8, 15) (8, 14) (8, 18) (9, 20) (9, 21) (10, 16) (10, 11) (10, 19) (11, 17) (11, 12) (12, 18) (12, 15) (12, 17) (12, 22) (13, 17) (14, 21) (14, 18) (15, 22) (18, 21) (19, 21) (20, 21). What is the maximum sum of the weights of three nodes? | ### 26 | [20, 25] | [7, 60] |
1740 | 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, 5] [3, 3] [4, 4] [5, 4] [6, 1] [7, 3] [8, 10] [9, 7] [10, 1] [11, 2] [12, 7] [13, 1] [14, 8] [15, 7] [16, 5] [17, 5] [18, 7] [19, 7], and the edges are: (0, 17) (0, 11) (0, 15) (0, 13) (0, 3) (1, 3) (1, 14) (1, 8) (1, 16) (2, 8) (3, 6) (3, 11) (3, 16) (4, 12) (5, 12) (6, 7) (6, 13) (7, 18) (8, 13) (8, 14) (8, 15) (8, 11) (9, 11) (9, 10) (10, 13) (10, 12) (11, 17) (12, 14) (12, 13) (13, 16) (13, 14) (13, 17) (14, 19) (14, 18) (14, 17) (17, 19) (18, 19). What is the maximum sum of the weights of three nodes? | ### 23 | [20, 25] | [7, 60] |
1742 | 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 24, weights of nodes are: [0, 10] [1, 6] [2, 8] [3, 7] [4, 9] [5, 9] [6, 7] [7, 5] [8, 4] [9, 1] [10, 2] [11, 5] [12, 8] [13, 6] [14, 4] [15, 1] [16, 3] [17, 10] [18, 9] [19, 4] [20, 10] [21, 4] [22, 10] [23, 8] [24, 2], and the edges are: (0, 13) (0, 14) (0, 22) (1, 11) (1, 4) (1, 22) (1, 16) (1, 20) (1, 18) (1, 24) (2, 22) (2, 12) (2, 7) (4, 24) (4, 20) (5, 11) (5, 13) (5, 6) (6, 24) (6, 15) (6, 21) (6, 22) (7, 12) (7, 10) (7, 19) (8, 21) (8, 10) (9, 22) (9, 10) (9, 11) (9, 21) (9, 14) (10, 16) (10, 24) (10, 17) (11, 14) (11, 19) (12, 18) (12, 24) (14, 16) (14, 15) (15, 21) (20, 21) (22, 23). What is the maximum sum of the weights of three nodes? | ### 25 | [20, 25] | [7, 60] |
1744 | 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 24, weights of nodes are: [0, 8] [1, 7] [2, 10] [3, 2] [4, 8] [5, 9] [6, 6] [7, 10] [8, 6] [9, 10] [10, 2] [11, 4] [12, 2] [13, 8] [14, 5] [15, 2] [16, 4] [17, 9] [18, 2] [19, 8] [20, 6] [21, 4] [22, 1] [23, 10] [24, 1], and the edges are: (0, 4) (0, 23) (0, 6) (0, 17) (1, 11) (1, 5) (1, 15) (1, 23) (2, 16) (2, 6) (2, 9) (2, 8) (2, 7) (3, 4) (4, 21) (4, 15) (4, 17) (4, 8) (4, 24) (4, 10) (4, 7) (4, 22) (5, 7) (5, 20) (5, 11) (6, 21) (6, 9) (7, 17) (7, 13) (7, 15) (9, 21) (9, 10) (10, 22) (10, 16) (11, 13) (11, 15) (11, 24) (12, 16) (12, 14) (13, 20) (14, 18) (15, 22) (15, 18) (16, 18). What is the maximum sum of the weights of three nodes? | ### 27 | [20, 25] | [7, 60] |
1746 | 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, 4] [2, 5] [3, 8] [4, 3] [5, 1] [6, 5] [7, 1] [8, 5] [9, 5] [10, 7] [11, 10] [12, 9] [13, 7] [14, 8] [15, 10] [16, 5] [17, 5] [18, 9] [19, 7], and the edges are: (0, 15) (0, 16) (1, 9) (2, 7) (4, 5) (5, 18) (5, 10) (7, 10) (7, 16) (8, 16) (9, 10) (10, 12) (10, 19) (10, 16) (16, 19) (17, 19). What is the maximum sum of the weights of three nodes? | ### 19 | [20, 25] | [7, 60] |
1748 | 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 21, weights of nodes are: [0, 2] [1, 6] [2, 8] [3, 6] [4, 10] [5, 8] [6, 8] [7, 2] [8, 6] [9, 5] [10, 10] [11, 9] [12, 8] [13, 9] [14, 3] [15, 1] [16, 8] [17, 9] [18, 1] [19, 7] [20, 8] [21, 9], and the edges are: (1, 6) (1, 20) (1, 19) (2, 8) (2, 3) (2, 21) (2, 11) (2, 13) (3, 13) (3, 5) (3, 19) (3, 7) (3, 8) (4, 15) (4, 16) (5, 17) (5, 13) (5, 10) (6, 21) (6, 11) (6, 16) (7, 13) (7, 17) (8, 17) (8, 9) (9, 17) (9, 19) (10, 17) (10, 15) (10, 18) (12, 19) (16, 17) (18, 20). What is the maximum sum of the weights of three nodes? | ### 27 | [20, 25] | [7, 60] |
1750 | 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, 4] [1, 5] [2, 3] [3, 5] [4, 9] [5, 5] [6, 1] [7, 2] [8, 5] [9, 2] [10, 6] [11, 1] [12, 3] [13, 1] [14, 5] [15, 10] [16, 7] [17, 3] [18, 8] [19, 3], and the edges are: (0, 15) (0, 18) (1, 7) (1, 2) (1, 10) (1, 18) (1, 11) (2, 16) (2, 19) (3, 19) (4, 19) (4, 12) (4, 7) (4, 15) (5, 16) (6, 15) (6, 14) (7, 12) (7, 19) (8, 15) (9, 12) (9, 15) (10, 18) (11, 18) (14, 17) (16, 17). What is the maximum sum of the weights of three nodes? | ### 19 | [20, 25] | [7, 60] |
1752 | 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 21, weights of nodes are: [0, 7] [1, 6] [2, 8] [3, 7] [4, 7] [5, 6] [6, 2] [7, 3] [8, 10] [9, 5] [10, 1] [11, 4] [12, 2] [13, 1] [14, 6] [15, 6] [16, 9] [17, 3] [18, 5] [19, 5] [20, 5] [21, 9], and the edges are: (0, 16) (0, 9) (0, 19) (0, 3) (0, 18) (0, 5) (2, 18) (2, 10) (2, 21) (2, 4) (3, 15) (3, 9) (4, 8) (4, 20) (4, 7) (5, 12) (5, 19) (5, 16) (5, 18) (5, 20) (6, 12) (6, 9) (7, 10) (8, 18) (9, 16) (10, 19) (11, 13) (11, 14) (11, 19) (12, 19) (12, 21) (12, 14) (13, 16) (15, 16) (16, 18) (17, 18) (18, 19) (18, 20) (18, 21) (20, 21). What is the maximum sum of the weights of three nodes? | ### 22 | [20, 25] | [7, 60] |
1754 | 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 24, weights of nodes are: [0, 10] [1, 6] [2, 10] [3, 2] [4, 5] [5, 8] [6, 6] [7, 4] [8, 2] [9, 9] [10, 3] [11, 8] [12, 9] [13, 3] [14, 8] [15, 10] [16, 8] [17, 9] [18, 9] [19, 7] [20, 1] [21, 8] [22, 3] [23, 9] [24, 7], and the edges are: (0, 23) (0, 24) (0, 21) (0, 17) (0, 8) (0, 15) (1, 6) (2, 3) (2, 17) (3, 8) (3, 7) (4, 21) (4, 11) (5, 23) (5, 13) (9, 22) (9, 23) (9, 19) (9, 20) (10, 19) (10, 22) (11, 21) (13, 15) (14, 16) (14, 22) (15, 17) (17, 22) (19, 22) (20, 24) (20, 22). What is the maximum sum of the weights of three nodes? | ### 29 | [20, 25] | [7, 60] |
1756 | 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 21, weights of nodes are: [0, 9] [1, 6] [2, 7] [3, 4] [4, 10] [5, 4] [6, 10] [7, 4] [8, 3] [9, 9] [10, 7] [11, 9] [12, 9] [13, 8] [14, 1] [15, 3] [16, 1] [17, 4] [18, 9] [19, 9] [20, 8] [21, 4], and the edges are: (0, 16) (0, 13) (0, 12) (0, 11) (1, 6) (2, 19) (3, 7) (3, 16) (3, 8) (3, 12) (4, 15) (5, 9) (5, 15) (5, 11) (5, 17) (5, 18) (5, 10) (6, 17) (6, 16) (7, 14) (7, 12) (8, 11) (8, 19) (8, 15) (8, 9) (8, 14) (9, 11) (9, 10) (10, 13) (10, 16) (11, 21) (11, 14) (11, 16) (12, 19) (12, 15) (13, 21) (13, 18) (13, 17) (16, 20) (16, 17) (17, 21) (18, 21) (19, 20). What is the maximum sum of the weights of three nodes? | ### 22 | [20, 25] | [7, 60] |
1758 | 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 20, weights of nodes are: [0, 7] [1, 10] [2, 7] [3, 5] [4, 6] [5, 9] [6, 9] [7, 3] [8, 8] [9, 10] [10, 6] [11, 5] [12, 1] [13, 2] [14, 3] [15, 10] [16, 7] [17, 4] [18, 9] [19, 10] [20, 9], and the edges are: (0, 14) (0, 2) (1, 15) (2, 14) (2, 6) (2, 8) (3, 8) (3, 13) (3, 4) (3, 11) (4, 12) (4, 11) (5, 10) (6, 11) (6, 16) (6, 13) (7, 16) (7, 20) (8, 10) (8, 17) (9, 14) (10, 17) (10, 16) (12, 16) (13, 15) (14, 17) (15, 19) (19, 20). What is the maximum sum of the weights of three nodes? | ### 18 | [20, 25] | [7, 60] |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.