Pre-Post-erous!

1:Pre-Post-erous!

• 查看
• 提交
• 统计
• 提问

总时间限制: 

1000ms 

内存限制: 

65536kB

描述

We are all familiar with pre-order, in-order and post-order traversals of binary trees. A common problem in data structure classes is to find the pre-order traversal of a binary tree when given the in-order and post-order traversals. Alternatively, you can find the post-order traversal when given the in-order and pre-order. However, in general you cannot determine the in-order traversal of a tree when given its pre-order and post-order traversals. Consider the four binary trees below:

    a   a   a   a
   /   /     \   \
  b   b       b   b
 /     \     /     \
c       c   c       c

All of these trees have the same pre-order and post-order traversals. This phenomenon is not restricted to binary trees, but holds for general m-ary trees as well.

输入

Input will consist of multiple problem instances. Each instance will consist of a line of the form
m s1 s2
indicating that the trees are m-ary trees, s1 is the pre-order traversal and s2 is the post-order traversal.All traversal strings will consist of lowercase alphabetic characters. For all input instances, 1 <= m <= 20 and the length of s1 and s2 will be between 1 and 26 inclusive. If the length of s1 is k (which is the same as the length of s2, of course), the first k letters of the alphabet will be used in the strings. An input line of 0 will terminate the input.

输出

For each problem instance, you should output one line containing the number of possible trees which would result in the pre-order and post-order traversals for the instance. All output values will be within the range of a 32-bit signed integer. For each problem instance, you are guaranteed that there is at least one tree with the given pre-order and post-order traversals.

样例输入

2 abc cba
2 abc bca
10 abc bca
13 abejkcfghid jkebfghicda
0

样例输出

4
1
45
207352860

来源

East Central North America 2002

#include<iostream>
#include<cmath>
#include<cstring>
#include<algorithm>
#include<iomanip>
#include<queue>
#include<stack>
#include<vector>
#include<set>
#include<map>
using namespace std;
string S1,S2;
vector<int>V;
void CountSubtreeNum(int s1,int e1,int s2,int e2)
{
	if(s1==e1&&s2==e2)return;
	int a=s1+1,b=s2,l=0,num=0;
	while(b<e2)
	{
		while(S1[a]!=S2[l+b]&&l+b<e2)
			l++;
		CountSubtreeNum(a,a+l,b,b+l);
		a=a+l+1;
		b=b+l+1;
		num++;
		l=0;
	}
	V.push_back(num);
}
int C(int n,int r)
{
	int ans=1;
	for(int i=n;i>n-r;--i)
	{
		ans*=i;
	}
	for(int i=1;i<=r;++i)
	{
		ans/=i;
	}
	return ans;
}
int main()
{
	int m;
	while(cin>>m&&m)
	{
		V.clear();
		cin>>S1>>S2;
		int len=S1.length();
		CountSubtreeNum(0,len-1,0,len-1);
		int sum=1;
		for(int i=0;i<V.size();++i)
		{
			sum*=C(m,V[i]);
		}
		cout<<sum<<endl;
	}
	return 0;
}