Unscramble the Source Code [robber thread for cracking attempts]

Question

This is the companion thread to the main Unscramble the Source Code challenge. If you think you have managed to unscramble one of the cop answers, you should post your solution as the answer to this thread.

As a reminder, you have one attempt at cracking each submission. Your cracking attempt will be an unscrambled version of the source code. If your guess matches the description (same characters, output, and of course language), and you are the first correct guess, then you win a point. It is important to note that your program does not have to exactly match the original, simply use the same characters and have the same functionality. This means there could be more than one correct answer.

The robber with the most points (successful cracks) wins.

Leaderboard

Too many solves

• Martin Büttner: (Python 3, 16, matsjoyce), (CJam, 15, Ypnypn), (Mathematica, 29, Fox Wilson), (JavaScript, 15, Caridorc), (CJam, 52, user23013), (Pyth, 11, isaacg), (PHP, 22, kenorb), (PHP, 13, kenorb), (Ruby, 17, Doorknob), (PHP, 49, bwoebi), (Mathematica, 35, Tally), (GolfScript, 13, Peter Taylor), (JavaScript, 25, Cris), (JavaScript, 29, Cris), (JavaScript, 26, Cris), (Bash, 33, Debasis), (JavaScript, 10, Cris), (Lua, 28, ChipperNickel), (Mathematica, 18, Arcinde), (JavaScript, 30, Qwertiy), (CJam, 13, user23013), (JavaScript, 41, Ismael Miguel), (Ruby, 38, Doorknob), (Marbelous, 36, es1024), (PHP, 33, Ismael Miguel), (JavaScript, 29, Joe), (JavaScript, 28, Shawn Holzworth), (Ruby, 35, histocrat), (CJam, 19, Ypnypn), (Ruby, 17, Stephen Touset), (JavaScript, 36, MegaTom), (JavaScript, 24, fogcityben), (Python 3, 21, Reticality), (JavaScript, 10, Jamie Barker), (JavaScript, 15, Jamie Barker)

20 solves

