NYOJ 挑战密室---1236第八届

给大家推荐个靠谱的公众号程序员探索之路，大家一起加油 ​ 

#include<stdio.h>
#include<string.h>
int sum,i;
char a[55];
int juden(int j){
 if(a[j]=='O')sum=16;
 if(a[j]=='H')sum=2;
 if(a[j]=='S')sum=32;
 if(a[j]=='Z'){
  sum=65; j++;
 }
 if(a[j]=='A'){
   sum=27; j++;
 }
 if(a[j]=='N'){
  if(a[j+1]=='a'){
   sum=23; j++;
  }
  else sum=14;
 }
 if(a[j]=='C'){
  if(a[j+1]=='a'){
   sum=40; j++;
   }
  else if(a[j+1]=='l'){
   sum=35; j++;
  }
  else sum=12;
 }
 if(a[j]>'1' && a[j]<='9')
  sum=sum*(a[j]-'0'-1);
 return j;
}
int main(){
 int i,j,t,k;
 int sum1,s,len,x;
 scanf("%d",&k);
 while(k--){
  s=0; x=1;
  scanf("%s",a);
  len=strlen(a);
  for(i=0;i<len;i++)
  if(a[i]=='=')break;
   i++;
  if(a[i]>'1'&&a[i]<='9'){
    x=a[i]-'0'; i++;
  }
  for(;i<len;i++){
   if(a[i]=='+') break;
   
    if(a[i]=='('){
     sum1=0; 
     for(i++;a[i]!=')';i++){
      i=juden(i);
      sum1+=sum;
      //printf("s1:%d",sum1);
     }
     if(a[i+1]>'1'&&a[i+1]<='9'){
      sum=sum1*(a[i+1]-'0');
      i++;
     }
     else sum=sum1;
     //printf("\ns1 %d ",sum);
    }
    
   else i=juden(i);
   
   s+=sum;
   //printf("%d ",s);
   } 
  printf("%04d\n",s*x);
 }
 return 0;
}