poj 1654

# include <stdio.h>
# include <algorithm>
# include <string.h>
# include <stdlib.h>
# include <math.h>
using namespace std;
char s[1000009];
struct node
{
    int x,y;
}vex[1000009];
int cross(node a,node b,node c)
{
    return (b.x-a.x)*(c.y-a.y)-(c.x-a.x)*(b.y-a.y);
}
int main ()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        memset(s,0,sizeof(s));
        memset(vex,0,sizeof(vex));
        scanf("%s",s);
        //printf("%s\n",s);
        int len = strlen(s);
        vex[0].x=0,vex[0].y=0;
        for(int i=1;i<=len;i++)
        {
            if(s[i-1]=='5')
            {vex[i].x=0;vex[i].y=0;}
            if(s[i-1]=='8')
            {vex[i].y=vex[i-1].y+1;vex[i].x=vex[i-1].x;continue;}
            if(s[i-1]=='2')
            {vex[i].y=vex[i-1].y-1;vex[i].x=vex[i-1].x;continue;}
            if(s[i-1]=='4')
            {vex[i].x=vex[i-1].x-1;vex[i].y=vex[i-1].y;continue;}
            if(s[i-1]=='6')
            {vex[i].x=vex[i-1].x+1;vex[i].y=vex[i-1].y;continue;}
            if(s[i-1]=='1')
            {vex[i].x=vex[i-1].x-1;vex[i].y=vex[i-1].y-1;continue;}
            if(s[i-1]=='9')
            {vex[i].x=vex[i-1].x+1;vex[i].y=vex[i-1].y+1;continue;}
            if(s[i-1]=='3')
            {vex[i].x=vex[i-1].x+1;vex[i].y=vex[i-1].y-1;continue;}
            if(s[i-1]=='7')
            {vex[i].x=vex[i-1].x-1;vex[i].y=vex[i-1].y+1;continue;}
        }
        //for(int i=0;i<=len;i++)
         //   printf("%lf  %lf  \n",vex[i].x,vex[i].y);
        __int64 sum=0;
        for(int i=1;i<len;i++)
        {
            sum+=cross(vex[0],vex[i],vex[i+1]);
        }
        if(sum<0)
            sum=-sum;
        if(sum%2==0)
        printf("%I64d\n",sum/2);
        else
            printf("%I64d.5\n",sum/2);
    }
}

直接看了别人的代码   用的%I64d过得   double的话会超内存