• feersum: (Python 3, 44, Sp3000), (C, 70, es1024), (MATLAB, 41, COTO), (Brainfuck, 118, Sp3000), (C, 30, Ethiraric), (C, 28, Mig), (Python 3, 46, hosch250), (Java, 70, Rodolvertice), (C, 29, imallett), (Java, 226, nhahtdh), (Little Man Computer, 63, The Wolf), (Python 2, 89, Beta Decay), (Python 2, 41, muddyfish), (C, 63, es1024), (C++, 192, Arcinde), (Java, 108, durron597), (C#, 604, eshansingh1), (C, 44, Art), (Java, 134, Olavi Mustanoja), (Bash, 47, Vi.)

15 solves

• user23013: (CJam, 18, Ypnypn), (JavaScript, 26, hsl), (CJam, 12, COTO), (PHP, 23, bwoebi), (PHP, 54, Steve Robbins), (CJam, 32, Dennis), (CJam, 19, Martin Büttner), (Bash, 23, The Wolf), (Ruby, 33, Doorknob), (CJam, 34, Dennis), (JavaScript, 82, Ismael Miguel), (PHP, 80, Ismael Miguel), (QBasic, 43, DLosc), (QBasic, 42, DLosc), (ECMAScript, 90, Cris)

10 solves

• squeamish ossifrage: (Python, 44, Caridorc), (PHP, 52, PleaseStand), (Befunge-93, 17, user23013), (BBC BASIC, 187, Beta Decay), (C, 43, Allbeert), (Ruby, 58, Rodolvertice), (JavaScript, 32, hsl), (PHP, 33, kenorb), (Python 2, 16, imallett), (PHP, 53, PleaseStand)
• Sp3000: (Python, 154, Fox Wilson), (Python, 48, kgull), (Python, 68, horns), (Python 2, 38, FryAmTheEggman), (Python 2, 57, FryAmTheEggman), (Python, 74, xnor), (JavaScript, 66, Cris), (JavaScript, 70, Cris), (Python 2, 37, muddyfish), (Python, 55, FireFly)

7 solves

• grc: (Python 2, 61, FryAmTheEggman), (Perl 5, 47, chilemagic), (Python, 69, Sp3000), (Perl, 39, GentlePurpleRain), (Perl, 36, squeamish ossifrage), (Python 3, 110, Sp3000), (C, 53, FireFly)

5 solves

• hsl: (CoffeeScript, 25, Martin Büttner), (Golfscript, 20, Josiah Winslow), (Lua, 18, user3155415), (Python, 54, kgull), (Arithmetic, 31, Cris)
• PleaseStand: (PHP, 14, Tryth), (C++, 56, hosch250), (PHP, 21, kenorb), (QBasic, 37, DLosc), (JavaScript, 46, FireFly)

4 solves

• bwoebi: (PHP, 52, kenorb), (PHP, 30, Tryth), (PHP, 27, kenorb), (PHP, 44, kenorb)
• FireFly: (JavaScript, 94, Shawn Holzworth), (Python, 34, Sp3000), (Brainfuck, 39, Mig), (JavaScript, 69, Shawn Holzworth)

3 solves

• Optimizer: (JavaScript, 61, jsh), (JavaScript, 47, palerdot), (JavaScript, 42, Shawn Holzworth)
• es1024: (PHP, 46, Ismael Miguel), (Python shell, 15, xnor), (Python shell, 21, xnor)
• DLosc: (Python, 41, Sp3000), (Ruby, 37, Rodolvertice), (CJam, 14, User23013)

2 solves

• xnor: (Python 3, 37, matsjoyce), (Python 2, 29, Dennis)
• Daniel Wagner: (Haskell, size 34, Petr Pudlák), (Haskell, 42, proud haskeller)
• nneonneo: (Python, 41, Sp3000), (C, 43, FryAmTheEggman)
• Art: (C, 51, es1024), (C, 48, es1024)
• n̴̖̋h̷͉̃a̷̭̿h̸̡̅ẗ̵̨́d̷̰̀ĥ̷̳: (Java 6+, 101, Rodolvertice), (Java, 97, Olavi Mustanoja)

1 solve

• Ypnypn: (Python 2, 50, Geobits)
• matsjoyce: (Python 3, 12, xnor)
• user1354557: (Python, 56, Fox Wilson)
• Dennis: (CJam, 20, Martin Büttner)
• isaacg: (Pyth, 71, FryAmTheEggman)
• ConMan: (SAS, 17, user3490)
• Arcinde: (JavaScript, 285, Beta Decay)
• Shawn Hotazworth: (Javascript, 82, TrungDQ)
• nooodl: (Ruby, 49, Doorknob)
• Bhante Nandiya: (Python 3, 37, Sp3000)
• Geobits: (APL, 17, user23013)
• histocrat: (Ruby, 23, MegaTom)
• ProgramFOX: (Python, 13, Reticality)

Answer 1

C, 43 bytes, FryAmTheEggman

Extremely abusive C code; works in the provided tester. Assumes no command-line arguments are passed (which is the default).

main(ui,abdenprsx){printf(&"%se7en%"[ui]);}

Note that the final % doesn't get printed out (at least in the tester provided by the poster and with my local copy of GCC 4.8; Clang refused to compile this code).

Answer 2

Python, size 41, by Sp3000

xx=x=6;exec("x*=6*6;xx*=x;"*xx);print(xx)

I racked my brains for half an hour trying to get to 6**49 by some combination of x*=6, x**=6, and x*=x, but there were never enough *s. Then I remembered something about squares being the sum of consecutive odd numbers... From there it was easy. ;^)

Answer 3

CJam, size 34, by Dennis

"!,wcoo tkea"Jb" n heyre srwe"Bbma

Other solutions:

"newk,r !ywsre"Bb" e cto aeho"Jbma
"erwy !tro"Jb" knsecew,ho"Bbma  ea
"rese ohro  cn"Bb"!ew,a yektw"Jbma
"sr  k!oore,"Bb"nyeewtwch"Jbma  ea
"nwetkhs yr "Bb"o!eerc w,"Jbma eao
"!,wcoo tkea"Jb" n heyre srwe"Bbma

This is mainly based on Martin Büttner's idea. First assume the solution is either "..."Jb"..."Bbma or "..."Bb"..."Jbma. Then find some small fractions p/q whose tangent value is rounded to that number. Try every k and search for a pair of string which can be decoded into kp and kq. The search program is proven fast in cracking of the previous answer.

At first we have overestimated the probability and started with only two pairs of p and q. Nothing is found. But finally I changed the program to enumerate all possible ps and qs, and it worked.

There should be other ways to generate the two numbers other than kp, kq. But I don't know where to start the search in that case.

Answer 4

C++, size 192, Arcinde

