武汉理工大学2013年蓝桥杯试题（国外英文资料）.doc

武汉理工大学2013年蓝桥杯试题（国外英文资料） 1 title: full binary tree In general, binary trees are stored by data structures that contain Pointers. But for special cases, you can also simplify storage. For example, in the case of a binary tree, all nodes have a complete left and right child, except for the last layer of leaves. We can put the nodes in an array according to the order of the tree. Of course, you need to compute its parent node or two child nodes from the sequence number of a node. The goal of the code below is to find the parent of a node. Please fill in the missing code. / / return the parent node data of the k node / / data: an array of binary trees / / k: the index number of the current node (that is, array index, starting at 0) Int get_parent (int * data, int k) { Return data [___________]; / / fill in position } Please submit the answers in strict accordance with the browser. Note: only submit the missing sections of the underlined section, and do not write other additional content, such as declarative text. Note the type of compiler you choose to use Title: the kings troubles C is made up of n islands, and in order to facilitate the contact between the islands, C has built an m bridge between the islands, each bridge connecting two small islands. There may be several Bridges between the two islands. However, some Bridges are at risk of not being used because of the water washing. If all the Bridges between the islands were not available, the two islands could not be reached directly. However, as long as the inhabitants of these two islands can reach each other through other Bridges or other islands, they will be safe. But if there was another way to get there the day before, and the day after that, the residents would protest together. Now the king of C has learned the number of days each bridge can use, which is beyond the number of days. Now he wants to know how many days residents will protest. [input format] The first line of input contains two integers n, m,