【CODEFORCES】 A. Bayan Bus

A. Bayan Bus

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

Input

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

Output

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.

Sample test(s)

input

9

output

+------------------------+
|O.O.O.#.#.#.#.#.#.#.#.|D|)
|O.O.O.#.#.#.#.#.#.#.#.|.|
|O.......................|
|O.O.#.#.#.#.#.#.#.#.#.|.|)
+------------------------+

input

20

output

+------------------------+
|O.O.O.O.O.O.O.#.#.#.#.|D|)
|O.O.O.O.O.O.#.#.#.#.#.|.|
|O.......................|
|O.O.O.O.O.O.#.#.#.#.#.|.|)
+------------------------+

题解：简单模拟即可。（如果这也算题解的话...）

代码倒是写的有点长。

#include <iostream>

using namespace std;

int prin(int n)
{
    int i=n;
    while (i>0)
    {
        cout <<"O.";
        i--;
    }
    return 11-n;
}

void s_prin(int n)
{
    int i=n;
    while (i>0)
    {
        cout <<"#.";
        i--;
    }
}

int main()
{
    int k,n,m,b;
    cin >>k;
    //first line
    cout <<"+------------------------+"<<endl;
    if (k-4>0)
    {
        n=(k-4)%3;
        m=(k-4)/3;
    //second line
    cout <<"|";
    if (n)
    {
        b=prin(m+2);
        n--;
    }
    else b=prin(m+1);
    s_prin(b);
    cout <<"|D|)"<<endl;
    //third line
    cout <<"|";
    if (n)
    {
        b=prin(m+2);
        n--;
    }
    else b=prin(m+1);
    s_prin(b);
    cout <<"|.|"<<endl;
    // fourth line
    cout <<"|O.......................|"<<endl;
    // fivth line
    cout <<"|";
    b=prin(m+1);
    s_prin(b);
    cout <<"|.|)"<<endl;
    //the last
    cout <<"+------------------------+"<<endl;
    }
    else
    {
        //second line
        cout <<"|";
        if (k)
        {
             b=prin(1);
             s_prin(10); k--;
        }
        else  s_prin(11);
        cout <<"|D|)"<<endl;
        //third line
        cout <<"|";
        if (k)
        {
             b=prin(1);
             s_prin(10); k--;
        }
        else  s_prin(11);
        cout <<"|.|"<<endl;
        //fourth line
        if (k) { cout <<"|O.......................|"<<endl; k--; }
        else cout <<"|#.......................|"<<endl;
        //fivth line
        cout <<"|";
        if (k)
        {
             b=prin(1);
             s_prin(10); k--;
        }
        else s_prin(11);  cout <<"|.|)"<<endl;
        cout <<"+------------------------+"<<endl;
    }
    return 0;
}