HACM 1170 Balloon Comes!
来源:互联网 发布:java归并排序算法 编辑:程序博客网 时间:2024/06/17 06:13
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 <iostream> #include<string> using namespace std; int main() { int n; char s; int a, b; while (cin>>n) { for (int i = 0; i < n; i++) { cin >> s >> a >> b; getchar(); if (s== '+') cout<<a+b<<endl; else if (s == '-') cout<<a-b<<endl; else if (s== '*') cout<<a*b<<endl; else if (a%b != 0)//a 不可以整除b,则输出保留2位有效数字 { cout.precision(2); cout << fixed <<1.0*a/b<<endl; } else cout<<a / b<<endl; } } return 0; }
0 0
- HACM 1170 Balloon Comes!
- 1170 Balloon Comes!
- HDU 1170 Balloon Comes!
- HDU 1170 ( Balloon Comes! )
- HDU 1170 Balloon Comes!
- HDU 1170 Balloon Comes!
- Balloon Comes! 1170
- HDU 1170Balloon Comes!
- hd 1170 Balloon Comes!
- HDU 1170 Balloon Comes!
- 1170 Balloon Comes!
- HDU 1170 Balloon Comes!
- HDOJ 1170 Balloon Comes!
- hdu 1170 Balloon Comes
- 1170:Balloon Comes!
- hdu-1170 Balloon Comes!
- HDU 1170 Balloon Comes!
- 1170 Balloon Comes!
- 多线程
- iOS开发 - 网络编程之HTTP协议
- ID3决策树算法
- zzulioj1895: 985的0-1串难题(思维)
- n个人围成一圈,从第1个人开始数数,数到3的人出圈,输出最后剩余的人编号(约瑟夫环问题)
- HACM 1170 Balloon Comes!
- Qt通过QToolTip显示浮动信息
- Visual Studio里的ASCII编码和unicode编码
- MeasureSpec的三种模式的意思
- 【python】杂笔记
- 字符串匹配之KMP算法
- TOJ 1473.Moving Tables
- Android 使用View Animation实现动画加载界面
- javascript变量声明提升(hoisting)