Question

Problem 02: Large Integer (20 points) In CH, the largest int value is 2147483647. So, an integer larger than this cannot be stored and processed as an integer. Similarly, if the sum or product of two positive integers is greater than 2147483647, the result will be incorrect. One way to store and manipulate large integers is to store each individual digit of the number in an array. Write a program that inputs two positive integers of, at most, 20 digits and outputs the sum of the numbers. If the sum of the numbers has more than 20 digits, output the sum with an appropriate message. Your program must, at least, contain a function to read and store a number into an array and another function to output the sum of the numbers. (Hint: Read numbers as strings and store the digits of the number in the reverse order.)

please use c++ programming and single dimensional arrays to solve this problem
thank you

Answer 1

Answer: Hey dear student finds the solution of your query if you have any doubt feel free to ask. Thanks!!

Dear student, this program has four functions. Input, reverse, sum and display. It will take inputs of two numbers as your input function. After that call reverse function to reverse two nums, this is necessary for doing the sum of two nums. then call function addNums() this performs addition of two nums(sum process with carry as normally we add num numbers) this is boolean type function if the sum exceeds MAX_SIZE it returns false otherwise true.

C++ Code:

#include <iostream>
using namespace std;

const int MAX_SIZE = 20; //constant for size

void inputNum(int num[], int &count) //function to take inputs numbers
{
   char ch;

   cin.get(ch);
   while (ch != '\n' && count < MAX_SIZE)
   {
       num[count] = ch - '0';
       count++;

       cin.get(ch);
   }
}

void reverseNums(int num[], int count) //function to reverse a number
{
   int i = 0;
   int j = count - 1;

   while (i < j)
   {
       int temp = num[i];
       num[i] = num[j];
       num[j] = temp;

       i++;
       j--;
   }
}

bool addNums(int num1[], int count1, int num2[], int count2, //function to add two numbers returns true if sum size < MAX_SIZE
       int res[], int &size) //if sum>MAX_SIZE return false
{
   int sum = 0;
   int carry = 0;
   int i = 0;
   int j = 0;

   while (i < count1 && j < count2 && size < MAX_SIZE)
   {
       sum = num1[i] + num2[j] + carry;

       if (sum > 9) //check for carry
       {
           carry = sum / 10;
           sum = sum % 10;
       }
       else
       {
           carry = 0;
       }

       res[size] = sum;
       size++;
       i++;
       j++;

       if(carry != 0 && size == MAX_SIZE)
           return false;
   }

   while (i < count1 && size < MAX_SIZE)
   {
       sum = num1[i] + carry;

       if (sum > 9) //check carry
       {
           carry = sum / 10;
           sum = sum % 10;
       }
       else
       {
           carry = 0;
       }

       res[size] = sum;
       size++;
       i++;

       if(carry != 0 && size == MAX_SIZE)
           return false;
   }

   while (j < count2 && size < MAX_SIZE)
   {
       sum = num2[j] + carry;

       if (sum > 9)
       {
           carry = sum / 10;
           sum = sum % 10;
       }
       else
       {
           carry = 0;
       }

       res[size] = sum;
       size++;
       j++;

       if(carry != 0 && size == MAX_SIZE) //size exceed
           return false;
   }

   if (carry > 0)
   {
       res[size] = carry;
       size++;
   }

   return true;
}

void display(int num[], int count) //display numbers and sum
{
   for (int i = count - 1; i >= 0; i--)
   {
       cout << num[i];
   }
}

int main()
{
   int num1[MAX_SIZE]; //array1 to store num1
   int num2[MAX_SIZE]; //array to store num2
   int res[MAX_SIZE]; //array to store sum
   int count1 = 0;   
   int count2 = 0;
   int size = 0;

   cout << "Enter the first number: ";
   inputNum(num1, count1); //prompts for num1

   cout << "Enter the second number: ";
   inputNum(num2, count2); //prompts for num2

   reverseNums(num1, count1); //reverse num1
   reverseNums(num2, count2); //reverse num2

   bool ans = addNums(num1, count1, num2, count2, res, size); //call addNums() and returning to bool variable

   if(ans) //if true display sum and numbers
   {
       cout << endl;
       display(num1, count1);
       cout << " + ";
       display(num2, count2);
       cout << " = ";
       display(res, size);
       cout << endl;
   }
   else //display message
   {
       cout << "Sum is overflow" << endl;
   }

   return 0;
}

Enter the first number: 2315423621 Enter the second number: 1243025123 2315423621 + 1243025123 = 3558448744