# Print X without X (robber's thread)

This is the robber's thread of a challenge. You can view the cop's thread here

A pretty common beginner style question is to print some string, but, there's a catch!, you need to do it without using any of the characters in the string itself!

For this challenge we will find out who is the best at printing X without X. There are two threads to this, a cop's thread and a robber's thread.

In the cop's thread users will choose a language (which we will call Y) and a string (which we will call X) and write a program in language Y which takes no input and outputs X without using any of the characters in X. The cop will then post both X and Y without revealing the program they have written.

Robbers will be select cop answers and write programs in language Y which take no input and output X. They will post these "cracks" as answers in this thread. A crack need only work not be the intended solution.

Once a cop's answer is one week old, so long as it has not been cracked, the cop may reveal their program and mark it as "safe". Safe answers can no longer be cracked

Robbers will be scored by the total number of successful cracks with more cracks being better.

• Congrats on an excellent challenge with high 'replay value'. I've had a lot of fun participating on both sides, digging into a couple of languages for the first time along the way. Aug 20 '20 at 3:22

# Javastack, cracks Enamresu A's seventh (yes, seventh) answer

((alphabet length alphabet length divide) * 1234567890) (add * 1234567889)
alphabet (position of r in the alphabet) index add
alphabet (position of s in the alphabet) index add
alphabet (position of y in the alphabet) index add
alphabet (position of o in the alphabet) index add


Replace numbers in brackets ((n)) with (alphabet length alphabet length divide) * n (add * n - 1)

Do you see how I put seventh in italics? That's an ode to the fact that this isn't my first time reaching round 7 of a match.

# Javastack, cracks Enamresu A's fifth answer

((maybe length not) * 1234567890) (add * 1234567889) quote add alphabet maybe length not double index add alphabet (maybe length not * 17) (add * 16) index add alphabet (maybe length not * 18) (add * 17) index add


Traditionally, the next round is the one where I actually have to think for a while. Here's hoping I don't.

# Javastack, cracks Enamresu A's fourth answer

not times context (increment * 1234567890) context (increment * 34) char context (increment * ascii value of "q") pair context (increment * ascii value of "d") join context (increment * ascii value of "l") pair context (increment * ascii value of "w") join pair sum


Vyxal features ftw.

That's enough for today.

# Javastack, cracks Enamresu A's third answer

