Windows Of CCPC

Problem Description In recent years,CCPC has developed rapidly and gained a large number of competitors .One contestant designed a design called CCPC Windows .The 1-st order CCPC window is shown in the figure:

?

?

?

?

#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <string>
#include <cstring>
#include <cstdlib>
#include <map>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
typedef long long ll;
using namespace std;
const int INT=1e6+5;
#define lson rt<<1,l,m  
#define rson rt<<1|1,m+1,r
#define read(x) scanf("%d",&x)
#define lread(x) scanf("%lld",&x);
#define pt(x) printf("%dn",(x))
#define cn cin>>
#define ct cout<<
#define en <<endl
#define rep(j,k) for (int i = (int)(j); i <= (int)(k); i++)
#define mem(s,t) memset(s,t,sizeof(s))
#define re return 0;
#define TLE std::ios::sync_with_stdio(false);
ll a[100000+5],b[10000+5];
priority_queue<ll>q1,q2;
int main()
{
    TLE;
    char arr[1030][1030];
    arr[0][0]=‘C‘;
    arr[0][1]=‘C‘;
    arr[1][0]=‘P‘;
    arr[1][1]=‘C‘;
    ll x;
    for(int i=1;i<=9;i++)
    {
        x=(1<<i);
        //ct x en;
        for(int j=0;j<x;j++)
        {
            for(int k=0;k<x;k++)
            {
                arr[j][k+x]=arr[j][k];
            }
        }

        for(int j=x;j<x*2;j++)
        {
            for(int k=x;k<x*2;k++)
            {
                arr[j][k]=arr[j-x][k];
            }
        }

        for(int j=0;j<x;j++)
        {
            for(int k=0;k<x;k++)
            {
                arr[j+x][k]=arr[j][k]==‘P‘?‘C‘:‘P‘;
            }
        }
    }
    int t,k;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%d",&k);
        x=(1<<k);
        for(int i=0;i<x;i++)
        {
            for(int j=0;j<x;j++)
            {
                printf("%c",arr[i][j]);
            }
            printf("n");
        }
    }


}

（编辑：天津站长网）

【声明】本站内容均来自网络，其相关言论仅代表作者个人观点，不代表本站立场。若无意侵犯到您的权利，请及时与联系站长删除相关内容!