ZOJ 3782 Ternary Calculation【】

G - Ternary Calculation

  ZOJ - 3782 

#include<iostream>
#include<cstdio>
#include<math.h>
#include<cstring>
#include<climits>
#include<string>
#include<queue>
#include<stack>
#include<set>
#include<map>
#include<list>
#include<vector>
#include<sstream>
#include<algorithm>
using namespace std;
#define rep(i,j,k)for(i=j;i<k;i++)
#define per(i,j,k)for(i=j;i>k;i--)
#define ms(x,y)memset(x,y,sizeof(x))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define ll long long
const int INF=0x7ffffff;

const int M=1e4+10;
int i,j,k,n,m;
map<char,int>s;

int f(int x,int  a,int b)
{
    int ans;
    if(x==0)ans=a+b;
    if(x==1)ans=a-b;
    if(x==2)ans=a*b;
    if(x==3)ans=a/b;
    if(x==4)ans=a%b;// cout<<ans<<endl;
    return ans;

}

int main()
{
    s['+']=0;s['-']=1;
    s['*']=2;s['/']=3;
    s['%']=4;
    int T;
    scanf("%d",&T);
    while(T--){
        int a,b,c;
        char c1,c2;
        int ans;
        scanf("%d %c %d %c %d",&a,&c1,&b,&c2,&c);
        if(s[c1]<s[c2]&&(s[c1]==0||s[c1]==1)){
            ans=f(s[c1],a,f(s[c2],b,c));
        }
        else{
          ans=f(s[c2],f(s[c1],a,b),c);
        }
        printf("%d\n",ans);
    }
    return 0;
}