$Poj2083/AcWing118\ Fractal$ 模拟

$AcWing$

$Sol$

一年前做过差不多的南蛮图腾,当时做出来还是很有成就感的$OvO$

$N<=7$,就是模拟模拟,预处理一下,$over$

$Code$

#include<bits/stdc++.h>
#define il inline
#define Rg register
#define go(i,a,b) for(Rg int i=a;i<=b;++i)
#define yes(i,a,b) for(Rg int i=a;i>=b;--i)
#define mem(a,b) memset(a,b,sizeof(a))
#define ll long long
#define db double
using namespace std;
il int read()
{
    Rg int x=,y=;char c=getchar();
    while(c<''||c>''){if(c=='-')y=-;c=getchar();}
    while(c>=''&&c<=''){x=(x<<)+(x<<)+c-'';c=getchar();}
    return x*y;
}
char as[][][];
il int ksm(int x,int y){Rg int ret=;while(y){if(y&)ret*=x;x*=x;y>>=;}return ret;}
il void init()
{
    as[][][]='X';
    go(n,,)
    {
        Rg int qwq=ksm(,n-);
        go(i,,qwq)
        {
            go(j,,qwq)as[n][i][j]=as[n][i][j+qwq*]=as[n-][i][j];
            go(j,qwq+,*qwq)as[n][i][j]=' ';
        }
        go(i,qwq+,qwq*)
        {
            go(j,,qwq)as[n][i][j]=as[n][i][j+qwq*]=' ';
            go(j,qwq+,*qwq)as[n][i][j]=as[n-][i-qwq][j-qwq];
        }
        go(i,qwq*+,qwq*)
        {
            go(j,,qwq)as[n][i][j]=as[n][i][j+qwq*]=as[n-][i-qwq*][j];
            go(j,qwq+,*qwq)as[n][i][j]=' ';
        }
    }
}
int main()
{
    init();
    while()
    {
        Rg int n=read();if(n==-)break;
        Rg int qwq=ksm(,n-);
        go(i,,qwq){go(j,,qwq)printf("%c",as[n][i][j]);printf("\n");}
        printf("-\n");
    }
    return ;
}