Balloon Comes!
来源:互联网 发布:淘宝的盈利模式分析 编辑:程序博客网 时间:2024/06/10 00:27
Balloon Comes!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18296 Accepted Submission(s): 6753
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!
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-120.50
Author
lcy
Recommend
We have carefully selected several similar problems for you: 1108 1076 1106 1062 1720
#include<iostream>#include<cstdio>using namespace std;int main(){ int i,j,t,a,b; char c; scanf("%d",&t); while(t--) { getchar(); scanf("%c %d %d",&c,&a,&b); //cin>>c>>a>>b; //printf("fkjkf"); if(c=='-') { printf("%d\n",a-b); } else if(c=='+') { printf("%d\n",a+b); } else if(c=='*') { printf("%d\n",a*b); } else if(c=='/') { double e; e=a/(b*1.0); if(e==(int)(e)) printf("%d\n",(int)e); else printf("%.2f\n",e); } /* if(c=='/') { if(a%b!=0) { printf("%.2f\n",(double)a/b); } else printf("%d\n",a/b); }*/ } return 0;}
0 0
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- 1170 Balloon Comes!
- hdu1170--Balloon Comes!
- HDU 1170 Balloon Comes!
- HDU 1170 ( Balloon Comes! )
- python学习笔记
- Eddy's research I
- 黑马程序员_正则表达式
- 事件、接口、类---对象数组
- 轻松搞定面试中的链表题目
- Balloon Comes!
- Apache 高可用性
- Big Event in HDU
- 诡异的楼梯
- STM32启动文件详解及SystemInit函数分析(转)
- 软件方法论之迭代式
- 完成项目的感想,与收获,及下面学习的进度于预习!
- 10件安装WordPress后需要做的事
- 变形课