Посмотрите следущие задачи. Можете решить их

[Жандарбекова]

License to Match
In preparation of a highly dangerous mission, the participating agents of the gargantuan Liecht-ensteinian secret service (LSS) need to work in pairs of two for safety reasons. All members in the LSS are organized in a tree hierarchy. Communication is only possible via the official channel: an agent has a secure phone line to his direct superior and a secure phone line to each of his direct subordinates. Initially, each agent knows whether or not he is taking part in this mission. The goal is for each agent to find a partner.
Devise an algorithm that will match up a participating agent with another participating agent given the constrained communication scenario. A \match" consists of an agent knowing the identity of his partner and the path in the hierarchy connecting them. Assume that there is an even number of participating agents so that each one is guaranteed a partner. Furthermore, observe that the phone links connecting two paired-up agents need to remain open at all times. Therefore, you cannot use the same link (i.e., an edge) twice when connecting agents with their partners.

License to Distribute
We consider another day at the office of the LSS as in Exercise 13. After the above mission was successful, the involved agents collected a large number of sensitive documents. Some agents might have a lot of them and others have none. Now they need to distribute the documents throughout the agency such that each person in the LSS has the same amount of data to process.
Assume that there are n agents in the LSS and that there is also a total of n documents. Devise a way for the agents to distribute their sensitive data: In the end, each agent should have exactly one document. The communication scheme is the same as above.