HDU 1170 Balloon Comes!

 

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

Answer

 

#include <iostream>
#include <cmath>
using namespace std;
int main()
{
 int i,n,x,y;   // 为使用% 需定义x,y为int型
 char ch;
 cin>>n;
 for(i=0;i<n;i++)
 {
  cin>>ch>>x>>y;
  switch(ch)
  {
  case '+': cout<<x+y<<endl; break;
  case '-': cout<<x-y<<endl; break;  
  case '*': cout<<x*y<<endl; break;
  default :
   {
    if( x%y==0 )      //判断是否商为整数 但为什么用floor会错呢???有待思考
     cout<<x/y<<endl;
    else
     printf("%.2lf\n",double(x)/y);  // 转换double型可得小数
   }
  }
 }
 return 0;
}