not increment * 1234567889 flatprint not increment * (ascii value of " - 1) char flatprint not increment * (ascii value of d - 1) flatprint not increment * (ascii value of w - 1) flatprint not increment * (ascii value of q - 1) flatprint


H...hey actually give me time to actually write a post please!

107 char 100 char 115 char 109 char 117 char 106 char 118 char 102 char 98 char wrap 1 repeat "," "" replace


Sussy baka

## x86-16 machine code (DOS) - 9 bytes

B0 3C    MOV     AL, 3CH
D1 E0    SHL     AX, 1
34 20    XOR     AL, 20H
CD 29    INT     29H
C3       RET

• What answer does this crack? Sep 8 at 15:56

# Vyxal O, 707126 bytes, cracks EmanresuA's seventh (yes, seventh) answer

Sample:

⟨\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o|\o⟩LkA≬\D<ṡ∷∷Ė


Full code

Sample:

×ǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏǏLkA√y$_y_y_y_Ė  Full code ... # Vyxal O, 801294 bytes, cracks EmanresuA's ninth answer Sample: ¶ḃʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLʀLkA‛ABo↓ǐĖ  Full code (ignore the file name it's a very unfunny joke) Yes. # Vyxal O, 2051108 bytes, cracks EmanresuA's tenth answer Sample: ?ꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rLꜝ?rL?↵↵LkAτĖ  You read that right. The answer really is 2 million bytes. Github doesn't like the file, so here's the generator: ,₴…‹›⟇+*/-d↵EǍ½ƒɖ1234567890ø∆e₈₇∞₆₄JpiẎȯhtḢṪḣṫ¡Þ₀₁C!¬⇧İN⇩Ż÷«»\;¥£¾¼⅛%→←"ẋ¤ȦFȧ⌐m⊍g≬\ṡ∷‡⁽⟨|⟩‟„$∇_yǏṘRq꘍₍₌Π⁺ʀ↑↓G↲↳⋏⋎Ṅ⁋ð×λ√²⌈⌊:ḊD \λ \‛ VC ƛ?ꜝ?rLn*+?↵↵LkAτĖ+;


Why the \λ \‛ V? Because ‛ doesn't play nice inside strings.

• Bruh you could get around -1000000 bytes by using uε instead of ꜝ?rL. get golf'd baka Sep 27 at 19:34
• @AaronMiller the whole point is that I answer these in the most inefficient and convoluted way possible Sep 27 at 23:25

# Vyxal, 1606416 bytes, cracks lyxal's answer

Sample:

εuεuεuεuuεuεuεuεuε\‛§εḭĖuuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuεuuεuεuεuεuε\‛§εḭĖĖuuε


Full code

Generator program

# Vyxal, 29261004498694420 bytes, cracks'd lYXAL;s anser

This solution has two main parts to it: Generating arbitrary numbers, and converting those numbers into characters.

## Arbitrary numbers:

uAuAuuArv∨v∧∑


Explanation:

     uA        # Push 1
u  r       # Cast to range [-1..n)
uAuA    v∨v∧   # Change all numbers in range to 1
∑  # Sum


Continue wrapping with uAuAu rv∨v∧∑ to increment.

Example: Try it Online!

## Numbers to characters:

k^k^kAPP‛A.‛..PokfPĖ


Explanation:

  k^                  # Push hex digits
kAP               # Strip ABCDEF to get 0123456789
k^     P              # Strip 0123456789 to get ABCDEF
‛A.‛..P       # Remove . from A.
o      # Strip A to get BCDEF
kfP   # Strip Fizz to get BCDE
Ė  # Execute BCDE

B     # Convert from binary
C    # Convert to char
D   # Triplicate
E  # Execute as Python (Does nothing)


Example: Try it Online!

### Extra

This program takes a character and returns the number of bytes required to print it: Try it Online!

00=n00=00=+n00=00=00=++n00=00=00=00=+++n00=00=00=00=00=++++n00=00=00=00=00=00=+++++n00=00=00=00=00=00=00=++++++n00=00=00=00=00=00=00=00=+++++++n00=00=00=00=00=00=00=00=00=++++++++n00=:+:+:+:+:+::++::,+:00=+:00=+:00=+:00=+:00=+00=:+:+:+:+:+00=:+:++00=:++00=00=00=00=00=++++00=00=+*:*00=:+:+:++:00=00=00=+++:00=00=00=++00=00=+*-00=:+:+:+:+:+00=+00=+00=+00=+00=+00=+00=+00=:+:+:+:+:+00=00=++00=:+:+:+:+:+::++00=00=+::**+00=00=00=00=00=00=00=+++++++00=00=pv
> <                                                                                                                                                                                                                                                                                                                                                                                                                                                                r<


Try it online!

Way easier than last time.

• Yep. Let's move on.
– null
Aug 13 '20 at 3:52

∆←⍎'⎕A',22⊃⎕A
⎕←(25↑66↓∆),(26↑17↓∆),(97⊃∆),⍕2+1


Try it online!

This was pretty easy. ⎕A is our escape hatch - it's the list of all 26 capital letters in the English alplhabet. We want ⎕AV, a string containing all the letters Unicode APL uses. 22⊃⎕A gets the 22nd element of ⎕A ("V"), and we append that to the string '⎕A' and execute it to get the value of ⎕AV. That is assigned to a variable ∆.

# Vyxal, 102953210 bytes, makes lyxal very sad

Y'all'dn't've given me those deltas.

kl¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯s¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯¯℅


Try it Online!

So it turns out that using deltas on a string or a list of characters will just remove the last character if all the characters are different. Removing a bunch of stuff, sorting, then removing a bunch of stuff will allow us to get any uppercase letter we want from kl. That gives us C, so we just need to figure out how to increment.

My first thought was using urL, but the delta trick only lets us get uppercase letters. Then I realized that we could use s to get a range, then join stuff to it and get the length to get any number we want. Join and Length are both uppercase letters, so that's perfect.

s      # Sort; casts the number to a range
kl    # Push UPPERCASElowercase reversed alphabet
J   # Join
L  # Length


Doing this over and over will increment the number over and over, and we can push a 7 to start using k℅L, since we just need the starting number to be less than 10 (\n).

From here, it's just a straightforward increment to target, convert to char, and we've got our crack!

Here's an example printing !`: wow even this comparatively short program is too long to include here as a link