本文主要是介绍Codeforces 384A - Coder，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
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 × n chessboard, so that no Coder attacks any other Coder.
Input
The first line contains an integer n (1 ≤ n ≤ 1000).
Output
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.
Examples
inputCopy
2
outputCopy
2
C.
.C
直接交替输出，不解释
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>using namespace std;typedef long long ll;
const int maxn = 3e5 + 7;
const int mod = 1e9 + 7;int main() {int n;scanf("%d",&n);printf("%d\n",((n + 1)) / 2 * ((n + 1) / 2) + (n / 2) * (n / 2));for(int i = 1;i <= n;i++) {for(int j = 1;j <= n;j++) {if(i % 2 == j % 2) {printf("C");} else {printf(".");}}printf("\n");}return 0;
}
这篇关于Codeforces 384A - Coder的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
