POJ1189

#include<iostream>
#include<cstdio>
#include<cmath>
#include<string>
#include<cstring>
#include<algorithm>
#include<cctype>
#include<queue>
#include<stdlib.h>

using namespace std;

__int64 dp[55][55];
char map[55][55];
char s[55];

__int64 gcd(__int64 a,__int64 b)
{
	return b==0?a:gcd(b,a%b);
}

int main()
{
	int m,n;
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=i;j++)
		{
			cin>>s;
			map[i][j]=s[0];
		}
	}
	dp[1][1]=1ll<<n;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=i;j++)
		{
			if(map[i][j]=='*')
			{
				dp[i+1][j]+=dp[i][j]>>1;
				dp[i+1][j+1]+=dp[i][j]>>1;
			}
			else
			{
				dp[i+2][j+1]+=dp[i][j];
			}
		}
	}
	__int64 ans=dp[n+1][m+1];
	__int64 sum=0;
	for(int i=1;i<=n+1;i++)
	{
		sum+=dp[n+1][i];
	}
	__int64 k;
	k=gcd(sum,ans);
	printf("%I64d/%I64d\n",ans/k,sum/k);
	return 0;
}