UVA 465 (13.08.02)
来源:互联网 发布:吉米多维奇 知乎 编辑:程序博客网 时间:2024/04/30 08:27
Overflow
Write a program that reads an expression consisting of twonon-negative integer and an operator. Determine if either integer orthe result of the expression is too large to be represented as a``normal'' signed integer (typeinteger if you are workingPascal, type int if you are working in C).
Input
An unspecified number of lines. Each line will contain an integer, oneof the two operators+ or*, and another integer.
Output
For each line of input, print the input followed by 0-3 linescontaining as many of these three messages as are appropriate: ``firstnumber too big'', ``second number too big'', ``result too big''.
Sample Input
300 + 39999999999999999999999 + 11
Sample Output
300 + 39999999999999999999999 + 11first number too bigresult too big
题意:输入num1 + 或 * num2
若num1大于int可表示的最大值, 那么输出"first number too big"
同理num2的话, 输出"second number too big"
最后还要判定结果是否溢出, 若溢出, 输出"result too big"
都没溢出, 那么就没输出~
AC代码:
#include<stdio.h>#include<stdlib.h>#define MAX 2147483647int main() {char num1[600], num2[600];char ch;double n1, n2;while(scanf("%s %c %s", num1, &ch, num2) != EOF) {printf("%s %c %s\n", num1, ch, num2);n1 = atof(num1);n2 = atof(num2);if(n1 > MAX)printf("first number too big\n");if(n2 > MAX)printf("second number too big\n");if(ch == '+' && n1+n2 > MAX)printf("result too big\n");if(ch == '*' && n1*n2 > MAX)printf("result too big\n");}return 0;}
- UVA 465 (13.08.02)
- UVA 10494 (13.08.02)
- UVA 465
- uva 465
- uva-465
- uva 465
- uva 465
- UVA 465
- UVA 465
- UVA 424 (大树相加 13.08.02)
- UVA 10106 (大数相乘 13.08.02)
- UVA 784 (13.08.09)
- UVA 401 (13.08.01)
- UVA 10361 (13.08.01)
- UVA 537 (13.08.01)
- UVA 409 (13.08.01)
- UVA 10474 (13.08.04)
- UVA 156 (13.08.04)
- Anyevent::socket和Coro::Handle组合,echo server(完结)
- _table_scan_cost_plus_one
- 分割字符串(有一个字符串,其中包含中文字符、英文字符和数字字符,请统计和打印出各个字符的个数)
- Android中使用Gson解析JSON数据
- hdu1026 Ignatius and the Princess I (优先队列 BFS)
- UVA 465 (13.08.02)
- OcTree 八叉树
- 有向图中各点的出度和入度
- C#学习[2]--C#3.0基础学习&与C++的一些区别
- PAT_1028: List Sorting
- poj - 2195 - Going Home(最小费用最大流)
- 1242Rescue (优先队列BFS)
- Hibernate关联关系之一对多
- imagePickerController中info的对应的所有值