def get():
return list(map(int, input().split()))
def intput():
return int(input())
dRow = [ -1, 0, 1, 0]
dCol = [ 0, 1, 0, -1]
def main():
n=intput()
vis=[['.' for _ in range(n)] for _ in range(n)]
s=0
for r in range(n):
for c in range(n):
ans=True
for i in range(4):
x=c+dCol[i]
y=r+dRow[i]
if (x<0 or y<0 or y>=n or x>=n):
continue
ans&=(vis[y][x]!='C')
if (ans ):
vis[r][c]='C'
s+=1
print(s)
for r in range(n):
print (''.join(vis[r]))
main()
#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin>>n;
if(n%2==0)
cout<<n*n/2<<endl;
else
cout<<(n*n+1)/2<<endl;
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
if((i+j)%2==0)cout<<'C';
else
cout<<'.';
}
cout<<endl;
}
} 1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |