codeforces A. Bayan Bus(简单模拟)

#include <queue>
#include <string>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#define N 20000
using namespace std;

int num[5][15];

int main()
{
    int n;
    cin>>n;
    for(int j=1; j<=11 && n; ++j){
        for(int i=1; i<=4; ++i){
            if(j>1 && i==3) continue;
            --n;
            num[i][j] = 1;
            if(n == 0) break;
        }
    } 

    printf("+------------------------+\n");
    for(int i = 1; i<=4; ++i){
        printf("|");
        for(int j=1; j<=11; ++j){
            if(num[i][j]) printf("O.");
            else{
                if( i != 3 || (i==3 && j==1))
                    printf("#.");
                else printf("..");
            }
        }
        if(i == 1) printf("|D|)\n");
        if(i==2) printf("|.|\n");
        if(i==3) printf("..|\n");
        if(i==4) printf("|.|)\n");
    }
    printf("+------------------------+\n");
    return 0;
}