Can someone tell what is wrong with my program at http://www.codechef.com/viewsolution/7091224 for the problem Product of Divisors at http://www.codechef.com/problems/D1/

# Product of Divisors

**rcsldav2017**#2

@agnelvishal hi here is a little optimization…use squaring for last ans calculation…where u had calculated value of a…then use squaring method to reduce little complexity and try other …

**rcsldav2017**#4

@agnelvishal …for calculating pow(N,a)…in log(a) complexity here is little **psuedo code**

**Complexity : O(log(POW))**

**#define MOD 1000000007**

long long int (long long int N,long long int POW)

{

if(POW<=0) return 1;

if(N==1) return 1;

long long int ans=1;

while(POW)

{

if(POW%2){

ans*=N;

POW–;

if(ans>=MOD) ans%=MOD;

}

N*=N;

POW/=2;

if(N>=MOD) N%=MOD;

}

}

**rcsldav2017**#5

here is my solution link…http://www.codechef.com/viewsolution/7108948

**what is wrong with my solution??**

**can u find error??**