哲学家就餐问题，有左撇子，至少使用信号量、消息通信、管程三种方式之中的一种模拟哲学家就餐问题。

用一个输入变量控制是否有左撇子哲学家。如果有，其数量由随机数生成。

模拟程序分为两种情况，

可能发生死锁的情况，输出发生死锁时的资源分配状态和历史资源分配状态；

设计没有死锁发生的程序，当每个哲学家至少完成一次就餐后，输出资源分配给哲学家的当前状态和历史状态。

最好具备图形界面，动态显示哲学家就餐的过程。-Dining philosophers problem, a left-handed, at least the use of semaphores, messaging, tube three ways a simulated dining philosophers problem.



With an input variable to control whether a left-handed philosopher. If there is, its numbers by random number generation.



Simulation program is divided into two situations,



A deadlock can occur in the case of death, when the lock output of resource allocation state and historical resource allocation state



Design without a deadlock occurs when the program, each philosopher completion of at least one meal, output the resources allocated to the philosopher s current and historical status.



Best to have a graphical interface, dynamic display of the dining philosophers process.