UVA297建立完全四叉树统计叶子节点

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<string>
#include<cctype>
#include<cmath>
#include<map>
#include<set>
#include<vector>
#include<queue>
#include<stack>
#include<ctime>
#include<algorithm>
#include<sstream>
#define LL long long
using namespace std;
int n;
int sum=0;
const int total=1365;
const int N=1400;
int t1
,t2
;
void dye(int r,int *t)
{
if(r>total) return;
t[r]=1;
dye(4*r-2,t);
dye(4*r-1,t);
dye(4*r,t);
dye(4*r+1,t);
}
void create_tree(int r,int *t)
{
char ch;
if(r>total) return;
cin>>ch;
if(ch=='e') return;
else if(ch=='p')
{
create_tree(4*r-2,t);create_tree(4*r-1,t);
create_tree(4*r,t);create_tree(4*r+1,t);
}
else
dye(r,t);
}
int main()
{
cin>>n;
while(n--)
{
memset(t1,0,sizeof(t1));
memset(t2,0,sizeof(t2));
int r=1;
create_tree(r,t1); getchar();
r=1;
create_tree(r,t2); getchar();
int sum=0;
for(int i=342;i<=total;i++) if(t1[i]|t2[i]) sum++;
printf("There are %d black pixels.\n",sum);
}
return 0;
}