← 返回题目

题库练习 Coder

← 上一题下一题 →

A9317 | $Coder$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

Iahub likes chess very much. He even invented a new chess piece named Coder. A Coder can move (and attack) one square horizontally or vertically. More precisely, if the Coder is located at position $(x,y)$ , he can move to (or attack) positions $(x+1,y)$ , $(x-1,y)$ , $(x,y+1)$ and $(x,y-1)$ . Iahub wants to know how many Coders can be placed on an $n\timesn$ chessboard, so that no Coder attacks any other Coder.

输入格式

The first line contains an integer $n$ $(1<=n<=1000)$ .

输出格式

On the first line print an integer, the maximum number of Coders that can be placed on the chessboard. On each of the next $n$ lines print $n$ characters, describing the configuration of the Coders. For an empty cell print an '.', and for a Coder print a 'C'. If there are multiple correct answers, you can print any.

输入输出样例

输入 #1

输出 #1

2
C.
.C

C++ 编辑器

输入

输出