UVa465 Overflow

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

这题大意是给出两个整数相加或相乘，然后要求输出这两个数以及其结果中是否整数溢出，通过字符串读入整个算式，然后分离出两个整数，注意去除前导0，由于整形最大为2147483647，所以先求出两个整数的长度，若大于10，整数溢出，小于10则不溢出，等于10时再进行比对。在运算符为+时，若两个整数都不溢出，则将2147483647减去其中一个数，再与另一个数进行比对，若小于另一个数则结果也溢出。而若两个整数至少一个溢出，则结果也绝对溢出。而当运算符为*时，要注意输入是否有0，若含有0则结果不溢出，若都不为0与运算符为+时类似，将2147483647除以其中一个数后再比较另一个数。

#include <iostream>
#include <cstring>
#include <cstdio>
#include <cctype>
#include <cmath>
using namespace std;

const int N = 200;
const int MaxInt = 2147483647;
const char MaxChar[N] = {"2147483647"};

int main() {
	char temporary[2*N];
	char firstNumber[N];
	char secondNumber[N];
	char sign;
	memset(temporary,0,sizeof(temporary));
	while (gets(temporary)) {
		memset(firstNumber,0,sizeof(firstNumber));
		memset(secondNumber,0,sizeof(secondNumber));
		int lengthOfTemporary = strlen(temporary);
		int position = 0;
		for (; position < lengthOfTemporary; position++)
			if (temporary[position] != '0')
				break;
		for (int i = 0; position < lengthOfTemporary; i++,position++) {
			if (isdigit(temporary[position]))
				firstNumber[i] = temporary[position];
			else
				break;
		}
		for (; position < lengthOfTemporary; position++) {
			if (temporary[position] == '+' || temporary[position] == '*')
				sign = temporary[position];
			else if (isdigit(temporary[position]) && temporary[position] != '0')
				break;
		}
		for (int i = 0; position < lengthOfTemporary; i++,position++) {
			if (isdigit(temporary[position]))
				secondNumber[i] = temporary[position];
			else
				break;
		}
		int lengthOfFirstNumber = strlen(firstNumber);
		int lengthOfSecondNumber = strlen(secondNumber);
		int firstNumberSign = false;
		int secondNumberSign = false;
		cout << temporary << endl;
		if (lengthOfFirstNumber > 10) {
			cout << "first number too big" << endl;
			firstNumberSign = true;
		}
		else if (lengthOfFirstNumber == 10) {
			for (int i = 0; i < 10; i++) {
				if (firstNumber[i] > MaxChar[i]) {
					cout << "first number too big" << endl;
					firstNumberSign = true;
					break;
				}
				else if (firstNumber[i] < MaxChar[i])
					break;
			}
		}
		if (lengthOfSecondNumber > 10) {
			cout << "second number too big" << endl;
			secondNumberSign = true;
		}
		else if (lengthOfSecondNumber == 10) {
			for (int i = 0; i < 10; i++) {
				if (secondNumber[i] > MaxChar[i]) {
					cout << "second number too big" << endl;
					secondNumberSign = true;
					break;
				}
				else if (secondNumber[i] < MaxChar[i])
					break;
			}
		}
		if (sign == '+' || lengthOfFirstNumber && lengthOfSecondNumber) {
			if (firstNumberSign || secondNumberSign) {
				cout << "result too big" << endl;
			}
			else {
				int firstNumberInt = 0;
				int secondNumberInt = 0;
				int temporary2 = MaxInt;
				for (int i = 0; i < lengthOfFirstNumber; i++)
					firstNumberInt += (firstNumber[i] - '0') * pow(10,lengthOfFirstNumber-i-1);
				for (int i = 0; i < lengthOfSecondNumber; i++)
					secondNumberInt += (secondNumber[i] - '0') * pow(10,lengthOfSecondNumber-i-1);
				if (sign == '+')
					temporary2 -= firstNumberInt;
				else if (sign == '*' && firstNumberInt)
					temporary2 /= firstNumberInt;
				if (secondNumberInt > temporary2)
					cout << "result too big" << endl;
			}
		}
	}
	return 0;
}