Skip to content
Programming101
Programming101

Learn everything about programming

  • Home
  • CS Subjects
    • IoT – Internet of Things
    • Digital Communication
    • Human Values
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
  • HackerRank Solutions
    • HackerRank Algorithms Solutions
    • HackerRank C problems solutions
    • HackerRank C++ problems solutions
    • HackerRank Java problems solutions
    • HackerRank Python problems solutions
Programming101
Programming101

Learn everything about programming

HackerEarth Find Product problem solution

YASH PAL, 31 July 2024
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

Post navigation

Previous post
Next post
  • How AI Is Revolutionizing Personalized Learning in Schools
  • GTA 5 is the Game of the Year for 2024 and 2025
  • Hackerrank Day 5 loops 30 days of code solution
  • Hackerrank Day 6 Lets Review 30 days of code solution
  • Hackerrank Day 14 scope 30 days of code solution
©2025 Programming101 | WordPress Theme by SuperbThemes