Description: Missionaries and savages in C to solve the problem. There are N and N Savage missionaries came to the river ready to cross the river, there is a river boat, as much as for each individual by crossing k. Missionaries to be safe, at any time, Savage River and the boat can not exceed the number of missionaries is always the number (the number of missionaries, except for the 0). Solving a missionary and Savage can make all the ferry to safety from the left bank of the right bank of the process.
To Search:
File list (Check if you may need any files):
bin
readme.txt
src
...\1.txt
...\2.txt
...\a.exe
...\one.cpp
Download