시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
2 초 | 1024 MB | 90 | 61 | 58 | 69.048% |
Given is a square grid of $N \times N$ squares. Your task is to paint each square of the grid either white or black such that:
It can be shown that such a construction always exists.
The input consists of one integer $N$ ($2 \le N \le 500$).
Print $N$ lines. On the $i$-th line, print a string of length $N$ consisting of characters 'B
' and 'W
'. The $j$-th character in the $i$-th string corresponds to the square in $i$-th row and $j$-th column: 'B
' denotes black squares and 'W
' denotes white squares.
3
WWB BWB WWW