CSUST 第九届校赛D-笨蛋的难题

       1 East

        0

       1 North

       1

      Sample Output

       North

       East

#include<stdio.h>
#include<algorithm>
#include<string.h>
using namespace std;
char dir[4][10]= {"East","South","West","North"};
int main()
{
    int n,turn[50];
    char str[10];
    while(~scanf("%d ",&n))
    {
        gets(str);
        int st;
        if(str[0]=='E')
            st=0;
        else if(str[0]=='S')
            st=1;
        else if(str[0]=='W')
            st=2;
        else
            st=3;
        memset(turn, 0,sizeof(turn));
        for(int i=0; i<n; i++)
        {
            scanf("%d",&turn[i]);
            if(turn[i]==0)
                turn[i]=-1;
            else
                turn[i]=1;
        }
        for(int i=0; i<n; i++)
            st+=turn[i];
        st=st%4;
        if(st<0)
            st+=4;
        printf("%s\n",dir[st]);
    }
    return 0;
}