Dreamoon and WiFi CodeForces - 476B

Dreamoon and WiFi CodeForces - 476B

题目描述
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.

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.

大致题意
给你一串由‘-’和‘+’组成的字符串还有一串由‘-’和‘+’和‘？’组成的字符串，‘？’是‘-’和‘+’的概率都是0.5.假设‘+’表示值1，‘-’表示0值，他们相加的值就是整个字符串的值问两列字符串的值相同的概率为多少。

思路
简单的模拟,先遍历第一个字符串，用sum1记录‘+’的个数，然后遍历第二个字符串，每遇到‘+’，sum1–，用sum2记录‘？’的个数。如果sum1为负数，则概率为0，如果sum1==sum2=0，则概率为1，剩下的一般情况概率就是求sum2里选sum1个的组合数除以2的sum2次方（每个位置上有两种选择）

代码如下

#include <iostream> 
#include <cstdio>
#include <cstdlib>
#include <fstream>
#include <math.h>
#include <algorithm>
#include <climits>
#include <cstring>
#include <string>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <list>
#include<sstream>
#include<ctime>
using namespace std;
long long  shu(int x)
{
    long long  a=1;
    for(int i=1;i<=x;i++)
    a=a*2;
    return a;
}
long long  f(int x)
{
    long long  a=1;
    for(int i=1;i<=x;i++)
    a*=i;
    return a;
}
long long  zuhe(int x,int y)
{
    long long  z;
    return f(x)/f(y)/f(x-y);
}
int main()
{

    int l1,l2,sum1=0,sum2=0;
    long long k;
    double jieguo;
    char s1[20],s2[20];
    gets(s1);
    gets(s2);
    l1=strlen(s1);
    l2=strlen(s2);
    for(int i=0;i<l1;i++)
    {
        if(s1[i]=='+')
        sum1++;
    }
    for(int i=0;i<l2;i++)
    {
        if(s2[i]=='+')
        sum1--;
        else if(s2[i]=='?')
        sum2++;
    }
    if(sum1==0&&sum2==0)
    {
        jieguo=1;
        printf("%.12lf",jieguo);
    }
    else if(sum1>sum2||sum1<0)
    {
        jieguo=0;
        printf("%.12lf",jieguo);
    }
    else 
    {
        jieguo=zuhe(sum2,sum1);
        k=shu(sum2);
        jieguo/=k;
        printf("%.12lf",jieguo);
    }
    return 0;
}