Welcome![Sign In][Sign Up]
Location:
Downloads SourceCode Mathimatics-Numerical algorithms Algorithm
Title: gansidui Download
 Description: M squads to blow up the enemy bunkers, no one wanted to go, the platoon leader decided to use the cycle count of the way to decide which fighters to perform the task. , Will have to dispatch a soldier to go before a soldier did not complete the task. Now compiled one for each soldier, we were sitting in a circle and start counting from a soldier casually, when the count to 5, the soldiers went to the mission, this soldier is no longer participate in the next round of counting. If this soldier did not complete the task, and began to count again from the next soldier, to be the number of Section 5, this warrior went on to perform the task. And so on, until the task is completed. The platoon leader is unwilling to assume on the 1st platoon leader, you design a program, find start counting from the first of several soldiers in order to allow the platoon leader to the last one to stay rather than to perform the task.
 Downloaders recently: [More information of uploader 2323175453]
 To Search:
File list (Check if you may need any files):
gansidui\敢死队问题.doc
........\敢死队问题(无注释).c
........\敢死队问题(无注释).o
gansidui
    

CodeBus www.codebus.net