hdu 4451 简单题

//pants是关键值，对于同种类型的pants,记录左边的clothes出现了几次，右边的shoes出现了几次，减去少的，再加上多减的。#include<stdio.h>#include<string.h>#define N 1005int r[N],l[N];int main(){  int s,n,m,k,p,i,x,y;  char s1[100],s2[100];   while(scanf("%d%d%d",&n,&m,&k)!=EOF)   {      if(n==0&&m==0&&k==0)        break;      s=n*m*k;      memset(l,0,sizeof(l));      memset(r,0,sizeof(r));      scanf("%d",&p);      for(i=1;i<=p;i++)      {         scanf("%s %d %s %d",s1,&x,s2,&y);         if(strcmp(s1,"clothes")==0)         {            l[y]++;            s-=k;            s+=r[y];         }         else         {            r[x]++;            s-=n;            s+=l[x];         }      }      printf("%d\n",s);   }   return 0;}