CodeForces - 989C A Mist of Florescence （思维构图）

A Mist of Florescence

 

As the boat drifts down the river, a wood full of blossoms shows up on the riverfront.

"I've been here once," Mino exclaims with delight, "it's breathtakingly amazing."

"What is it like?"

"Look, Kanno, you've got your paintbrush, and I've got my words. Have a try, shall we?"

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

The wood can be represented by a rectangular grid of nn rows and mm 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 aa, bb, cc and dd 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 nn and mm 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 nn and mm under the constraints below, they are not given in the input.

Input

The first and only line of input contains four space-separated integers aa, bb, cc and dd (1≤a,b,c,d≤1001≤a,b,c,d≤100) — the required number of connected components of Amaranths, Begonias, Centaureas and Dianthuses, respectively.

Output

In the first line, output two space-separated integers nn and mm (1≤n,m≤501≤n,m≤50) — the number of rows and the number of columns in the grid respectively.

Then output nn lines each consisting of mm 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

5 3 2 1

Output

4 7
DDDDDDD
DABACAD
DBABACD
DDDDDDD

Input

50 50 1 1

Output

4 50
CCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCCC
ABABABABABABABABABABABABABABABABABABABABABABABABAB
BABABABABABABABABABABABABABABABABABABABABABABABABA
DDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDDD

Input

1 6 4 5

Output

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.

 

题目链接： http://codeforces.com/problemset/problem/989/C

题目大意：现有四个字母ABCD，要用着四种字母构成一个不大于50*50的图，要求图中‘A'  'B'  'C'  'D' 四个字母的连通块分别为a,b,c,d个。输出构成的图的大小和图

思路：因为连通块的个数不会超过100，且图最大可为50*50，所以不管连通块数有多少都可以直接构成50*50的图，把50*50 的图平均分成四块，分别放ABCD，左上放A，右下放B，C，D分别在左下，右上。

 

 

   

在每一块中，字母按上面方式填入，然后在A块中把空的位置填上B，其余块填A。

 

代码：

#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
using namespace std;
#define ll long long
char e[50][50];
int main()
{
    int a,b,c,d;
    while(~scanf("%d%d%d%d",&a,&b,&c,&d))
    {
        memset(e,0,sizeof(e));
        a-=1; //在其余块填充A会有一个连通块
        for(int i=0;i<24;i+=2)
        {
            if(a==0) break;
            for(int j=0;j<24;j+=2)
            {
                if(a==0) break;
                e[i][j]='A';
                a--;
            }
        }
        for(int i=0;i<24;i+=2)
        {
            if(c==0) break;
            for(int j=25;j<50;j+=2)
            {
                if(c==0) break;
                e[i][j]='C';
                c--;
            }
        }
        for(int i=25;i<50;i+=2)
        {
            if(d==0) break;
            for(int j=0;j<24;j+=2)
            {
                if(d==0) break;
                e[i][j]='D';
                d--;
            }
        }
        b-=1;  //在A块填充B会有一个连通块
        for(int i=25;i<50;i+=2)
        {
            if(b==0) break;
            for(int j=25;j<50;j+=2)
            {
                if(b==0) break;
                e[i][j]='B';
                b--;
            }
        }
        printf("50 50\n");
        for(int i=0;i<50;i++)
            for(int j=0;j<50;j++)
        {
            if(e[i][j]>='A') printf("%c",e[i][j]);
            else
            {
                if(i<25&&j<25) printf("B");
                else printf("A");
            }
            if(j==49) printf("\n");
        }
    }
    return 0;
}