hdu 1170 Balloon Comes!

Balloon Comes!

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 26455    Accepted Submission(s): 10055

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

分析:简单题,只要注意除法的时候,如果能整除则直接输出就行,否则保留两位小数

 1 #include <iostream>
 2 #include <cstdio>
 3 using namespace std;
 4
 5 int main(){
 6     char c;
 7     int t, a, b;
 8     cin >> t;
 9     while(t--){
10         cin >> c >> a >> b;
11         if(c == ‘+‘)
12             cout << (a + b) << endl;
13         else if(c == ‘-‘)
14             cout << (a - b) << endl;
15         else if(c == ‘*‘)
16             cout << (a * b) << endl;
17         else if(c == ‘/‘){
18             if(a % b == 0)
19                 cout << (a / b) << endl;
20             else
21                 printf("%.2f\n", (float)a / b);
22         }
23     }
24     return 0;
25 }
时间: 2024-10-10 10:17:36

hdu 1170 Balloon Comes!的相关文章

HDU 1170

Balloon Comes! Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 4951    Accepted Submission(s): 1589 Problem Description The contest starts now! How excited it is to see balloons floating around

HDOJ 1170 Balloon Comes!

[题意]:输入一个符号(加减乘除) 后边跟上两个操作数.输出结果,如果不是整数,保留两位小数.注意:The result should be rounded to 2 decimal places If and only if it is not an integer.需要判断是不是整数,不是全部保留两位小数. 可以对整个字符串分割,或者采用一个char加两个int的输入. [AC代码]: #include <iostream> #include <cstdlib> #includ

HDU 1004 Let the Balloon Rise【STL&lt;map&gt;】

Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 123800    Accepted Submission(s): 48826 Problem Description Contest time again! How excited it is to see balloons floating ar

Balloon Comes! hdu(小数位数处理)

Balloon Comes! Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 5402 Accepted Submission(s): 1722 Problem Description The contest starts now! How excited it is to see balloons floating around. You,

背包系列练习( hdu 2844 Coins &amp;&amp; hdu 2159 &amp;&amp; poj 1170 Shopping Offers &amp;&amp; hdu 3092 Least common multiple &amp;&amp; poj 1015 Jury Compromise)

作为一个oier,以及大学acm党背包是必不可少的一部分.好久没做背包类动规了.久违地练习下-.- dd__engi的背包九讲:http://love-oriented.com/pack/ 鸣谢http://blog.csdn.net/eagle_or_snail/article/details/50987044,这里有大部分比较有趣的dp练手题. hdu 2844 Coins 多重背包 就是一个10w的多重背包,每个物品的cost同时也作为value去做背包,我们求的是每个容量下的价值,所以没

hdu 1004 Let the Balloon Rise

Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 80469    Accepted Submission(s): 30293 Problem Description Contest time again! How excited it is to see balloons floating aro

HDU 1004 Let the Balloon Rise map

Let the Balloon Rise Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 104108    Accepted Submission(s): 40046 Problem Description Contest time again! How excited it is to see balloons floating ar

Let the Balloon Rise HDU 1004

Let the Balloon Rise Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 150   Accepted Submission(s) : 63 Problem Description Contest time again! How excited it is to see balloons floating around. B

HDU 1004 Let the Balloon Rise (map使用)

分析:题意简单,就用map的知识即可 #include <stdio.h> #include <iostream> #include <string.h> #include <map> using namespace std; int main() { int i,a,b,k; int N; char num[10]; while (~scanf("%d",&N)) { map<string,int> mp; whil