38static unsigned long int lcg_seed = 0;
41 lcg_seed = ((lcg_seed * 11321) + 1) % 32575;
42 return (
int) (((double) lcg_seed / 32575.0) *
n);
47 const int numberOfTellers = 5;
48 const int numberOfMinutes = 60;
50 int numberOfCustomers = 0;
52 std::vector<Teller> teller (numberOfTellers);
53 std::queue<Customer>
line;
55 for (
int t = 0;
t < numberOfMinutes;
t++) {
59 for (
int i = 0;
i < numberOfTellers;
i++) {
60 if (teller[
i].isFree () && !
line.empty ()) {
64 teller[
i].addCustomer (frontCustomer);
70 std::cout <<
"average wait: "
71 << (totalWait / numberOfCustomers) << std::endl;