Anonymous user
Talk:Parallel calculations: Difference between revisions
no edit summary
(→Python example?: Necessarily exacting.) |
No edit summary |
||
Line 11:
::: Hi Paddy, I don't want to be picky, but task already does that. It says "... and return that number and its prime factors". The two solutions so far seem to do that, and I didn't think it would be a problem to change the Python version accordingly. It isn't even necessary to write a new function, just call the solution in the [[Prime decomposition]] task. --[[User:Abu|Abu]] 10:46, 21 December 2010 (UTC)
:::: Not Picky - necessarily exacting! I missed the import of the final s in your quote above. Thanks. I will fix it.
Concerning the ADA solution: My ADA reading abilities are very poor, where does the extra 32767 in the result list come from? I would expect that just 12878611 and 47 101 2713 is the right answer. --[[User:Abu|Abu]] 13:09, 21 December 2010 (UTC)
| |||