I am able to find error in my code plz help

#1

code link : https://ide.codingblocks.com/s/175104

#2

Hi @siddharth9k9, can u pls share the question here, so that we can reply asap to your doubt.

#3

You are given an integer array A of size x denoting the prime powers of an integer N. Ai denotes the power of ith prime in the prime factorization of N. To make it more clear, A1 will denote the power of 2 in the prime factorization of N A2 will denote the power of 3 in the prime factorization of N and so on. Consider a number P. P equals to the product of all the divisors of N You have to find the number of divisors of P. Output it modulo 109+7.

#4

Hey @siddharth9k9 You are getting wrong answer because of integer overflow. I would suggest you to change your entire approach and tackle the problem with more generality,i.e., without computing the primes and P, instead using basic permutation & combination to solve this problem.