Search found 26 matches
- Thu Jan 01, 2009 11:59 pm
- Forum: Challenges
- Topic: SuperHack
- Replies: 38
- Views: 41469
After seeing the source and actually reading it properly it is obvious why the v instruction fails. When splicing the array, all numbers after the splice point are now shifted one to the left in memory. This is fine in HVM because that's the whole point, and the spliced value is put back onto the en...
- Thu Jan 01, 2009 1:48 am
- Forum: Challenges Solved
- Topic: Super Small Hello World
- Replies: 10
- Views: 644
- Wed Dec 31, 2008 9:42 pm
- Forum: Challenges
- Topic: Fast String Reversal
- Replies: 5
- Views: 13265
I did a rewrite of the program using a superior technique and cut 20% more off that time. It may be possible to make it even shorter still using some sort of hybrid/alternative method or other optimizations, but I think I'll stay with what I've got for now... :wink: I'm sure someone will still be ab...
- Wed Dec 31, 2008 6:01 pm
- Forum: Challenges Solved
- Topic: Super Small Quine
- Replies: 13
- Views: 904
I took a completely different approach for this which seems to work by luck
Code: Select all
0@s!@~@~@@@~01^gP1+$
- Wed Dec 31, 2008 5:03 pm
- Forum: Challenges
- Topic: Super Quine
- Replies: 13
- Views: 15886
This seems like a good example:
It's quite clear what it should print I think so I shall say no more. This example fails on both implementations... Note that both threads write 1 on the same cycle (by design) so the correct value is there for both.
Code: Select all
432&\10....ppppp!
~~~~1~
~/\~v~
~\/s/
- Wed Dec 31, 2008 5:16 am
- Forum: Challenges
- Topic: Super Quine
- Replies: 13
- Views: 15886
- Mon Dec 29, 2008 10:56 pm
- Forum: Challenges Solved
- Topic: String Reversal
- Replies: 19
- Views: 2373
- Mon Dec 29, 2008 10:48 pm
- Forum: Challenges Solved
- Topic: Whiteout
- Replies: 4
- Views: 326
- Sun Dec 21, 2008 5:42 am
- Forum: Challenges Solved
- Topic: Surely Smallest Mouse
- Replies: 19
- Views: 1608
My mouse stops reading at zero and doesn't use the ::> sequence either... it uses > though. The 21 instruction version fails when mem[2] is the solution and mem[1] is smaller than mem[0], or of course if one of the inputs is zero. The 23 instruction version however is valid for all inputs not contai...
- Sun Dec 21, 2008 1:14 am
- Forum: Challenges Solved
- Topic: Deja Vu
- Replies: 17
- Views: 2092
Deja Vu
I was wondering if the rest of you solved this in a similar way to me. I used a radix sort in base-64 and checked for duplicates when adding a value into its bucket.
- Sat Jul 28, 2007 1:27 am
- Forum: Wormageddon
- Topic: How are ranks calculated?
- Replies: 13
- Views: 42565
yeah, i wasn't sure about the best thing to do here. if the change is minor, it's useful to be able to see the old matches still. if it's major, then it's probably better not to. you can always compare dates. i'll probably lean towards wiping the old stuff. I thought it would be as simple as - bot ...
- Thu Jul 26, 2007 6:44 pm
- Forum: Wormageddon
- Topic: How are ranks calculated?
- Replies: 13
- Views: 42565
- Wed Jun 13, 2007 7:12 pm
- Forum: General Puzzles
- Topic: HOLY FUCK!
- Replies: 4
- Views: 22495
Resumé
*Volunteers to be moderator. PROS Willing to work without pay. Espeaka good engrish. Basic français und deutsch ja. Types at 60wpm. Has many previous experiences in abusing forums utilizing several individual methods. Is not evil. Uses Firefox. Is able to moderate while USA is sleeping. Understands ...
- Wed Jun 13, 2007 6:44 pm
- Forum: Bricolage
- Topic: How hard is this puzzle?
- Replies: 8
- Views: 36727
Re: How hard is this puzzle?
yes, whatever you sayCaptain Segfault wrote:Much of that is that I haven't been running it all the time.
- Wed Jun 13, 2007 6:40 pm
- Forum: The Hacker's Server
- Topic: Learning help!
- Replies: 8
- Views: 15483