|
Apr
22 |
|
comment |
optimal algorithm for particular divisors does it count the exact number of divisors for a given number? Or it counts what I asked for? |
|
Apr
16 |
|
comment |
optimal algorithm for particular divisors Please clear my confusion |
|
Apr
14 |
|
comment |
optimal algorithm for particular divisors @I have edited it the way you said. |
|
Apr
14 |
|
answered | find lowest index of a given value in a presorted array |
|
Apr
14 |
|
answered | I need an optimal algorithm to find the largest divisor of a number N. Preferably in C++ or C# |
|
Apr
14 |
|
comment |
optimal algorithm for particular divisors I am sorry to say, but even after your this hard effort, it is unable to understand your algorithm this way. You also have some mistakes in writing which become confusion. And one thing, have you mistakenly written r1 as rb1? if not, what does rb1 signify? and how is it different from r1? |
|
Apr
14 |
|
revised |
optimal algorithm for particular divisors added 68 characters in body |
|
Apr
14 |
|
comment |
optimal algorithm for particular divisors oh! Thanks. Actually I came across this problem. I mostly solve problems in PHP. I know C/C++ but I feel comfortable with PHP. I am using BC modules like bcdiv, bcmod etc. for heavy calculations. |
|
Apr
13 |
|
comment |
optimal algorithm for particular divisors Thanks a lot for your time. By the way, I think this is a good problem, so why has it been rated -2? I am beginner sO I don't have chatting privileges.That's why I am asking here. |
|
Apr
13 |
|
comment |
optimal algorithm for particular divisors I will try to. Thanks a lot for your time. By the way, I think this is a good problem, so why has it been rated -2? I am beginner sO I don't have chatting privileges.That's why I am asking here. |
|
Apr
13 |
|
comment |
optimal algorithm for particular divisors Yes, you were getting them before. But what you suggested at last seems to work fine. Thanks. |
|
Apr
13 |
|
comment |
optimal algorithm for particular divisors That's what I was thinking. Just finding the co primes wouldn't have done and that's what I was trying to point out. I will try this and do let you know if it works. |
|
Apr
13 |
|
comment |
optimal algorithm for particular divisors I wrote that by mistake. I am waiting. Thanks. |
|
Apr
13 |
|
comment |
optimal algorithm for particular divisors Could you please present a working example? Its hard to understand in this way. |
|
Apr
13 |
|
comment |
optimal algorithm for particular divisors Actually, you got the problem wrong. I want the number of divisors of N which doesn't divide any of the numbers present in the list. |
|
Apr
13 |
|
comment |
optimal algorithm for particular divisors I understood the meaning of coprimes and I have read them before also. But, what I am not getting is how is finding the coprimes exactly going to help. Please explain in some more detailed words. |
|
Apr
13 |
|
comment |
optimal algorithm for particular divisors That sounds new but I am not able to think that what do I do after finding coprimes of N from list L? Please state some more detail. |
|
Apr
13 |
|
comment |
optimal algorithm for particular divisors @amit If you read the question, you will get the differences in 1 go. This happens because I can't create new tags, so my old tags match the tags for this problem. So everyone gets this as 1st option in related problems column. |
|
Apr
13 |
|
comment |
optimal algorithm for particular divisors @amit No it is not. Please don't say it on my every question. I ask question after searching a lot. Read the question statements clearly first. |
|
Apr
13 |
|
revised |
optimal algorithm for particular divisors deleted 7 characters in body |