#include<stdio.h>
#define d double
d i7(int y){return y- -1;}d g(d x,int i){return x?x/i- -g(x*i/4/i7(i),i7(i7(i))):x>x;}int (main)(d***dfffgy){printf("%.15f%",7?g(3,1):0,0.,-0.,0,1,2,2,2,4);}

I used the series for pi from here for which "history books credit Sir Isaac Newton." After making a short program based on that, the main difficulty I had with using the provided characters was that while I used three additions, I had no + available, and was one - short of using all double-minuses. I resolved this by creating a function i7 which subtracts -1 from a number. An unfortunate thing that happened is that I used all the / for division, meaning I had a large volume of unused characters to stick in various spots instead of simply commenting them out.

Answer 5

JavaScript, size 82, by Ismael Miguel

var v='',i=0;for(;i<(21<<2)-~1;)v+=i^++i;console.log(v+i)//,.13<<=[[[[]]]]iiijnozz

Previous version:

var v='',i=0;for(;i<(21<<2)-~1;)v+=i^++i;console.log(v+i);//,.13<<=[[[[]]]]iiijnzz

Answer 6

Marbelous, size 36, es1024

9C
Dr=0
^3
+O
+O!!

:Dr
}0
++
/\{>{0

There is no trailing line break, so that we remain at 9.

After another very fruitful discussion session with Sp3000, at last, one of the Marbelous submissions is cracked! :)

I can't really explain Marbelous in the scope of this answer, so if you have no idea what I'm talking about, have a look at this reference.

Let's look at the output first: it's 100 ones and zeros, 8 of them at a time (with some offset in the cycle). This suggests that we have some loop that increments a marble 100 times, and printed 0 or 1 depending on the 4th byte. Both of those are pretty convenient because, starting at 9C (in hex) is 156. Incrementing 100 times overflows, so we can abort the loop with a =0. Furthermore, we have access to the fourth bit with ^3. And if we increment before outputting, then we will also correctly start with 3 ones.

Setting this up was a bit trickier though. Especially, since we got really stuck on the idea of naming the board Or, so that we would have the Ds as hex digits (and we also thought there were two ++ devices). But we just couldn't find a way to add 48 to the 0 or 1 resulting from ^3 (which is necessary to turn them into 0 or 1 characters). But at some point I had an epiphany, and realised that O is 24 in base 36, so we could actually increment by 48 using +O twice.

The rest was fairly simple to deduct from the available characters and the requirement to have no empty cells in the boards. In particular, there is no way to move a marble upwards in this, so the only way to create a loop is horizontally. The clue here was the cylindrical board, which allows you to just constantly push things to the right, until =0 lets the marble fall. This also meant that the ++ device had to go inside the subboard, because you can't prevent it from letting the marble fall.

So in summary:

• 9C is a literal marble which starts its life at value 156.
• There is a subboard Dr which takes in a marble, increments it, and spits out the result both downwards and to the right.
• =0 lets the result fall if we hit 0, otherwise pushes it to the right, and back into Dr.
• ^3 takes the marble that falls out of Dr and returns 0 or 1 depending on the 4th bit.
• +O increments by 24 (twice).
• When the result falls off the bottom of the main board, the corresponding ASCII character is printed.
• !! terminates execution. This isn't necessary to break the loop (that wouldn't continue anyway), but it swallows the null byte, that would be printed if the 00 marble were allowed to fall off the board. It's important to put the !! in the last row, otherwise the final 0 character wouldn't have time to get printed.

Answer 7

Python 2, size 132, by Vi.

EDIT: Solved the original given that it didn't use exec at all. For some reason, even though I came up with using compile() to trigger the except in the from __future__ import instead of exec(), I didn't think to use compile+eval for the rest.

eval(compile('try: compile("from __future__ import braces","1","single")\nexcept SyntaxError as q:\n\tprint q[0][6:]',"2","single"))

I'm pretty sure the answer to the hint given "Don't count ones which exist. Count ones which do not exist" is "braces".

How it works: The easter egg import from __future__ import braces triggers a SyntaxError: not a chance. The idea was to catch this exception and extract the last word from it; but you can't use try:from __future__ import braces because from __future__ imports must occur at the top of the file (this is because they aren't really imports, they're directives to the interpreter at compile-time to enable features). This is why you can trigger the exception by compiling the import without executing it. Additionally, to compile the try/except in single-statement mode, you need the \n\t after the except. I'm not sure why this is necessary; it works without the \n\t if you use exec-mode. Additionally, the "1" and "2" aren't strictly necessary; those could be left empty.

