Timeline for Prime numbers, Prime Factors and LCM
Current License: CC BY-SA 3.0
5 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 18, 2012 at 14:11 | history | edited | zdd | CC BY-SA 3.0 |
added 60 characters in body
|
| Oct 18, 2012 at 14:03 | comment | added | zdd | Yes, you are right, the solution won't work if a or b is 1001, may be we can use a list to store a key-value pair where the key is the factor and the value is the times of that factor, but that will make the code more complexity, I like simple code :) | |
| Oct 18, 2012 at 14:00 | comment | added | Adil Mughal | I like your approach. The only thing we would lose its extra space...int[1000]. Plus few queries: -Is 1000 definite? - for (int m = 0; m < factorsA.Length; ++m) would that work if factorsB length is greater than factorsA ? | |
| Oct 18, 2012 at 13:57 | review | First posts | |||
| Oct 18, 2012 at 15:25 | |||||
| Oct 18, 2012 at 13:55 | history | answered | zdd | CC BY-SA 3.0 |