VBA – Bayan Bus Algorithms

Some one year ago there was something called Bayan 2015 Contest, published in codeforces.com. Thus, I have decided to solve one of the contest problems with VBA in Excel. And actually, as expected I have managed to do it! 😀

Here is the contest link of the problem

The problem looks like this:

The final round of Bayan Programming Contest will be held in Tehran, and the participants will be carried around with a yellow bus. The bus has 34 passenger seats: 4 seats in the last row and 3 seats in remaining rows.

The event coordinator has a list of k participants who should be picked up at the airport. When a participant gets on the bus, he will sit in the last row with an empty seat. If there is more than one empty seat in that row, he will take the leftmost one.

In order to keep track of the people who are on the bus, the event coordinator needs a figure showing which seats are going to be taken by k participants. Your task is to draw the figure representing occupied seats.


The only line of input contains integer k, (0 ≤ k ≤ 34), denoting the number of participants.


Print the figure of a bus with k passengers as described in sample tests. Character ‘#‘ denotes an empty seat, while ‘O‘ denotes a taken seat. ‘D‘ is the bus driver and other characters in the output are for the purpose of beautifying the figure. Strictly follow the sample test cases output format. Print exactly six lines. Do not output extra space or other characters.

So, what did I do? An Excel formula, getting the input and giving the output. Of course, the font must be a console font, where all signs take the same width and height. Pretty much like this:


What I do in my code? I simply take the bus as an array of strings and I change each seat correspondingly to taken or to not taken. The trick is to know which is the next seat, as far as the last row has 4 seats and the others have 3. That’s why I have so many conditions. If you run the public sub TestBus(), you would get all the possibilities in the console :D.

Long story short – that is it! 😀

Here comes the code:


Available in GitHub.com as well!

Tagged with: , ,