Discussion of challenges you have already solved
-
jonik555
- Posts: 43
- Joined: Mon Aug 31, 2009 6:18 pm
- Location: Prague
Post
by jonik555 »
SuperHack is great!

mine solution: (quite large

)
Code: Select all
/*210<1+>1[ \ |
4 s / \ |
8 / /s>11*44\?-1<11!s?<\ |
/ \ 2 0 |
%111>s/,x?//\10<1+10>x\1 1 |
/ [1\ 21 > |
\/s\/\?-*84x><01/1 0 |
[\11<1+11>\ < /\ 1 |
\1><111<01/ < <1 /\ - |
1 <+ 1- 1 |
+ 11 <1 < |
x 11 11 0 |
2 11 1> 1 |
\v1v<P x?s!/\<>21v <84*-?\/\s// |
\ / |
There are 10 types of people, those who understand ternary, those who think that this joke is about binary and the others.
-
jonik555
- Posts: 43
- Joined: Mon Aug 31, 2009 6:18 pm
- Location: Prague
Post
by jonik555 »
Sorry for doublepost, but i can't edit or delete the first one
Code: Select all
/*210<1+>1[ \
4 s / \
8 / /s>11*44\?-1<11!s?<\
/ \ 2 0
%111>s/,x?//\10<1+10>x\1 1
/ [1\ 21 >
\/s\/\?-*84x><01/1 0
[\11<1+11>\ < /\ 1
\1><111<01/ < <1 /\ -
1 <+ 1- 1
+ 11 <1 <
x 11 11 0
2 11 1> 1
\v1v<P x?s!/\<>21v <84*-?\/\s//
\ /
There are 10 types of people, those who understand ternary, those who think that this joke is about binary and the others.
-
m!nus
- Posts: 202
- Joined: Sat Jul 28, 2007 6:49 pm
- Location: Germany
Post
by m!nus »
Mine's not too small either, don't ask me what it does it's from Sept 8, but last year.
Code: Select all
0048*s/,x?\[s/s/ x48*-?\?00<01<1+-x00>01<-3+[}s/01<x?\00<2+]{\
> 0 | > | | 1 |
0 0 | 1 | | - |
0 < | 0 | | 0 |
\ +1/ | \+1<10><101/ \==P>1/ |
\===========================\s!!!/?+1<00===========/
\P*84/
-
megabreit
- Posts: 141
- Joined: Sat Jan 03, 2009 3:33 pm
Post
by megabreit »
In case the world is interested, here's my solution... it's quite old too, so don't ask questions about it
Code: Select all
01-0s/,x0:1[1s/x1+vx0:1[s/1vP1-x0:1^01-:!
\ \ 0 \ +1v1/ \ / 4
s ^ s 8
0 4 \ 1[1P*/
[ 8
\1:*/
-
Huluk
- Posts: 1
- Joined: Sun Oct 17, 2010 12:05 pm
Post
by Huluk »
Finally made it!
Code: Select all
/v1==============================-1P*84\
%00s/,0^?\-1vs\199>s/s/0^48*:99<1-99>s/199<0^?\+??0^?/!
\+1v1/ + \v\ 1 | <
/>48*//=1/ 9 > P
9 \>99+\ 9 \99-1<99/
9 /99<1/ <
\+1<99\?^0-1>/
It reads all characters, writes them to memory until there is a space, prints the memory and writes to memory again until the stack is empty.
-
MrBlueSky
- Posts: 3
- Joined: Tue Jun 30, 2009 9:48 pm
Post
by MrBlueSky »
Nothing special:
Code: Select all
/ \
%9s\ 0s/,x48*-?\? 11^3^> ? 1+/ / +1 P \
\ x?\ ? 11^3^>? 0s/ s\0^2^<x1-?/ ? ? 1- x8-?\ !
\ +1>^3^1 / \ P*48 0/
Writes the words to memory, one word per line followed by chr(1) to denote the end. Then writes them back in reversed order
-
compudemon
- Posts: 33
- Joined: Sat Aug 13, 2011 2:13 pm
Post
by compudemon »
mine machines tend to look similar to each other, i tried to keep it small
Code: Select all
0s/,x?\1+s/x^?\s/1-xvP\
\===/-*8|4^x/!\?=-1x/
\?\s+s/1-xvP\
/s\1//\?-1x=/
\0P?=/
version 2 for the tiny challenge 88 but need 44 ? grr how do i cut this in half even if i take out the second print loop its not half the size
Code: Select all
!/?-1x=\%0s/=,\
/s\1-xvP/ \?x/
\=/?^x+1/s\s0P?/?-1x=\
\x^48*-?/===s\1-xvP/
-
IIMOG
- Posts: 9
- Joined: Thu Jun 02, 2011 8:35 pm
Post
by IIMOG »
My solution, with an extra printloop for the first word to prevent a space at the end:
Code: Select all
0s/,x?\s/1+xvx?\-s/1-x?\!
v x \ Pv1/
1
\ //\?-*84 /
s
\ P*48 v1\
\84*--s/1-x?\/
\ Pv1/