EDIT: Cracked shorter variant.

exec('try:exec("from __future__ import braces")\nexcept SyntaxError as q:print q[0][6:]\t\n12')

I'm not sure what to do with the 12\\nt characters. They didn't seem to fit, but putting them at the end like that works fine.

This works on basically the same idea as the original, but leverages exec instead. The second exec isn't strictly necessary, though, since all you have to do is compile the import statement.

Personally, I think it would have been a little more interesting to use StandardError instead of SyntaxError, or perhaps an import sys; and sys.last_value[0][6:], but with the dot in there I imagine a whole lot of other solutions would crop up.

Answer 8

JavaScript, size 69, by Shawn Holzworth

f=f=(f=0x76f2156a6c[r='toString'](30))+f+f+' '+((0x25a1335*7)[r](30))

That took a while. This should be similar to the original, though the constants are probably different.

Answer 9

Python 2, 29 bytes, by Dennis

emnsssssyyy= str().strip;ord;

Please, good bot, do not convert me to a comment!

Answer 10

JavaScript, size 26, by hsl

alert(998|(103>8>0&41>-0))

And some random text to prevent it converted into a comment.

Answer 11

C++, 56, by hosch250

int main(){for(int c=33;c<251-124;+4)c+=printf("%c",c);}

Note that in order to get this to compile with GCC as a C++ program, I had to tell GCC to include stdio.h:

$ g++ -include stdio.h -o 40974 40974.cpp
$ ./40974
!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~

The program does compile without -include in GCC's C99 mode though:

$ gcc -std=c99 -o 40974 40974.c
40974.c: In function ‘main’:
40974.c:1:1: warning: implicit declaration of function ‘printf’ [-Wimplicit-function-declaration]
 int main(){for(int c=33;c<251-124;+4)c+=printf("%c",c);}
 ^
40974.c:1:41: warning: incompatible implicit declaration of built-in function ‘printf’ [enabled by default]
 int main(){for(int c=33;c<251-124;+4)c+=printf("%c",c);}
                                         ^

Answer 12

Python, size 56 by Fox Wilson

print("".join([chr((i+70)^32)for i in (2,3,-70,7,9,7)]))

Answer 13

Python 3, size 37 by matsjoyce

print(*[_*_ for _ in range(2*2*2+2)])

Let's add some more text so that this one doesn't get auto-converted to a comment.

Answer 14

Pyth, size 35, by FryAmTheEggman

llo    oCGd"ProgrammingPuzzesandef"

Simply lg(len("Length 22 string")), extra characters disposed of at the front.

Answer 15

JavaScript, 94, by Shawn Holzworth

v=['0',01,7,8,5,7,8,4,44,11,8,41,1,1+1];a=alert;r='';for(x in v)r+=(a+(1==0))[v[x]]||'h';a(r);

Works only in SpiderMonkey, it seems (i.e. Firefox). This took me forever, and if it was slightly more clever with the indices I think I'd've given up.

Answer 16

Python, size 34, by Sp3000

print(str([{.6,}])[-4])
_=...;__=_

The trickiest part was trying to get rid of the leftover characters. :P

Answer 17

C, size 48, by es1024

main(f){f='ma'-lgamma(0xfe.dp9),printf("%d",f);}

I'm very unsure about this one. It depends on implementation defined behavior (character constants with more than one character, see C99 6.4.4.4 point 10), but happens to produce the right result on Linux with gcc and MacOS with clang. Depending on ASCII I wouldn't even mention, but this is so unusual that it feels very dodgy.

Answer 18

Ruby, size 35, by histocrat

(_=->h{:shadily.display})[_]||_===_

Interesting, I did not know you could invoke lambdas with ===... I mean... why?

Answer 19

CJam, size 19, by Ypnypn

923"4593*JJ#%"786*~

Test it here.

That was close... the seven days had already passed, by Ypnypn did not yet claim immunity by releasing the original source.

Explanation

923                 "Push 923 on the stack.";
   "         "786*~ "Repeat that string 786 times and eval it. Just a loop, basically.";
    4593*           "Multiply by 4593.";
         JJ#        "J is a variable initialised to 19, so compute 19**19.";
            %       "Modulo.";

Cracking

