Codeforces 989C A Mist of Florescence 构造

C. A Mist of Florescence

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

There are four kinds of flowers in the wood, Amaranths, Begonias, Centaureas and Dianthuses.

The wood can be represented by a rectangular grid of $n$ rows and $m$ columns. In each cell of the grid, there is exactly one type of flowers.

According to Mino, the numbers of connected components formed by each kind of flowers are $a$, $b$, $c$ and $d$ respectively. Two cells are considered in the same connected component if and only if a path exists between them that moves between cells sharing common edges and passes only through cells containing the same flowers.

You are to help Kanno depict such a grid of flowers, with $n$ and $m$ arbitrarily chosen under the constraints given below. It can be shown that at least one solution exists under the constraints of this problem.

Note that you can choose arbitrary $n$ and $m$ under the constraints below, they are not given in the input.

Input

The first and only line of input contains four space-separated integers $a$, $b$, $c$ and $d$ ($1\le a,b,c,d\le 100$) — the required number of connected components of Amaranths, Begonias, Centaureas and Dianthuses, respectively.

Output

In the first line, output two space-separated integers $n$ and $m$ ($1\le n,m\le 50$) — the number of rows and the number of columns in the grid respectively.

Then output $n$ lines each consisting of $m$ consecutive English letters, representing one row of the grid. Each letter should be among 'A', 'B', 'C' and 'D', representing Amaranths, Begonias, Centaureas and Dianthuses, respectively.

In case there are multiple solutions, print any. You can output each letter in either case (upper or lower).

Examples

input

Copy

5 3 2 1

output

Copy

4 7
DDDDDDD
DABACAD
DBABACD
DDDDDDD

input

Copy

50 50 1 1

output

Copy

4 50
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
ABABABABABABABABABABABABABABABABABABABABABABABABAB
BABABABABABABABABABABABABABABABABABABABABABABABABA
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD

input

Copy

1 6 4 5

output

Copy

7 7
DDDDDDD
DDDBDBD
DDCDCDD
DBDADBD
DDCDCDD
DBDBDDD
DDDDDDD

Note

In the first example, each cell of Amaranths, Begonias and Centaureas forms a connected component, while all the Dianthuses form one.

一开始想了一个特别麻烦的构造法，本辣鸡2h以内写不出来的那种。最后思路参照了其他博客里的。每个色块最多一百种，棋盘最大却有2500，完全可以把棋盘分为四部分，每个部分有个背景色，背景色里丢进去几个小色块，完全丢得开。a色里丢d，b色里丢c，c色里丢b，d色里丢a，丢的小色块个数比要求的个数少一。这种构造法可真是太机智了，它告诉我们做题一定要注意看数据范围呀！
贴上重复且重复的代码：

#include<iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>
using namespace std;

int mapp[100][100];
int a[5];

int main()
{
    memset(mapp,0,sizeof(mapp));
    for (int i=1; i<=4; i++)
    {
        scanf("%d",&a[i]);
        a[i]--;
    }
    int p=2; int q=2;
    for (int i=1; i<=a[1]; i++)
    {
        mapp[p][q]=1;
        p+=2;
        if (p>24)
        {
            p=2; q+=2;
        }
    }
    p=27; q=2;
    for (int i=1; i<=a[2]; i++)
    {
        mapp[p][q]=2;
        p+=2;
        if (p>49)
        {
            p=27; q+=2;
        }
    }
    p=2; q=27;
    for (int i=1; i<=a[3]; i++)
    {
        mapp[p][q]=3;
        p+=2;
        if (p>24)
        {
            p=2; q+=2;
        }
    }
    p=27; q=27;
    for (int i=1; i<=a[4]; i++)
    {
        //cout<<"p="<<p<<" q="<<q<<endl;
        mapp[p][q]=4;
        p+=2;
        if (p>49)
        {
            p=27; q+=2;
        }
    }
    cout<<"50 50"<<endl;
    for (int i=1; i<=50; i++)
    {
        for (int j=1; j<=50; j++)
        {
            if (mapp[i][j]==1 || mapp[i][j]==0 && i>=26 &&j>=26) cout<<'A';
            else if (mapp[i][j]==2 || mapp[i][j]==0 && i<=25 &&j>=26) cout<<'B';
            else if (mapp[i][j]==3 || mapp[i][j]==0 && i>=26 && j<=25) cout<<'C';
            else cout<<'D';
        }
        cout<<endl;
    }
    return 0;
}