HDU1170:Balloon Comes!
来源:互联网 发布:python json api接口 编辑:程序博客网 时间:2024/04/29 19:57
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
#include <stdio.h>int main(){ char x; int a,b,n; double ans; scanf("%d%*c",&n); while(n--) { scanf("%c%d%d%*c",&x,&a,&b); if(x == '/') { ans = (double)a/b; if(ans == (int)ans) printf("%.0lf\n",ans); else printf("%.02lf\n",ans); continue; } if(x == '+') ans = a+b; else if(x == '-') ans = a-b; else if(x == '*') ans = a*b; printf("%.0lf\n",ans); } return 0;}
- hdu1170--Balloon Comes!
- HDU1170:Balloon Comes!
- HDU1170 Balloon Comes!
- Hdu1170 Balloon Comes!
- hdu1170 Balloon Comes!
- hdu1170 Balloon Comes!(字符串:水题)
- hdu1170 Balloon Comes! (模拟)
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- Balloon Comes!
- swftools 命令
- linux查看内核版本、系统版本、系统位数(32or64)
- 每天写出好代码的5个建议
- 专访周家安:我的十年编程自学之路
- poj2482 离散化+线段树
- HDU1170:Balloon Comes!
- 4.5 心得 体会
- 第一次作业
- Hibernate缓存机制的分析
- MusicForYou
- 问题一: f=1+2+...+9(累加)
- 数据结构基础知识(2)
- Android开发之四(三):常用控件之提示(Toast)
- MongoDB数据库用户名和密码的设置