Codeforces Round #272 (Div. 2) Dreamoon and WiFi 暴力

B. Dreamoon and WiFi

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 s1 — the commands Drazil sends to Dreamoon, this string consists of only the characters in the set {'+','-'}.

The second line contains a string s2 — 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 exceed 10 - 9.

Sample test(s)

input

++-+-
+-+-+

output

1.000000000000

 

Note

For the first sample, both s1 and s2 will lead Dreamoon to finish at the same position  + 1.

For the second sample, s1 will lead Dreamoon to finish at position 0, while there are four possibilites for s2: {"+-++", "+-+-", "+--+", "+---"} with ending position {+2, 0, 0, -2} respectively. So there are 2 correct cases out of 4, so the probability of finishing at the correct position is 0.5.

For the third sample, s2 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

第二串含有?   可能是+或-   现在问你第二串等于第一串的值得 概率是多少.

题解：对于没有?，直接判

有?  我们就暴力出多少种情况就好了   字符长度小于11，妥妥的暴力

///
#include<bits/stdc++.h>
using namespace std ;
typedef long long ll;
#define mem(a) memset(a,0,sizeof(a))
#define meminf(a) memset(a,127,sizeof(a));
#define TS printf("111111\n");
#define FOR(i,a,b) for( int i=a;i<=b;i++)
#define FORJ(i,a,b) for(int i=a;i>=b;i--)
#define READ(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define inf 100000000
inline ll read()
{
    ll x=,f=;
    char ch=getchar();
    while(ch<''||ch>'')
    {
        if(ch=='-')f=-;
        ch=getchar();
    }
    while(ch>=''&&ch<='')
    {
        x=x*+ch-'';
        ch=getchar();
    }
    return x*f;
}
//****************************************
#define maxn 10000+5
int aa[maxn],H[maxn];
char a[maxn],b[maxn];
void dfs(int x,int s){

  if(x==){
      H[s+]++;
      return ;
  }
   dfs(x-,s+);
   dfs(x-,s-);
}
int main(){
   int ans=;
    scanf("%s%s",a,b);
    int lena=strlen(a);
    int  lenb=strlen(b);
    for(int i=;i<lena;i++){
        if(a[i]=='+')ans++;
            else ans--;
    }
    int tmp=;
    int bb=;
    for(int i=;i<lenb;i++){
        if(b[i]=='+')tmp++;
            else if(b[i]=='-')tmp--;
            else bb++;
    }double anss;mem(H);
    if(bb==){
        if(tmp==ans){
            anss=1.0;
        }
        else anss=;
    }
    else {
        dfs(bb,tmp);
        int sum=;
      for(int i=;i<=bb;i++)sum*=;
    anss=H[ans+]*1.0/sum*1.0;
    }

    printf("%.12f\n",anss);
  return ;
}

代码