Solving the problem of E. Dijkstra's dining philosophers
There are two solutions to this problem in this project. In the first part, the problem is solved using threads. In the second (bonus) part, the problem is solved using processes. The program outputs the time, the number of the philosopher and what he is doing at the moment. More information about the task and rules can be found in subject.
