POJ 1473 There's Treasure Everywhere!

题目链接

小小的模拟一下。

#include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
using namespace std;
char str[1000];
double a[10];
double b[10];
void CL()
{
    a[0] = a[2] = 0.0;
    a[4] = a[5] = sqrt(2.0)/2.0;
    a[1] = 1.0;
    a[3] = -1.0;
    a[6] = a[7] = -sqrt(2.0)/2.0;
    b[0] = 1.0;
    b[2] = -1.0;
    b[4] = b[7] = sqrt(2.0)/2.0;
    b[3] = b[1] = 0.0;
    b[5] = b[6] = -sqrt(2.0)/2.0;
}
int judge(int x)
{
    if(str[x+1] == ','||str[x+1] == '.')
    {
        if(str[x] == 'N')
            return 0;
        else if(str[x] == 'E')
            return 1;
        else if(str[x] == 'S')
            return 2;
        else if(str[x] == 'W')
            return 3;
    }
    else
    {
        if(str[x] == 'N'&&str[x+1] == 'E')
            return 4;
        else if(str[x] == 'S'&&str[x+1] == 'E')
            return 5;
        else if(str[x] == 'S'&&str[x+1] == 'W')
            return 6;
        else if(str[x] == 'N'&&str[x+1] == 'W')
            return 7;
    }
    return 0;
}
int main()
{
    int len,i,cas = 1,pre,j,temp;
    double x,y;
    CL();
    while(scanf("%s",str)!=EOF)
    {
        if(strcmp(str,"END") == 0) break;
        len = strlen(str);
        pre = 0;
        x = y = 0;
        for(i = 0; i < len; i ++)
        {
            if(str[i] == ','||str[i] == '.')
            {
                temp = 0;
                for(j = pre; j < i; j ++)
                {
                    if(str[j] <= '9'&&str[j] >= '0')
                        temp = temp*10 + str[j] - '0';
                    else
                        break;
                }
                x += temp*a[judge(j)];
                y += temp*b[judge(j)];
                pre = i+1;
            }
        }
        printf("Map #%d
",cas++);
        printf("The treasure is located at (%.3f,%.3f).
",x,y);
        printf("The distance to the treasure is %.3f.

",sqrt(x*x+y*y));
    }
    return 0;
}