Skip to content
Programmingoneonone
Programmingoneonone
  • Engineering Subjects
    • Internet of Things (IoT)
    • Digital Communication
    • Human Values
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
    • 100+ C++ Programs
  • Solutions
    • HackerRank
      • Algorithms Solutions
      • C solutions
      • C++ solutions
      • Java solutions
      • Python solutions
      • Data Structures Solutions
    • Leetcode Solutions
    • HackerEarth Solutions
  • Work with US
Programmingoneonone
Programmingoneonone

HackerEarth Find Product problem solution

YASH PAL, 31 July 202413 February 2026
In this HackerEarth Find Product problem solution, you have been given an array A of size N consisting of positive integers. You need to find and print the product of all the numbers in this array Modulo 10 to power 9 plus 7.
 
hackerEarth Find Product problem solution
 
 

HackerEarth Find Product problem solution.

#include<stdio.h>

int main()

{

long int a[1000],n,i,prd=1,mod=1000000007;

scanf("%ld",&n);

for(i=0;i<n;i++)

{

scanf("%ld",&a[i]);

prd=((prd*a[i])%mod);

//prd=prd*a[i];

}

printf("%ld",prd);

}
 
 
coding problems solutions HackerEarth HackerEarth

Post navigation

Previous post
Next post

Leave a Reply

Your email address will not be published. Required fields are marked *

Programmingoneonone

We at Programmingoneonone, also known as Programming101 is a learning hub of programming and other related stuff. We provide free learning tutorials/articles related to programming and other technical stuff to people who are eager to learn about it.

Pages

  • About US
  • Contact US
  • Privacy Policy

Practice

  • Java
  • C++
  • C

Follow US

  • YouTube
  • LinkedIn
  • Facebook
  • Pinterest
  • Instagram
©2026 Programmingoneonone | WordPress Theme by SuperbThemes