3188851_wa.cc

做的POJ的一些题目

#include<iostream>
#include<string>
using namespace std;
int n;
char mg[50000];
long long int binaryfind(int left,int right)
{
     if(left>=right || (left+1==right && mg[right]=='0'))
        return 1;
     int mid=(left+right)/2;
     if(mg[mid+1]=='0')   //下标mid与mid+1必须为一个字母 
          return binaryfind(left,mid-1)*binaryfind(mid+2,right);               
     else
     {
          if(mg[mid]!='0' && (mg[mid]-'0')*10+mg[mid+1]-'0'<=26)  //下标mid与mid+1能组合，也可以不组合 
             return binaryfind(left,mid-1)*binaryfind(mid+2,right)+binaryfind(left,mid)*binaryfind(mid+1,right);
          return  binaryfind(left,mid)*binaryfind(mid+1,right); //下标mid与mid+1不能组合 
     }
}
int main()
{
    scanf("%s",mg);
    while(mg[0]!='0')
    {
        n=strlen(mg);
        cout<<binaryfind(0,n-1)<<endl;
        memset(mg,NULL,50000);
        scanf("%s",mg);               
    }
    system("pause");
    return 0;
}