【CodeForces 476B】 Dreamoon and WiFi（组合概率）



B. Dreamoon and WiFi

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Dreamoon is standing at the position 0 on a number line. Drazil is sending a list of commands through Wi-Fi to Dreamoon's smartphone and Dreamoon follows them.

Each command is one of the following two types:

1. Go 1 unit towards the positive direction, denoted as '+'
2. Go 1 unit towards the negative direction, denoted as '-'

But the Wi-Fi condition is so poor that Dreamoon's smartphone reports some of the commands can't be recognized and Dreamoon knows that some of them might even be wrong though successfully recognized. Dreamoon decides to follow every recognized command and toss a fair coin to decide those unrecognized ones (that means, he moves to the 1 unit to the negative or positive direction with the same probability 0.5).

You are given an original list of commands sent by Drazil and list received by Dreamoon. What is the probability that Dreamoon ends in the position originally supposed to be final by Drazil's commands?

Input

The first line contains a string s₁ — the commands Drazil sends to Dreamoon, this string consists of only the characters in the set {'+','-'}.

The second line contains a string s₂ — the commands Dreamoon's smartphone recognizes, this string consists of only the characters in the set {'+','-', '?'}.'?' denotes an unrecognized command.

Lengths of two strings are equal and do not exceed 10.

Output

Output a single real number corresponding to the probability. The answer will be considered correct if its relative or absolute error doesn't exceed10^- 9.

Examples

Input

++-+-
+-+-+

Output

1.000000000000

Input

+-+-
+-??

Output

0.500000000000

Input

+++
??-

Output

0.000000000000

Note

For the first sample, both s₁ ands₂ will lead Dreamoon to finish at the same position + 1.

For the second sample, s₁ will lead Dreamoon to finish at position 0, while there are four possibilites fors₂: {"+-++","+-+-", "+--+","+---"} with ending position {+2, 0, 0, -2} respectively. So there are2 correct cases out of 4, so the probability of finishing at the correct position is0.5.

For the third sample, s₂ could only lead us to finish at positions {+1, -1, -3}, so the probability to finish at the correct position + 3 is 0.

题目大意：两个字符串，“+” 为 1，“-” 为 -1，“？” 两个都可以，求出两个字符串和相等的概率

思路：先求出第一个的和x，再求出第二个的和y，二者之差就是？？？（num个）所表示的和，然后枚举1的个数，剩下的是-1的个数，如果和满足条件，就加上其组合数，总共有2^num种情况。

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<string>
using namespace std;
double C(int m,int n)
{
    int a=1,b=1;
    if(m > n) return 0;
    for(int i=n; i>=n-m+1; i--) a*=i;
    for(int i=m; i>=1; i--) b*=i;
    return (double)(a/b);
}
int main()
{
    string s1,s2;
    int x=0,y=0,num=0;
    cin>>s1>>s2;
    for (int i=0; i<s1.length(); i++){
        if(s1[i]=='+') x++;
        else x--;
    }
    for (int i=0; i<s2.length(); i++){
        if(s2[i]=='+') y++;
        else if(s2[i]=='-') y--;
        else num++;
    }
    int a=x-y;
    if(!a && !num){
        printf("1.000000000000\n");
        return 0;
    }
    double ans=0;
    for (int i=0; i<=num; i++)   //i为1的个数，num-i是-1的个数
        if(i-(num-i)==a){
            ans+=C(i,num);
        }
    printf("%.12f\n",ans/pow(2,num));
    return 0;
}