Skip to content
Programmingoneonone
Programmingoneonone
  • Home
  • CS Subjects
    • IoT ? Internet of Things
    • Digital Communication
    • Human Values
  • Programming Tutorials
    • C Programming
    • Data structures and Algorithms
    • 100+ Java Programs
    • 100+ C Programs
  • HackerRank Solutions
    • HackerRank Algorithms Solutions
    • HackerRank C problems solutions
    • HackerRank C++ problems solutions
    • HackerRank Java problems solutions
    • HackerRank Python problems solutions
Programmingoneonone

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 solutions

Post navigation

Previous post
Next post

Pages

  • About US
  • Contact US
  • Privacy Policy

Programing Practice

  • C Programs
  • java Programs

HackerRank Solutions

  • C
  • C++
  • Java
  • Python
  • Algorithm

Other

  • Leetcode Solutions
  • Interview Preparation

Programming Tutorials

  • DSA
  • C

CS Subjects

  • Digital Communication
  • Human Values
  • Internet Of Things
  • YouTube
  • LinkedIn
  • Facebook
  • Pinterest
  • Instagram
©2025 Programmingoneonone | WordPress Theme by SuperbThemes