Little Artemtime(思维)

本文介绍了一种解决编程竞赛中特定问题的方法,该问题涉及在给定约束条件下找到一种黑白棋盘布局,使得黑色单元格与至少一个白色邻居相邻的数量比白色单元格与至少一个黑色邻居相邻的数量多一。文章提供了代码示例和解决策略。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

                      limit per test1 second
               memory limit per test256 megabytes
                      inputstandard input
                      outputstandard output

Young boy Artem tries to paint a picture, and he asks his mother Medina to help him. Medina is very busy, that’s why she asked for your help.Artem wants to paint an n×mn×m board. Each cell of the board should be colored in white or black.Lets BB be the number of black cells that have at least one white neighbor adjacent by the side. Let WW be the number of white cells that have at least one black neighbor adjacent by the side. A coloring is called good if B=W+1B=W+1.The first coloring shown below has B=5B=5 and W=4W=4 (all cells have at least one neighbor with the opposite color). However, the second coloring is not good as it has B=4B=4, W=4W=4 (only the bottom right cell doesn’t have a neighbor with the opposite color).
在这里插入图片描述
Please, help Medina to find any good coloring. It’s guaranteed that under given constraints the solution always exists. If there are several solutions, output any of them.

Input

Each test contains multiple test cases.The first line contains the number of test cases tt (1≤t≤201≤t≤20). Each of the next tt lines contains two integers n,mn,m (2≤n,m≤1002≤n,m≤100) — the number of rows and the number of columns in the grid.

Output

For each test case print nn lines, each of length mm, where ii-th line is the ii-th row of your colored matrix (cell labeled with ‘B’ means that the cell is black, and ‘W’ means white). Do not use quotes.It’s guaranteed that under given constraints the solution always exists.

Example

Input
2
3 2
3 3
Output
BW
WB
BB
BWB
BWW
BWB

NoteIn the first testcase, B=3B=3, W=2W=2.In the second testcase, B=5B=5, W=4W=4. You can see the coloring in the statement.

大家好,我是弱弱,为什么要深夜放毒呢,自然是因为我想纪念一下自己不仔细审题(没长脑子),当然了这跟我的差劲的英文也是有关的(要是我的英文很好,我估计会更喜欢打CF,不至于像现在这么艰难/(ㄒoㄒ)/~~),所以说好好学英语吧,加油(ง •_•)ง!!

思路

就是找规律,主要是题意,懂了题,自然会做
给你两个样例你就明白了
3 2
BB
BW
BW

3 3
BBB
BWW
BWW

好了,样例在这,就不用我多说了吧,人家没规定B的数量就得是最多的(我就是犯的这错误)

最后还得感谢ybl大佬为弱弱我指点迷津(叩谢)、

哦,不能忘了代码:

#include<iostream>
using namespace std;
int main()
{
     ios::sync_with_stdio(false);
     int t,m,n;
     cin>>t;
     while(t--)
     {
           cin>>m>>n;
           for(int i=1;i<=m;i++)
           {
                 for(int j=1;j<=n;j++)
                 {
                       if(i==1) cout<<'B';
                       else if(j==1)
                       {
                             cout<<'B';
                       }
                       else cout<<'W';
                 }
                 cout<<endl;
            }
      }
      return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值