I want to solve Project Euler problem number 68 in C #, but I still do not understand this question clearly. What does the external node mean in this statement of the problem?
Consider the following “magic” 3-sided ring, filled with numbers 1 to 6, and each line is added to nine. 4 \ 3 / \ 1 - 2 - 6 / 5 It works clockwise , and starting with a group of three people with a numerically low external node (4.3.2 in this example), each solution can be uniquely described. For example, the above solution may be described in a variety of: 4,3,2; 6.2.1; 5.1.3.
Consider the following “magic” 3-sided ring, filled with numbers 1 to 6, and each line is added to nine.
4 \ 3 / \ 1 - 2 - 6 / 5
It works clockwise , and starting with a group of three people with a numerically low external node (4.3.2 in this example), each solution can be uniquely described. For example, the above solution may be described in a variety of: 4,3,2; 6.2.1; 5.1.3.
' node' node, (). 4, 5 6 .", ", ?
, " ", 9 - . " " , .
@ : "4,3,2; 6,2,1; 5,1,3 ' > ' 4,2,3; 5,3,1; 6,1,2 ', 432621513 > 423531612. , .
: " , 9- , 3- - 432621513".
What does "maximum" mean? Why? 4.3.2; 6.2.1; 5.1.3 & apos;> 4.2.3; 5.3.1; 6.1.2? This, of course, makes no sense in terms of set theory ...