非二叉树——四分树UVa 297

//#include <bits/stdc++.h>
#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <string>
#include <map>
#include <set>
#include <sstream>
#include <vector>
#include <algorithm>
#include <cstring>
#include <queue>
#include <iomanip>
#include <cmath>
using namespace std;

const int len = 32;
const int maxn = 10000 + 10;
char s[maxn];
int buf[len][len], cnt;

void draw(const char* s, int& p, int r, int c, int w)
{
	char ch = s[p++];
	if(ch == 'p')
	{
		draw(s, p, r, c+w/2, w/2);
		draw(s, p, r, c,    w/2);
		draw(s, p, r+w/2, c, w/2);
		draw(s, p, r+w/2, c+w/2,w/2);
	}
	else if(ch == 'f')
	{
		for(int i=r;i<r+w;i++)
			for(int j=c;j<c+w;j++)
				if(buf[i][j] == 0)
				{
					buf[i][j] = 1;
					cnt++;
				}
	}
	
}

int main() 
{
	int t;
	cin >> t;
	while(t--)
	{
		memset(buf, 0, sizeof(buf));
		cnt = 0;
		for(int i=0;i<2;i++)
		{
			cin >> s;
			int p = 0;
			draw(s, p, 0, 0, len);
		}
		cout<<"cnt: "<<cnt<<endl;
		
	}
}