Discussion of challenges you have already solved
-
Millennium
- Posts: 17
- Joined: Thu Apr 21, 2011 3:08 am
Post
by Millennium »
Triton456 wrote:I just used Wolfram|Alpha
Simple, but effective
Also worked for about five other challenges.
http://www.wolframalpha.com/
Greetz,
Triton456
I hate to say it, but I used Wolfram for this one too
Just typed in: prime factors of [the number]
-
Mad Mike
- Posts: 11
- Joined: Tue Jun 21, 2011 4:38 pm
Post
by Mad Mike »
i tried java but it took years until it ran out of heap, so...
wolfram alpha and done.. piece of cake
chown -R us ./base
-
Besere
- Posts: 12
- Joined: Sat Mar 12, 2011 12:58 pm
Post
by Besere »
I got it using java but it took like 5 minutes.
Can someone post a more efficient code using a better algorithm?
-
exomo
- Posts: 3
- Joined: Wed Jun 27, 2012 3:21 pm
Post
by exomo »
Unfortunately the solution of this can be found via google.
Perhaps the number should be changed to some other big number.
-
AMindForeverVoyaging
- Forum Admin
- Posts: 496
- Joined: Sat May 28, 2011 9:14 am
- Location: Germany
Post
by AMindForeverVoyaging »
exomo wrote:Unfortunately the solution of this can be found via google.
Perhaps the number should be changed to some other big number.
There are still websites like Wolfram Alpha, and software like GNU Octave and others, so it's not like that would make a lot of difference I guess.