用C语言实现m/m/c排队论模型，模型中总资源数为C，计算当发起一个新的呼叫时的阻塞率。-m/m/c queuing model， the total resources in the server is C, calculate the blocking probability for a new call arrival at the state 。

应用数据结构解决约瑟夫环的问题，现实中环形排队的模型。-Josephus application data structures to solve problems, in reality, the ring queuing models.