CodeForces - 296B Yaroslav and Two Strings (容斥计数)

题目描述：

点击打开链接

给你两个字符串s1,s2其中？可以变成任意数字，问有多少种方案满足存在i,j，s1[i]<s2[i]&&s1[j]>s2[j]。同样的想法，先算出总方案，然后计算出s1<s2,s1>s2,s1==s2的方案算出来减去就是满足题目要求的情况。

AC代码：

#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<stack>
#include<vector>
#include<queue>
#include<algorithm>
using namespace std;
const int MAXM=25;
const long long MOD=1000000007;


long long handle1(string s1,string s2)
{
    long long res=1;
    int len=s1.size();
    for (int i=0;i<len;i++)
    {
        if (s1[i]=='?'&&s2[i]=='?') res=(res*55)%MOD;
        else if (s1[i]=='?'&&s2[i]!='?') res=res*(s2[i]-'0'+1)%MOD;
        else if (s1[i]!='?'&&s2[i]=='?') res=res*(10-(s1[i]-'0'))%MOD;
        else if (s1[i]>s2[i])
        {
            res=0;
            break;
        }
    }
    return res;
}
long long handle2(string s1,string s2)
{
    long long res=1;
    int len=s1.size();
    for (int i=0;i<len;i++)
    {
        if (s1[i]=='?'&&s2[i]=='?') res=(res*55)%MOD;
        else if (s1[i]=='?'&&s2[i]!='?') res=res*(10-(s2[i]-'0'))%MOD;
        else if (s1[i]!='?'&&s2[i]=='?') res=res*(s1[i]-'0'+1)%MOD;
        else if (s1[i]<s2[i])
        {
            res=0;
            break;
        }
    }
    return res;
}
long long handle3(string s1,string s2)
{
    long long res=1;
    int len=s1.size();
    for (int i=0;i<len;i++)
    {
        if (s1[i]=='?'&&s2[i]=='?') res=(res*10)%MOD;
        else if (s1[i]=='?'&&s2[i]!='?') res=res*1;
        else if (s1[i]!='?'&&s2[i]=='?') res=res*1;
        else if (s1[i]!=s2[i])
        {
            res=0;
            break;
        }
    }
    return res;
}

int n;
string s1,s2;

int main()
{
    while(scanf("%d",&n)!=EOF)
    {
        cin>>s1>>s2;
        long long ans=1;
        for (int i=0;i<n;i++)
        {
            if (s1[i]=='?') ans=ans*10%MOD;
            if (s2[i]=='?') ans=ans*10%MOD;
        }
        long long res1=handle1(s1,s2);
        long long res2=handle2(s1,s2);
        long long res3=handle3(s1,s2);
        cout<<(ans-res1+MOD-res2+MOD+res3)%MOD<<endl;
    }
    return 0;
}