#include<bits/stdc++.h>
using namespace std;
const int maxn=1e4;
int ans,len,cur;
char st[maxn];
int g[33][33];
void build(int x,int y,int len)
{
cur++;
if(st[cur]=='p')
{
build(x,y+len/2,len/2);
build(x,y,len/2);
build(x+len/2,y,len/2);
build(x+len/2,y+len/2,len/2);
}
else if(st[cur]=='f')
{
for(int i=x; i<x+len; i++)
for(int j=y; j<y+len; j++)
if(!g[i][j])
{
g[i][j]=1;
ans++;
}
}
}
int main()
{
int t;
scanf("%d",&t);
while(t--)
{
ans=0;
memset(g,0,sizeof(g));
for(int i=0; i<2; i++)
{
cur=-1;
len=32;
scanf("%s",st);
build(0,0,len);
}
printf("There are %d black pixels.\n",ans);
}
return 0;
}
题目地址:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=4&page=show_problem&problem=233UVA 297(p160)----Quadtress
最新推荐文章于 2024-07-23 18:04:35 发布