- Related Questions & Answers
- Find reminder of array multiplication divided by n in C++
- C/C++ Program to Find the reminder of array multiplication divided by n?
- Java Program to find reminder of array multiplication divided by n
- Python Program for Find reminder of array multiplication divided by n
- C++ program for multiplication of array elements
- Program to find remainder when large number is divided by 11 in C++
- Program to find remainder when large number is divided by r in C++
- C program to print multiplication table by using for Loop
- C program to find type of array entered by the user.
- Count divisors of array multiplication in C++
- C++ Program to Generate Multiplication Table
- C++ Program to Perform Matrix Multiplication
- Program to find trailing zeros in factorial of n in C++?\n
- Find elements of an array which are divisible by N using STL in C++
- C++ Program to Perform Complex Number Multiplication

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

Here we will see how to calculate the remainder of array multiplication after dividing the result by n. The array and the value of n are supplied by the user. Suppose the array is like {12, 35, 69, 74, 165, 54} so the multiplication will be (12 * 35 * 69 * 74 * 165 * 54) = 19107673200. Now if we want to get the remainder after diving this by 47 it will be 14.

As we can see this problem is very simple. we can easily multiply the elements then by using modulus operator, it can get the result. But the main problem is when we calculate the multiplication, it may exceed the range of integer, or long also. So it may return some invalid results. To overcome this problem, we will follow this process.

begin mul := 1 for i in range 0 to size – 1, do mul := (mul * (arr[i] mod n)) mod n done return mul mod n end

#include<iostream> using namespace std; int multiplyRemainder(int arr[], int size, int n){ int mul = 1; for(int i = 0; i<size; i++){ mul = (mul * (arr[i] % n)) % n; } return mul % n; } int main(){ int arr[6] = {12, 35, 69, 74, 165, 54}; int size = 6; int n = 47; cout << "Remainder: " << multiplyRemainder(arr, size, n); }

Remainder: 14

Advertisements