HDU 5611 Baby Ming and phone number

#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<queue>
#include<list>
#include<algorithm>
using namespace std;

int T,n;
char s[];
long long a,b;
int q1[],q2[];

long long f()
{
    if(s[]==s[]&&s[]==s[]&&s[]==s[]&&s[]==s[]) return a;
    bool fail=;
    for(int i=;i<=;i++) if(s[i]-s[i-]!=) fail=;
    if(fail==) return a;
     fail=;
    for(int i=;i<=;i++) if(s[i]-s[i-]!=-) fail=;
    if(fail==) return a;

    int year=(s[]-'')*+(s[]-'')*+(s[]-'')*+(s[]-'');
    int month=(s[]-'')*+(s[]-'');
    int day=(s[]-'')*+(s[]-'');

    if(year>=&&year<=)
    {
        if(month>=&&month<=)
        {
            if( (( == year%)&&( != year%)) ||( == year %) )
            {
                if(day>=&&day<=q2[month]) return a;
            }
            else
            {
                if(day>=&&day<=q1[month]) return a;
            }
        }
    }
    return b;
}

int main()
{
    q1[]=;
    q1[]=;
    q1[]=;
    q1[]=;
    q1[]=;
    q1[]=;
    q1[]=;
    q1[]=;
    q1[]=;
    q1[]=;
    q1[]=;
    q1[]=;

    q2[]=;
    q2[]=;
    q2[]=;
    q2[]=;
    q2[]=;
    q2[]=;
    q2[]=;
    q2[]=;
    q2[]=;
    q2[]=;
    q2[]=;
    q2[]=;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%d",&n);
        scanf("%lld%lld",&a,&b);
        long long ans=;
        for(int i=;i<=n;i++)
        {
            scanf("%s",s);
            ans=ans+f();
        }
        printf("%lld\n",ans);
    }
    return ;
}