CODEFORCES Bayan 2015 Contest Warm Up A题= =WA啦！~~！！！

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.#.#.#.#.#.|.|)
+------------------------+

晚上比赛做的时候忘了测试k=0的数据了...竟然还能过protest~！！！！

后来第二天就发现错在第五个样例了

具体错在哪儿在代码里面有标出

#include <iostream>
#include <string.h>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <memory.h>
#include <string>
#include <vector>
#include <list>
#include <map>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <numeric>
#include <functional>
#define maxn 1000005

using namespace std;
int a[10][4];

int main()
{
    int k;
    cin>>k;
    int a,b,c;
    if(k<4){
        b=0,c=k%4;
    }
    else{
        b=(k-4)/3;
        b+=1;
        c=(k-4)%3;
    }
    int t=4;
    cout<<"+------------------------+"<<endl;
    while(t--){
        if(t==1){
            if((c--)>0||b>=1) cout<<"|O.......................|"<<endl;
            else cout<<"|#.......................|"<<endl;  //WA在这里是"|........................|"
            continue;
        }
        cout<<"|";
        for(int i=0;i<b;i+=1) cout<<"O.";
        if((c--)>0) cout<<"O.";
        else if(k!=34) cout<<"#.";
        for(int i=0;i<11-b-1;i+=1){
            cout<<"#.";
        }
        if(t==3) cout<<"|D|)"<<endl;
        else if(t==2) cout<<"|.|"<<endl;
        else if(t==1) cout<<"..|"<<endl;
        else if(t==0) cout<<"|.|)"<<endl;
    }
    cout<<"+------------------------+"<<endl;
}