杭电 OJ 1170 Balloon Comes!

Balloon Comes!

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 30678    Accepted Submission(s): 11574

Problem Description

The contest starts now! How excited it is to see balloons floating around. You, one of the best programmers in HDU, can get a very beautiful balloon if only you have solved the very very very... easy problem.
Give you an operator (+,-,*, / --denoting addition, subtraction, multiplication, division respectively) and two positive integers, your task is to output the result. 
Is it very easy? 
Come on, guy! PLMM will send you a beautiful Balloon right now!
Good Luck!

 

Input

Input contains multiple test cases. The first line of the input is a single integer T (0<T<1000) which is the number of test cases. T test cases follow. Each test case contains a char C (+,-,*, /) and two integers A and B(0<A,B<10000).Of course, we all know that A and B are operands and C is an operator. 

 

Output

For each case, print the operation result. The result should be rounded to 2 decimal places If and only if it is not an integer.

 

Sample Input

  
  

   
   4
+ 1 2
- 1 2
* 1 2
/ 1 2
  
  

 

Sample Output

  
  

   
   3
-1
2
0.50
  
  
  
  


  
  

简单分析一下，就是需要自己输入运算符号，还有就是除法的时候小数点需要保留两位，这里没有考虑除数为零就可以通过了,并且也没有考虑当字符不是运算符的情况。

#include <iostream>
#include <cmath>
#include <iomanip>
using namespace std;
int main()
{
    int T;
    cin>>T;
    char a;
    int b,c;
    while(T--)
    {
        cin>>a>>b>>c;
        switch(a)
        {
            case '+': cout << b+c << endl;break;
            case '-': cout << b-c << endl;break;
            case '*': cout << b*c << endl;break;
            case '/':
                if(b%c==0)
                    cout << b/c << endl;
                else
                    cout<<setiosflags(ios::fixed)<<setprecision(2)<<b/(c*1.0)<<endl;
                //printf("%.2f\n",a/(b*1.0));
                break;
            default:break;   //可以不写
        }
    }
    return 0;
}