# Write the whole of the holed using the unholed

The ASCII characters from decimal code 33 to 126 are:

!"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_abcdefghijklmnopqrstuvwxyz{|}~ Notice that in most fonts, 25 of these characters have "holes" in them: (a genus greater than 0 you might say) #$%&04689@ABDOPQRabdegopq

The other 68 "unholed" characters are:

!"'()*+,-./12357:;<=>?CEFGHIJKLMNSTUVWXYZ[\]^_cfhijklmnrstuvwxyz{|}~

Your task is to write the shortest program possible using only the unholed characters that outputs each of the holed characters exactly once in any order.

Since Space, Tab and newlines (Line Feed and/or Carriage Return) are empty space they may appear in your program or its output. They still count towards the number of characters. Other ASCII characters may not be used (and certainly not non-ASCII characters).

Notes

• You do not have to use all of the unholed characters nor only one of each.
• The output may not contain unholed characters.
• The Whitespace language may be used.
• Output should go to stdout or can go to a file. There should be no input.

Bonus: Just for fun, try printing all the unholed characters using the holed characters. I'm skeptical that it can be done in an existing language.

• +1 for the title. We do love stuff like this. – Jacob Jul 29 '14 at 7:35
• Where is the Perl solution?! – Pierre Arlaud Jul 29 '14 at 9:48
• Well, no solution in Haskell or C; if it's a program you want, then you need to spell main. – Rhymoid Jul 29 '14 at 10:22
• Bonus can be done using whitespace. – Joshua Jul 29 '14 at 19:50
• How did no one ever notice that I forgot ~?? – Calvin's Hobbies Mar 13 '15 at 4:50

# Pyth, 43 35 characters

tTFk"*+,-7;=?GHIKVWXYhiklnvwx"C-Ck7

Try it here.

Prints the characters in order except that 9 is at the beginning, newline separated.

String contains all characters 7 greater than the ones needed, except that 9 would become @, so it is special cased. Algorithm thanks to @Howard.

Explanation:

tT                print(10-1)                T=10, t(x)=x-1 if x is an int.
Fk"<string>"      for k in "<string>":
C-Ck7             print(chr(ord(k)-7))       Note that C is overloaded as ord and chr.

### GolfScript, 37 36 characters

[":=<?)-/! YX[]VIHKx{}|~vih"{25^}/]+

Try the code here.

The string contains the forbidden characters xor'ed with 25. Fortunately all characters are mapped to valid ones.

# Brainfuck 119

--[------->++<]>-.+.+.+.++++++++++.++++.++.++.+.+++++++.+.+.++.+++++++++++.+.+.+.[------>+<]>--.+.++.+.++.++++++++.+.+.
• uh, the -- at the start... Are you cycling back to 254 on the initial register there? – WallyWest Jul 29 '14 at 6:43
• Yup :) Makes the loop to 36 shorter (in order to get to 35) – Teun Pronk Jul 29 '14 at 6:45
• Well, it certainly beats my 275... well done... – WallyWest Jul 29 '14 at 7:03
• @Calvin's Hobbies I'm fairly certain no input is allowed, sorry. OP might want to clarify, though. – isaacg Jul 29 '14 at 7:07
• @isaacg I know, thats why my main code doesnt take input and the last example isn't a serious one :) – Teun Pronk Jul 29 '14 at 7:08

## Bonus - dc, 179 characters

Oh good, another restricted character set challenge where P is allowed.

Since dc is apparently obscure enough to require explaining (strange to me considering the weird stuff around here!) here's an overview:

It's primarily an RPN calculator with arbitrary-precision arithmetic. But for this challenge, I'm making use of the P command, which interprets a number as a series of characters in base 256 and prints them. Examples: 65 P prints A (ASCII code 65). 16706 P prints AB (16706=65*256+66).

Aside from that, the only other interesting feature is that it recognizes all of the hexadecimal digits 0-9A-F even when they are not contained in a hexadecimal number. Decimal input is the default, so the input token 999 means 9 hundreds + 9 tens + 9 and ABC means 10 hundreds + 11 tens + 12 making it equivalent to 1122.

