zoukankan      html  css  js  c++  java
  • UVA_ Overflow

    Description

    Download as PDF
     

     

     Overflow 

    Write a program that reads an expression consisting of two non-negative integer and an operator. Determine if either integer or the result of the expression is too large to be represented as a ``normal'' signed integer (type integer if you are working Pascal, type int if you are working in C).

    Input

    An unspecified number of lines. Each line will contain an integer, one of the two operators + or *, and another integer.

    Output

    For each line of input, print the input followed by 0-3 lines containing as many of these three messages as are appropriate: ``first number too big'', ``second number too big'', ``result too big''.

    Sample Input

    300 + 3
    9999999999999999999999 + 11

    Sample Output

    300 + 3
    9999999999999999999999 + 11
    first number too big
    result too big
    这道题考的是 atof 的用法;
    atof 把字符串转换成浮点数;
     
    代码:
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <cstdlib>
     4 #include <cstring>
     5 #define UNIT 10
     6 #define MAX 2147483647
     7 
     8 using namespace std;
     9 
    10 char a[1000],b[1000],ch;
    11 int main()
    12 {
    13     //freopen("ACM.txt","r",stdin);
    14     while(scanf("%s %c %s", a, &ch, b)!=EOF)
    15     {
    16         printf("%s %c %s
    ",a,ch,b);
    17         double x1,x2;
    18         x1=atof(a);
    19         x2=atof(b);
    20         if(x1>MAX)
    21         cout<<"first number too big"<<endl;
    22         if(x2>MAX)
    23         cout<<"second number too big"<<endl;
    24         if(ch=='+'&&x1+x2>MAX||ch=='*'&&x1*x2>MAX)
    25         cout<<"result too big"<<endl;
    26 
    27     }
    28     return 0;
    29 }
    View Code
     
  • 相关阅读:
    微博那点事(2)
    微博那点事(1)
    Netty断线重连
    高效沟通技巧
    Latex 公式在线可视化编辑器
    RPC框架原理与实现
    Java 静态代理与动态代理
    程序员主管之路(1)
    MarkDown 常用语法教程
    Solr vs. Elasticsearch谁是开源搜索引擎王者
  • 原文地址:https://www.cnblogs.com/M-D-LUFFI/p/4050194.html
Copyright © 2011-2022 走看看