Search - n2-1 - CodeBus

Search - n2-1 - List

[VC/MFC] my-game-N2 DL : 0: 学习vc的简单应用，对于初学者有很大的帮助，希望朋友们下载看看。-Simple application of learning vc, very helpful for beginners, I hope you will download to see.
Date : 2026-01-08 Size : 1.97mb User : zhuxiaolei
[VC/MFC] cpp2poly.pdf.tar DL : 0: Cours N2 en c++ du professeur lombardy
Date : 2026-01-08 Size : 351kb User : didine
[VC/MFC] exam2008.pdf.tar DL : 0: Examen N2 en C++ du professeur Lombardy
Date : 2026-01-08 Size : 22kb User : didine
[VC/MFC] chuanjiaoshi DL : 0: 问题描述：有三个牧师和三个野人过河，只有一条能装下两个人的船，在河的任何一方或者船上，如果野人的人数大于牧师的人数，那么牧师就会有危险。你能不能找出一种安全的渡河方法呢？这个问题可以扩展为N1个牧师和N2野人，而船一次可以装下M个人的情况。要求：（1）给出可能的方法总数，并描述每种方法的具体实现过程；（2）当输入N1,N2,M的值时，输出程序的运行结果。-Problem Description: There are three priests and three wild men across the river, only one can hold two people in the boat, either side of the river or boat, if the number of savages than the number of priests, then the priest will be in danger. Can you cross the river to find a safe method? This problem can be extended to N1 and N2 wild man a priest, and the ship can hold an M individual situation. Requirements: (1) gives the total number of possible methods, and describe the concrete realization of each method (2) when the input N1, N2, M value, the output of the running results.
Date : 2026-01-08 Size : 2kb User : 李晨