UVA - 10069 Distinct Subsequences

这几天状态不好，老是担心这个担心那个。。。。慢慢调整吧。。。心态其实非常重要

这是道好题，。。。等以后有时间一定要再做一次

#include<cstdio>
#include<cstring>
#include<algorithm>
#define MAX 10100
#define MAX1 110
using namespace std;

char s1[MAX],s2[MAX];
//int dp[MAX1][MAX];

class bign
{
public:
    char num[MAX1];
    void operator+(bign other)
    {
        char s1[MAX1],s2[MAX1],ans[MAX1];
        int i,j,len1,len2,t=0,help;
        //memset(s1,0,MAX1),memset(s2,0,MAX1),memset(ans,0,MAX1);
        len1=strlen(num),len2=strlen(other.num);
        for(i=len1-1,j=0;i>=0;i--)
            s1[j++]=num[i];
        s1[j]=0;
        for(i=len2-1,j=0;i>=0;i--)
            s2[j++]=other.num[i];
        s2[j]=0;
        for(i=0;i<len1||i<len2;i++)
        {
            help=0;
            if(i<len1)
                help+=s1[i]-'0';
            if(i<len2)
                help+=s2[i]-'0';
            ans[i]=(t+help)%10+'0';
            t=(t+help)/10;
        }
        if(t>0)
        {
         ans[i]=t+'0';
         ans[i+1]=0;
        }
        else
            ans[i]=0;
        for(i=strlen(ans)-1,j=0;i>=0;i--)
            num[j++]=ans[i];
        num[j]=0;
    }
    void operator=(bign other)
    {
        int i,j;
        for(i=0,j=0;i<strlen(other.num);i++)
            num[j++]=other.num[i];
        num[j]=0;
    }
    void operator=(int other)
    {
        int i,j;
        char s[MAX1];
        sprintf(s,"%d",other);
        for(i=0;i<strlen(s);i++)
            num[i]=s[i];
        num[i]=0;
    }
}dp[MAX1][MAX];

int main()
{
    int t,len2,len1,i,j,all;
    scanf("%d",&t);
    /*dp[1][1]=0,dp[1][2]=1;
    dp[1][1]+dp[1][2];
    printf("%s %s",dp[1][1].num,dp[1][2].num);*/
    //getchar();
    while(t--)
    {
        scanf("%s %s",s1,s2);
        len1=strlen(s1),len2=strlen(s2);
        if(len1<len2)
        {
            printf("0\n");
            continue;
        }
        for(i=0;i<MAX1;i++)
            for(j=0;j<MAX;j++)
            memset(dp[i][j].num,0,MAX1);;
        //memset(dp,0,MAX*MAX1*4);
        //dp[0][0]=1;
        for(all=0,i=0;i<=len1;i++)
        {
            dp[0][i]=1;
        }
        for(i=1;i<=len2;i++)
        {
            dp[i][0]=0;
            for(j=1;j<=len1;j++)
            {
                if(s1[j-1]!=s2[i-1])
                {
                    dp[i][j]=dp[i][j-1];
                }
                else
                    dp[i][j]+dp[i][j-1],dp[i][j]+dp[i-1][j-1];
            }
        }
        if(dp[len2][len1].num[0]==0)
            printf("0\n");
        else
            printf("%s\n",dp[len2][len1].num);
    }
    return 0;
}