[HDU]1.2.3 Balloon Comes!
来源:互联网 发布:淘宝流程图 编辑:程序博客网 时间:2024/06/05 02:39
纯水题,加减乘数。
起初没考虑商为整数的情况,两次WA,自责…
Problem:
Balloon Comes!
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5094 Accepted Submission(s): 1641Problem 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
Code:
#include<stdio.h>int main(){ int T,a,b; char operation[2]; scanf("%d",&T); while(T--) { scanf("%s%d%d",operation,&a,&b); switch(operation[0]) { case '+': printf("%d\n",a+b); break; case '-': printf("%d\n",a-b); break; case '*': printf("%d\n",a*b); break; case '/': if(a%b == 0) printf("%d\n",a/b); else printf("%.2lf\n",(double)a/b); break; } } return 0;}
Tip
如果直接使用
char operation;scanf("%c%d%d",operation,&a,&b);
operation会读取上一行末尾的'\n',进而出错。
我在这里使用了字符串输入解决
char operation[2];scanf("%s%d%d",operation,&a,&b);
后来发现如下其他办法:
getchar();scanf("%c %d %d",&c,&a,&b);
while(isspace((opnd=getchar())));
0 0
- [HDU]1.2.3 Balloon Comes!
- HDU 1170 Balloon Comes!
- HDU 1170 ( Balloon Comes! )
- HDU 1170 Balloon Comes!
- hdu-Balloon Comes!
- HDU Balloon Comes!
- HDU 1170 Balloon Comes!
- HDU 1170Balloon Comes!
- HDU 1170 Balloon Comes!
- HDU 1170 Balloon Comes!
- hdu 1170 Balloon Comes
- hdu-1170 Balloon Comes!
- HDU 1170 Balloon Comes!
- HDU 1170 Balloon Comes!
- hdu-oj 1170 Balloon Comes!
- hdu 1170 Balloon Comes!(模拟)
- ACM HDU p1170 Balloon Comes!
- HDU 1170 Balloon Comes!【水题】
- qsort的用法
- E-R图
- H5即将迎来黄金时代 轻应用再成行业焦点
- 用Swift写输入日期计算天数的Demo
- Android SDK Android NDK Android Studio 官方下载地址
- [HDU]1.2.3 Balloon Comes!
- poj 1976 A Mini Locomotive 二维背包
- sublime text 2 破解 亲测可用
- 用dfs求无向图的割点割边
- LeetCode Search a 2D Matrix
- nginx+gunicorn+django
- Oracle日志操作模式(归档模式和非归档模式的利与弊)
- NOJ 1119 仙林鼎山游乐园 (有向图判环 Floyd)
- spring中的控制反转和依赖注入