So there is a website named interviewstreet.com. Here we can find challenging programming problems. Unfortunately you have to be logged in to see the questions.
Here's a brief description of the problem I'm attempting to solve:
Find the no of positive integral solutions for the equations (1/x) + (1/y) = 1/N!
(read 1 by n factorial) Print a single integer which is the no of positive integral solutions modulo 1000007.
For example, when N=3
, (x,y)
can be: (7,42)
, (9,18)
, (8,24)
, (12,12)
, (42,7)
, (18,9)
, (24,8)
. Or so I thought.
Help me please, especially you who have solved this problem. I have just coded for the problem Equations. There is something wrong with my algorithm, can I ask for output for the first 10 integers? i.e. N=2
, N=3
, N=4
... N=10
so that I can find out the flaw in my algorithm. Thanks :)
EDIT: Oh, please don't post solution code as it will ruin the fun for me and for people trying to solve this :)
See Question&Answers more detail:
os 与恶龙缠斗过久,自身亦成为恶龙;凝视深渊过久,深渊将回以凝视…