hdu1170 Balloon Comes! （模拟）

Balloon Comes!

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 23742    Accepted Submission(s): 8989

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
  
  

 

Author

lcy

 

Recommend

We have carefully selected several similar problems for you:   1049  1089  1071  1093  1091 

 

代码：

#include<cstdio>
using namespace std;

int main()
{
  freopen("1.in","r",stdin);
  
  char tmp;int n,i,a,b;
  scanf("%d\n",&n);
    for(i=1;i<=n;i++)
      {
        scanf("%c%d%d\n",&tmp,&a,&b);
	    switch(tmp)
	      {
	        case '+':printf("%d\n",a+b);
	                 break;
	        case '-':printf("%d\n",a-b);
	                 break;
	        case '*':printf("%d\n",a*b);
	                 break;
	        default:if(a%b==0)printf("%d\n",a/b);
			        else printf("%.2f\n",a*1.0/b);
		  }
  	  } 
  return 0;
}