CCPC2019网络赛

Posted 2022-08-24 aiahtwo

1007:

#include<bits/stdc++.h> 
#define ll long long
using namespace std;
ll h,t,n,m[1100][1100];
int main()

    cin>>t;
    while(t--)
    
        cin>>n;
        h = 2;
        
        m[1][1] = 1;
        m[1][2] = 1;
        m[2][1] = 0;
        m[2][2] = 1;
        
        while(--n)//从部分扩展到整体 
        
            for(int i = 1;i<=h;i++)   //第二块的值与第一块相同 
                for(int j = 1+h;j<=2*h;j++)
                    m[i][j] = m[i][j-h];
                    
            for(int i = h+1;i<=h*2;i++)  //第三块的值与第一块相同 
                for(int j = 1+h;j<=2*h;j++)
                    m[i][j] = m[i-h][j-h];
                    
            for(int i = h+1;i<=h*2;i++)  //第四块的值与第一块相反 
                for(int j = 1;j<=h;j++)
                    if(m[i-h][j]) 
                        m[i][j] = 0;
                    else
                        m[i][j] = 1;
                        
            h*=2;
        
        
        for(int i = 1;i<=h;i++)
        
            for(int j = 1;j<=h;j++)
            
                if(m[i][j]==1)
                    cout<<‘C‘;
                else
                    cout<<‘P‘;
            
            cout<<endl;
        
    
    return 0;