Square of large number represented as String
Given a very large number, the task is to write a program to compute its square.
Examples:
Input: 9999
Output: 99980001
9999*9999 = 99980001
Input: 45454545
Output: 2066115661157025
45454545*45454545 = 2066115661157025
Naive Approach: A naive approach is to calculate the squares my multiplying the number with itself. But in C++, if the input is a large number, the resultant square will overflow.
Efficient Approach: An efficient approach is to store the number as strings, and perform multiplication of two large numbers.
Below is the implementation of the above approach:
C++
// C++ program to multiply two numbers // represented as strings. #include <bits/stdc++.h> using namespace std; // Multiplies str1 and str2, and prints result. string multiply(string num1, string num2) { int n1 = num1.size(); int n2 = num2.size(); if (n1 == 0 || n2 == 0) return "0"; // will keep the result number in vector // in reverse order vector<int> result(n1 + n2, 0); // Below two indexes are used to find positions // in result. int i_n1 = 0; int i_n2 = 0; // Go from right to left in num1 for (int i = n1 - 1; i >= 0; i--) { int carry = 0; int n1 = num1[i] - '0'; // To shift position to left after every // multiplication of a digit in num2 i_n2 = 0; // Go from right to left in num2 for (int j = n2 - 1; j >= 0; j--) { // Take current digit of second number int n2 = num2[j] - '0'; // Multiply with current digit of first number // and add result to previously stored result // at current position. int sum = n1 * n2 + result[i_n1 + i_n2] + carry; // Carry for next iteration carry = sum / 10; // Store result result[i_n1 + i_n2] = sum % 10; i_n2++; } // store carry in next cell if (carry > 0) result[i_n1 + i_n2] += carry; // To shift position to left after every // multiplication of a digit in num1. i_n1++; } // ignore '0's from the right int i = result.size() - 1; while (i >= 0 && result[i] == 0) i--; // If all were '0's - means either both or // one of num1 or num2 were '0' if (i == -1) return "0"; // generate the result string string s = ""; while (i >= 0) s += std::to_string(result[i--]); return s; } // Driver code int main() { string str1 = "454545454545454545"; cout << multiply(str1, str1); return 0; } |
chevron_right
filter_none
Java
// Java program to multiply two numbers // represented as strings. class GFG { // Multiplies str1 and str2, and prints result. public static String multiply(String num1, String num2) { int n1 = num1.length(); int n2 = num2.length(); if (n1 == 0 || n2 == 0) return "0"; // will keep the result number in vector // in reverse order int[] result = new int[n1 + n2]; // Below two indexes are used to find positions // in result. int i_n1 = 0; int i_n2 = 0; // Go from right to left in num1 for (int i = n1 - 1; i >= 0; i--) { int carry = 0; int n_1 = num1.charAt(i) - '0'; // To shift position to left after every // multiplication of a digit in num2 i_n2 = 0; // Go from right to left in num2 for (int j = n2 - 1; j >= 0; j--) { // Take current digit of second number int n_2 = num2.charAt(j) - '0'; // Multiply with current digit of first number // and add result to previously stored result // at current position. int sum = n_1 * n_2 + result[i_n1 + i_n2] + carry; // Carry for next iteration carry = sum / 10; // Store result result[i_n1 + i_n2] = sum % 10; i_n2++; } // store carry in next cell if (carry > 0) result[i_n1 + i_n2] += carry; // To shift position to left after every // multiplication of a digit in num1. i_n1++; } // ignore '0's from the right int i = result.length - 1; while (i >= 0 && result[i] == 0) i--; // If all were '0's - means either both or // one of num1 or num2 were '0' if (i == -1) return "0"; // generate the result string String s = ""; while (i >= 0) s += Integer.toString(result[i--]); return s; } // Driver code public static void main(String[] args) { String str1 = "454545454545454545"; System.out.println(multiply(str1, str1)); } } // This code is contributed by // sanjeev2552 |
chevron_right
filter_none
C#
// C# program to multiply two numbers // represented as strings. using System; using System.Collections.Generic; class GFG { // Multiplies str1 and str2, // and prints result. public static String multiply(String num1, String num2) { int n1 = num1.Length; int n2 = num2.Length; if (n1 == 0 || n2 == 0) return "0"; // will keep the result number in vector // in reverse order int[] result = new int[n1 + n2]; // Below two indexes are used to // find positions in result. int i_n1 = 0; int i_n2 = 0; int i = 0; // Go from right to left in num1 for (i = n1 - 1; i >= 0; i--) { int carry = 0; int n_1 = num1[i] - '0'; // To shift position to left after every // multiplication of a digit in num2 i_n2 = 0; // Go from right to left in num2 for (int j = n2 - 1; j >= 0; j--) { // Take current digit of second number int n_2 = num2[j] - '0'; // Multiply with current digit of first number // and add result to previously stored result // at current position. int sum = n_1 * n_2 + result[i_n1 + i_n2] + carry; // Carry for next iteration carry = sum / 10; // Store result result[i_n1 + i_n2] = sum % 10; i_n2++; } // store carry in next cell if (carry > 0) result[i_n1 + i_n2] += carry; // To shift position to left after every // multiplication of a digit in num1. i_n1++; } // ignore '0's from the right i = result.Length - 1; while (i >= 0 && result[i] == 0) i--; // If all were '0's - means either both or // one of num1 or num2 were '0' if (i == -1) return "0"; // generate the result string String s = ""; while (i >= 0) s += (result[i--]).ToString(); return s; } // Driver code public static void Main(String[] args) { String str1 = "454545454545454545"; Console.WriteLine(multiply(str1, str1)); } } // This code is contributed by Princi Singh |
chevron_right
filter_none
Output:
206611570247933883884297520661157025
Recommended Posts:
- Divide large number represented as string
- Check whether a large number represented as array is divisible by Y
- Multiply Large Numbers represented as Strings
- Modulo power for large numbers represented as strings
- Evaluate a boolean expression represented as string
- Product of nodes at k-th level in a tree represented as string
- Modulo of a large Binary String
- Add 1 to number represented as array | Recursive Approach
- Check if a number can be represented as a sum of 2 triangular numbers
- Sum of two numbers where one number is represented as array of digits
- Find the smallest positive number which can not be represented by given digits
- Check in binary array the number represented by a subarray is odd or even
- Factorial of a large number
- Find if a given string can be represented from a substring by iterating the substring “n” times
- Perfect Square String
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
- Lexicographically largest permutation of the array such that a[i] = a[i-1] + gcd(a[i-1], a[i-2])
- Find the final sequence of the array after performing given operations
- Find all combinations of two equal sum subsequences
- Right most non-zero digit in multiplication of array elements
- Find the maximum elements in the first and the second halves of the Array