hdu——1170——Balloon Comes!
2013-11-05 18:03
375 查看
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
Sample Output
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
#include <iostream> #include <iomanip> #include <algorithm> #include <stdio.h> using namespace std; int main() { int t; char s; int a,b; while(cin>>t) { while(t--) { cin>>s; cin>>a>>b; if(s=='+') cout<<a+b<<endl; else if(s=='-') cout<<a-b<<endl; else if(s=='*') cout<<a*b<<endl; else if(s=='/') { double c=a/(b*1.0); if(int(c)==c) cout<<c<<endl; else cout<<fixed<<setprecision(2)<<c<<endl; } } } return 0; }
相关文章推荐
- HDU 1170 ( Balloon Comes! )
- hdu 1170 Balloon Comes!(模拟)
- hdu-1170 Balloon Comes!
- hdu1170 Balloon Comes!(字符串:水题)
- HDU 1170 Balloon Comes!(计算表达式)
- HDU1170 Balloon Comes!【水题】
- hdu1170 Balloon Comes!
- HDU 1170 Balloon Comes!
- hdu 1170 Balloon Comes!(水题)
- HDU 1170 Balloon Comes!【水题】
- HDU 1170 Balloon Comes! 简单的四则运算
- 【ACM】hdu_1170_Balloon Comes!_201307261946
- hdu 1170 Balloon Comes! 水的很 !!!!!!!!!
- HDU 1170 Balloon Comes!
- hdu_1170_Balloon Comes!_水之
- 杭电 HDU 1170 Balloon Comes!
- HDU1170 Balloon Comes!
- hdu 1170(Balloon Comes!)
- Hdu 1170 Balloon Comes!
- HDU 1170 Balloon Comes!