I still need to find this "one parameter function" but just wanted to check.
Does "ridiculously big" mean bigger than long long? Do I need to break out BigInteger?
Search found 27 matches
- Wed Dec 05, 2012 5:23 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 078
- Replies: 16
- Views: 9781
- Mon Apr 30, 2012 9:36 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 096
- Replies: 16
- Views: 8124
Re: Problem 096
Well, I took this problem to the next level...
viewtopic.php?f=26&t=2880
LOL!
I've just launched the Sudoku Wiki app on the iPhone AppStore.
http://www.oliverfoggin.com/sudoku-wiki/
http://itunes.apple.com/gb/app/sudoku-w ... 63647?mt=8
viewtopic.php?f=26&t=2880
LOL!
I've just launched the Sudoku Wiki app on the iPhone AppStore.
http://www.oliverfoggin.com/sudoku-wiki/
http://itunes.apple.com/gb/app/sudoku-w ... 63647?mt=8
- Mon Apr 30, 2012 8:59 am
- Forum: Recreational
- Topic: Sudoku Wiki
- Replies: 0
- Views: 3632
Sudoku Wiki
About 9 months ago I started solving Problem 96 and had most of the 50 puzzles solved. I started scouring the internet for new techniques to apply to the puzzles and stumbled upon SudokuWiki.org . Anyway, I contacted the owner of the website to ask if he wanted to create an app version of the websit...
- Fri Dec 23, 2011 8:41 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 287
- Replies: 14
- Views: 7385
Re: Problem 287
Without any sort of optimizations other than the "crucial" one, it shouldn't take more than a minute or two in C++. There are other optimizations you can use that'll bring total runtimes down to less than a second. Thanks, I'll need to re-think my strategy. ATM, it uses a very human strat...
- Fri Dec 23, 2011 8:36 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 287
- Replies: 14
- Views: 7385
Re: Problem 287
OK, when I said I wasn't going to break any speed records I really wasn't joking.
By iterating up through N I've just calculated how long it's likely to take for N = 24...
485... days.
I think I need a better solution.
By iterating up through N I've just calculated how long it's likely to take for N = 24...
485... days.
I think I need a better solution.
- Thu Dec 22, 2011 7:00 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 287
- Replies: 14
- Views: 7385
Re: Problem 287
I'm not going to beat any speed records with my program but it's going to get the right answer (I think). It does for smaller values of N anyway. (My only problem might be overflow issues). For anyone else who has solved it what kind of run times do you get? I've been trying to think of a more effic...
- Thu Dec 22, 2011 12:39 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 149
- Replies: 37
- Views: 18351
Re: Problem 149
Woop!
I was doing something stupid in my algorithm!
Fixed it now after much debugging with the 4x4 grid and it ran and gave me the correct answer in 1.7 seconds
Very pleased
I was doing something stupid in my algorithm!
Fixed it now after much debugging with the 4x4 grid and it ran and gave me the correct answer in 1.7 seconds
Very pleased
- Thu Dec 22, 2011 11:44 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 149
- Replies: 37
- Views: 18351
Re: Problem 149
What sort of run times are people getting for this?
I though I had quite a good algorithm set up but it going to take well over 1 minute.
Maybe around 5 or 6 minutes I think?
And I'm not 100% certain that it's correct either
I though I had quite a good algorithm set up but it going to take well over 1 minute.
Maybe around 5 or 6 minutes I think?
And I'm not 100% certain that it's correct either
- Wed Dec 21, 2011 11:44 am
- Forum: Programming languages
- Topic: Help initialising array in C++
- Replies: 11
- Views: 8676
Help initialising array in C++
Up to now I've got round this by doing the following if I want a bool array initialised to false... bool blah[1000]; for (int i = 0; i < 1000; i++) blah[i] = false; but I am almost certain that there is a one line way of doing this but it just doesn't seem to work... What I have tried is this... boo...
- Tue Dec 20, 2011 9:21 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 107
- Replies: 28
- Views: 13531
Re: Problem 107
Cool, thanks, realised that as I was typing the question
Solved it now though and all on my own. I came up with the algorithm myself and it works in around 15ms
Just looking up the different names and it appears I used a reverse-delete algorithm
Very pleased with this one
Solved it now though and all on my own. I came up with the algorithm myself and it works in around 15ms
Just looking up the different names and it appears I used a reverse-delete algorithm
Very pleased with this one
- Tue Dec 20, 2011 12:48 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 107
- Replies: 28
- Views: 13531
Re: Problem 107
Hi, Just getting started on this and want to see if I can do it from scratch just using knowledge from previous problems etc... Anyway, I've just got a quick question. Can connections cross over each other? i.e. could you have a network with 4 nodes and 6 connections (i.e. each node connected to eve...
- Fri Oct 28, 2011 3:19 pm
- Forum: Resources
- Topic: Paper/Pencil Problems
- Replies: 73
- Views: 86916
Re: Paper/Pencil Problems
I'm almost certain that Problem 44 is possible with pen and paper.
I just haven't quite worked out exactly how yet
Will update when/if I get there.
I just haven't quite worked out exactly how yet
Will update when/if I get there.
- Fri Oct 28, 2011 10:05 am
- Forum: News, Suggestions, and FAQ
- Topic: Remember my login...?
- Replies: 4
- Views: 3633
Re: Remember my login...?
The "Remember Me" feature on this forum stores a session profile in the database which includes your IP address. The only thing I can think of at the moment is that you are masking your IP address in some way? Ah, that will be the problem. I'm on the work network at the moment which will ...
- Fri Oct 28, 2011 9:55 am
- Forum: News, Suggestions, and FAQ
- Topic: Remember my login...?
- Replies: 4
- Views: 3633
Re: Remember my login...?
I deleted all the forum.projecteuler cookies but still it isn't working.
Oh well...
Actually, I might try it on IE instead of FF.
... nope, IE doesn't work either and I've never visited these forums on IE before.
Never mind.
Thanks
Oh well...
Actually, I might try it on IE instead of FF.
... nope, IE doesn't work either and I've never visited these forums on IE before.
Never mind.
Thanks
- Fri Oct 28, 2011 9:42 am
- Forum: News, Suggestions, and FAQ
- Topic: Remember my login...?
- Replies: 4
- Views: 3633
Remember my login...?
Hi, Does anyone else have to log in every time they visit these forums? I have tried logging in using the link in the top right and with the button at the bottom of the Board Index page and every time I tick the box that says "Remember my login" (or something) but it never works. It's anno...
- Tue Oct 25, 2011 2:40 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 090
- Replies: 48
- Views: 24729
Re: Problem 090
I would say not as the first cube has the digit 0 on 3 sides which goes against the first line...
"Each of the six faces on a cube has a different digit (0 to 9) written on it"
I would interpret that as meaning each side of a dice has to be different from every other side of that dice.
"Each of the six faces on a cube has a different digit (0 to 9) written on it"
I would interpret that as meaning each side of a dice has to be different from every other side of that dice.
- Tue Oct 25, 2011 2:31 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 029
- Replies: 21
- Views: 11006
Re: Problem 029
This is annoying me now!
I really don't want to brute force it using BigInteger or anything.
I'm so close to an elegant solution that will work in thousandths of a second and will scale beautifully.
I just can't quite get it to work yet
I really don't want to brute force it using BigInteger or anything.
I'm so close to an elegant solution that will work in thousandths of a second and will scale beautifully.
I just can't quite get it to work yet
- Tue Oct 25, 2011 9:34 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 029
- Replies: 21
- Views: 11006
Re: Problem 029
Sorry yes
I was doing my testing with N=16
I was doing my testing with N=16
- Mon Oct 24, 2011 11:06 am
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 029
- Replies: 21
- Views: 11006
Re: Problem 029
I'm having the same trouble as animax and I think for the same reason. My program works for N = 5 and N = 10. My program never actually calulcates the values of a^b which is why I think my problem is the same as animax's problem. The problem starts when I go up to 16 (i.e. 2^4) (i.e. 4^2). It's just...
- Mon Oct 10, 2011 2:09 pm
- Forum: Clarifications on Project Euler Problems
- Topic: Problem 145
- Replies: 18
- Views: 9496
Re: Problem 145
LOL, I'm stuck in the same place as JMW.
I have an algorithm that gives the correct answer for the example in 24ms (using a very sow language).
However, if I have calculated the O of the algorithm correctly it will take about an hour and a half to solve for upto 999999999.
Oh well...
I have an algorithm that gives the correct answer for the example in 24ms (using a very sow language).
However, if I have calculated the O of the algorithm correctly it will take about an hour and a half to solve for upto 999999999.
Oh well...