G - Ternary Calculation
Complete the ternary calculation.
Input
There are multiple test cases. The first line of input contains an integer Tindicating the number of test cases. For each test case:
There is a string in the form of "number1 operatora number2 operatorb number3". Each operator will be one of {'+', '-' , '*', '/', '%'}, and each number will be an integer in [1, 1000].
Output
For each test case, output the answer.
Sample Input
5 1 + 2 * 3 1 - 8 / 3 1 + 2 - 3 7 * 8 / 5 5 - 8 % 3
Sample Output
7 -1 0 11 3
Note
The calculation "A % B" means taking the remainder of A divided by B, and "A / B" means taking the quotient.
#include <iostream>
#include<cstring>
using namespace std;
int main()
{
int t;
cin>>t;
while(t--)
{
int n1,n2,n3;
char m11,m2;
cin>>n1>>m11>>n2>>m2>>n3;
int sum;
if(m11=='+'&&m2=='-')
sum=n1+n2-n3;
else if(m11=='+'&&m2=='*')
sum=n1+n2*n3;
else if(m11=='+'&&m2=='/')
sum=n1+n2/n3;
else if(m11=='+'&&m2=='%')
sum=n1+n2%n3;
else if(m11=='-'&&m2=='+')
sum=n1-n2+n3;
else if(m11=='*'&&m2=='+')
sum=n1*n2+n3;
else if(m11=='/'&&m2=='+')
sum=n1/n2+n3;
else if(m11=='%'&&m2=='+')
sum=n1%n2+n3;
else if(m11=='-'&&m2=='*')
sum=n1-n2*n3;
else if(m11=='-'&&m2=='/')
sum=n1-n2/n3;
else if(m11=='-'&&m2=='%')
sum=n1-n2%n3;
else if(m11=='*'&&m2=='-')
sum=n1*n2-n3;
else if(m11=='/'&&m2=='-')
sum=n1/n2-n3;
else if(m11=='%'&&m2=='-')
sum=n1%n2-n3;
else if(m11=='*'&&m2=='/')
sum=n1*n2/n3;
else if(m11=='*'&&m2=='%')
sum=n1*n2%n3;
else if(m11=='/'&&m2=='*')
sum=n1/n2*n3;
else if(m11=='%'&&m2=='*')
sum=n1%n2*n3;
else if(m11=='/'&&m2=='%')
sum=n1/n2%n3;
else if(m11=='%'&&m2=='/')
sum=n1%n2/n3;
else if(m11=='-'&&m2=='-')
sum=n1-n2-n3;
else if(m11=='+'&&m2=='+')
sum=n1+n2+n3;
else if(m11=='/'&&m2=='/')
sum=n1/n2/n3;
else if(m11=='%'&&m2=='%')
sum=n1%n2%n3;
else if(m11=='*'&&m2=='*')
sum=n1*n2*n3;
cout<<sum<<endl;
}
return 0;
}