I was fairly certain that "_"_*~ was used to make a loop, and that % was used as modulo to keep the numbers small. (We've seen other ways to do that, but I don't think that would have worked here very well, because you couldn't put the result of your computation in a string.).

So first guess I ventured was that the divisor of the modulo could be 19¹⁹. Looking up how much that is, it turned out to be on the same order as the desired result (about 4 times the result), which suggested that this is actually a very likely choice. That left only *, so I figured the code would be of the form

 _"_*JJ#%"_*

Where the _ are filled from the numbers. That's *10!/2/2 * binomial(9,2) = 32,659,200* possible permutations. That seemed to be doable by brute force. :)

The only thing that would blow this up is having a large number before the *... with up to 8 digits, it could basically square the number of iterations needed. So I thought, let's limit that to at most 3 digits (which was apprently quite lucky, seeing that solution actually had three digits there). Then I just reimplemented this framework in Mathematica and wrapped it in a loop over all such permutations:

perms = Permutations@{2, 3, 3, 4, 5, 6, 7, 8, 9, 9};
big = 19^19;
Map[
  (
    If[#[[2]] != perm[[2]], Print@#];
    perm = #;
    For[i = 2, i <= 9, ++i,
     a = FromDigits[perm[[1 ;; i - 1]]];
     For[j = Max[i + 1, 8], j <= 10, ++j,
      b = FromDigits[perm[[i ;; j - 1]]];
      c = FromDigits[perm[[j ;; 10]]];
      x = a;
      For[k = 0, k < c, ++k,
       x = Mod[x*b, big];
       ];
      If[x == 500827930823087774653348, Print@{a, b, c}]
      ]
     ]
    ) &,
  perms
];

After about two hours (shortly before completing the full search) this produced

{923,4593,786}

which I was able to verify in CJam. :)

Answer 20

Python 2, size 69, by muddyfish

import tabnanny as t;print(t.__name__[:3])or((({3:_efisssw[[]][:]})))

tabnanny is a standard Python module, but I am just borrowing its name here to get the "tab" string.

Answer 21

Interactive Python 2.6, 15, MrWonderful

43**(314)/(1+2)

I did some (imprecise) brute force for i and j where math.log(N * j, i) is very close to an integer.

Answer 22

Golfscript, size 20, by Josiah Winslow

print "hello world!"

Tested at http://golfscript.apphb.com/.

Answer 23

PHP, 14, by Tryth

aa:a?:a?:a::a;

Tested working in PHP 5.5:

$ php -nr 'aa:a?:a?:a::a;' | wc -c
0

Answer 24

Java 6+, 101 bytes, by Rodolvertice

class ou{public static void main(String[]h){for(int t='l'|'s';t>0;t/=2)System.err.append(t+"4"+t);;}}

Outputs to stderr.

Demo on ideon

I figure out the pattern of the output quite easily:

127 4 127
63 4 63
31 4 31
15 4 15
7 4 7
3 4 3
1 4 1

This suggests the tokens /=2, for(;;), t+"4"+t, >0. for is taken from short free;.

The number 127, the 4 ' and | also suggests the use of | with 2 char.

The tricky part is to pick out t from the rest of the code (out -> err, println -> append, class t, the remaining part of short free;).

Answer 25

Befunge-93, size 17, by user23013

I'm not sure what all that extra stuff on line 2 is doing there...

"@",69+#
>_-/*%pv

Try it out here

Answer 26

JavaScript, size 61, by jsh

x=function() {return 1;};alert((typeof (typeof x)).slice(-4))

Answer 27

BBC BASIC, 187, by Beta Decay

This just prints out a long sequence of ASCII codes:

PRINTCHR$(121)CHR$(111)CHR$(117)CHR$(39)CHR$(108)CHR$(108)CHR$(32)CHR$(110)CHR$(101)CHR$(118)CHR$(101)CHR$(114)CHR$(32)CHR$(99)CHR$(114)CHR$(97)CHR$(99)CHR$(107)CHR$(32)CHR$(109)CHR$(101)

Answer 28

PHP, Size 30, by Tryth

__halt_compiler();t101hant.net

Just stopping the parser and ignore everything else to have no output.

Answer 29

Pyth, size 71, by FryAmTheEggman

*tC"y"l"Han Solo: Never Tell Me The Odd
-3P0: Sir, the possibii,... s!"

There have to be a ridiculous number of possiblities here, but this seemed to be the easiest - get 120 from chr('y')-1, and 31 as the length of a string, and multiply. Newline is a super-comment.

Answer 30

CJam, size 32, by Dennis

"tb srcr wB!eyo awm ,kheeonae"Jb

Just guess the answer should be something like "..."Jb and then brute-forced it.