2012金华赛区网络赛 - 1004 - A very hard Aoshu problem - HDU - 4403

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<map>
#include<iostream>
using namespace std;
map < long long ,long long > hash;
char num[50],Left[50],Right[50];
char *pright;
long long lmax,lmin,rmax,rmin,Scount;
long long ATOLL(const char *s)
{
    int i;
    long long sum=0;
    for(i=0;i<strlen(s);i++)
    {
        sum=sum*10+s[i]-'0';
    }
    return sum;
}
long long AcquireMin(char *s)
{
    int i,j;
    long long sum=0;
    char c[2];
    for(i=0;i<strlen(s);i++)
    {
        c[0]=s[i];
        c[1]='\0';
        sum+=atoi(c);
    }
    return sum;       
}    
long long AcquireMap(char *s)
{
    int i,j,k;
    char c[20];
    long long sum;
    for(j=0;j<(1<<(strlen(s)-1));j++)
    {
        sum=0;
        i=0;
        for(k=0;k<strlen(s);k++)
        {
            c[i++]=s[k];
            if(j&(1<<k))
            {
                c[i]='\0';
                i=0;
                sum+=ATOLL(c);
            }
        } 
        if(i>0)
        {
            c[i]='\0';
            sum+=ATOLL(c);
        }   
        hash[sum]++;  
    } 
    return 0;
}       
long long SearchMap(char *s)
{
    int i,j,k;
    char c[20];
    long long sum;
    for(j=0;j<(1<<(strlen(s)-1));j++)
    {
        sum=0;
        i=0;
        for(k=0;k<strlen(s);k++)
        {
            c[i++]=s[k];
            if(j&(1<<k))
            {
                c[i]='\0';
                i=0;
                sum+=ATOLL(c);
            }
        } 
        if(i>0)
        {
            c[i]='\0';
            sum+=ATOLL(c);
        }   
        Scount+=hash[sum];       
    }
    return 0; 
}    
int main()
{
    int i,j,k;
    while(scanf("%s",num)!=EOF&&num[0]!='E')
    {
        Scount=0;        
        memcpy(Right,num,strlen(num));
        pright=Right;
        for(i=1;i<strlen(num);i++)
        {
            hash.clear();  
            memcpy(Left,num,i);
            Left[i]='\0';
            pright=Right+i;
            lmax=ATOLL(Left);
            rmax=ATOLL(pright);
            lmin=AcquireMin(Left);
            rmin=AcquireMin(pright);
            if(lmax<rmin||lmin>rmax)continue;
            AcquireMap(Left);
            SearchMap(pright);             
        } 
        printf("%I64d\n",Scount);   
        memset(Right,0,sizeof(Right));       
    }
    return 0;    
    
}    

暴力解决：先确定等号位置，再枚举左边的值，然后枚举右边的值并统计即可。初步学会了MAP的使用。唉，次次比赛都被虐，不过每次都能学到一些新东西。CE了两次，原因是atoll不存在，于是自己写了ATOLL函数。