×

# Product of Divisors

 1 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/ asked 06 Jun '15, 02:14 13●1●5 accept rate: 0%

 0 @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 ... answered 06 Jun '15, 04:29 1.1k●12●29 accept rate: 6%
 0 Sorry but I did not understand what is squaring and where did you ask to use it. answered 06 Jun '15, 09:24 13●1●5 accept rate: 0%
 0 @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; } } answered 07 Jun '15, 11:43 1.1k●12●29 accept rate: 6%
 0 here is my solution link...http://www.codechef.com/viewsolution/7108948 what is wrong with my solution?? can u find error?? answered 07 Jun '15, 11:49 1.1k●12●29 accept rate: 6%
 toggle preview community wiki:
Preview

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×266
×205
×75
×38

question asked: 06 Jun '15, 02:14

question was seen: 1,132 times

last updated: 07 Jun '15, 11:49