The ability to use the digits ABD in decimal partially makes up for the inability to use 12357, and the choice of ordering and grouping does the rest. (If I need some numbers x,y,z and they aren't representable with allowed digits, then I try representing x*256*256+y*256+z instead.)

The program can probably be made slightly shorter by using larger groups. I didn't go past 3 bytes per number.

• @DigitalTrauma the other way around was the Bonus at the end of the problem statement. – user15244 Jul 29 '14 at 16:44
• Ha! I missed that! Excellent! +1 – Digital Trauma Jul 29 '14 at 16:46
• Can you explain this? And is there a place we can run this? – Calvin's Hobbies Jul 29 '14 at 17:08
• A place you can run it? dc isn't some silly language designed for making hard-to-read programs, it's a serious calculator. Run it on any unix machine (or cygwin). en.wikipedia.org/wiki/Dc_(computer_program) – user15244 Jul 29 '14 at 17:15
• @Calvin'sHobbies If you have access to just about any Linux or Unix machine (including OSX), simply save as a text file e.g. bonus.dc, then run dc bonus.dc. dc is one of the oldest languages out there and has been a permanent fixture in *nix for literally decades. Its not well-known though, probably due to its arcane and not-very-readable RPN syntax. Great for some code-golf challenges though ;-) – Digital Trauma Jul 29 '14 at 19:45

# Bash+coreutils, 56 bytes

tr \(-y \!-r<<<'*+,-7;=?GHIKVWXYhiklnvwx'
tr C-F 7-:<<<E

As luck would have it, adding 7 to the ascii value of the holed characters yields all unholed characters (with the exception of "9"). So we just do this transformation in reverse, then a similar transformation (subtract 12 from "E") to get the "9".

#$%&0468@ABDOPQRabdegopq 9 • I like how the first line subtracts 7 from a bunch of characters, and it contains a -7 conspicuously displayed between punctuation characters, and those 2 facts have nothing to do with each other. – user15244 Jul 29 '14 at 19:56 • @WumpusQ.Wumbley I hadn't even noticed that :) – Digital Trauma Jul 29 '14 at 20:03 ## Perl - 49 Bytes symlink".",':=<?)-/! YX[]VIHKx{}|~vih'^chr(25)x25 This is pretty much a Perl version of Howard's solution. XORing the string with 25. The output is a file with the name #$%&04689@ABDOPQRabdegopq. I got the idea to use symlink and the file name as the output format because everything else is banned.

Here's another Perl solution I came up with. It can probably be improved a lot and it is pretty long, so I'm leaving in a readable format for now.

until(y/1/1/>32){s//1/}
until(y/1/1/>125+1){
if(chr(y/1/1/)!~/[!"'()*+,-.\/12357:;<=>?CEFGHIJKLMNSTUVWXYZ[\\\]^_cfhijklmnrstuvwxyz{|}~]/) {
}
s/^/1/
}

This one outputs many files, the name of each one is one of the characters. I couldn't figure out how to append strings without using a forbidden character.

# Bonus - Insomnia, 268

ogeeoddp@poe@ggep@oe@opge@gee@%d@p@gqeo@p@ge@e9de49ed9e4dppe@%e@geee@ge@p%ee@%e@dp@%ep@%ee@%d@%eeee@%e@%ee@%e@geee@%e@gee@ggopop@peo@ggep@p@ge@ggeep@ge@gee@%e@geee@ge@gee@ge@ppoep@%ee@%edep@gepe@ge@%ee@%e@geee@ge@%ee@%%eeoe@ge@pep@%gep@p@%e@%%eep@%e@gee@e%e@oe@%gep@p@

It outputs:

!"'()*+,-./12357:;<=>?CEFGHIJKLMNSTUVWXYZ[\]^_cfhijklmnrstuvwxyz{|}~

I think it should be possible to reduce the length of the program if the output is rearranged, but I need to modify my search program to do this.

Just to show case another language which is capable of operate with a restricted number of characters. By the way, it can write just about any output with only 3 unique characters in the source.

Currently, this is the only language that can do both the main challenge and the bonus among all the existing answers.

# Befunge 98 - 46 bytes

Befunge-ified version of isaacg's Pyth entry:

"xwvnlkihYXWVKIHG?=;7-,+*">:5j2 ,-7_"?"1+:,s <

# Japt, 33 bytes

7+2+"*+,-7;=?GHIKVWXYhiklnvwx"c-7

Try it online!

Same algorithm as isaacg's Pyth submission, just happens to be shorter in Japt.

### How it works

7+2+"*+,-7;=?GHIKVWXYhiklnvwx"c-7

7+2           Obviously the number 9
"..."c-7  Apply -7 on each char's charcode of this string
+          String concatenation

Yes, it's JS, which is one of the most abusable languages, just shorter (and you don't need alert or console.log here).