Overcoming cluster size

Question

Fed up with the reliability of flash storage, you decided to store all your programs on one of those good old 1,440 KiB floppies. However, after copying not even 3,000 programs, the disk was full. How's that even possible? Skilled in the art of code golf as you are, most of your programs aren't even 100 bytes long, so there should be plenty of room left...

After asking about it on Super User, you discover that you have been wronged by the file system's cluster size, an evil plot of the designers of FAT12 that leaves a significant portion of your floppy unused and forces you to buy more than you actually need.

Buy more floppies? Never! Cluster size will be less of an issue if we simply save multiple programs in one file, which is possible because different compilers/interpreters will behave differently for the same source code.

Task

Write a polyglot that fits in a single cluster (512 bytes or less) and solves as many of the following tasks as possible.

string

1. Read all input and print it.

2. Print Hello, World!.

3. Read a line/argument (name) as input and print Happy Birthday, [name]!.

4. Read all input and print I love tabs! if it contains one or more tabulators (0x09) and I hate spaces! if it doesn't.

5. Read two lines/arguments and print a truthy value if the second is a substring of the first and a falsy value if not.

6. Read a line/argument and print a truthy value if its characters are in strictly ascending order and a falsy value if not.

7. Read a line/argument and a character and print the indexes of all occurrences of that character.

8. Read a line/argument and print any of the characters with the highest number of occurrences.

math

9. Read two integers between 0 and 255 and print their sum.

10. Read a single integer between 0 and 255 and print the quotient and residue of its division by 7.

11. Read a single integer between 1 and 255 and print a truthy value if it is a composite number (neither 1 nor prime) and a falsy value if not.

12. Read a single integer between 1 and 255 and print a truthy value if it is a power of 2 and a falsy value if not.

13. Read two integers between 0 and 255 and print the larger one.

14. Read a decimal integer between 0 and 255 print its hexadecimal representation.

15. Read a single integer between 0 and 255 and print its Hamming weight (number of 1-bits).

16. Read a single integer n between 1 and 13 and print the F_n, the n^th Fibonacci number.

    For example, for the input 13, print 233.

ascii-art

17. Read a line/argument of input and frame it.

    For example, for the input Programming Puzzles & Code Golf, print this:

    +---------------------------------+
    | Programming Puzzles & Code Golf |
    +---------------------------------+
    

18. Read a rectangular block of characters and rotate it a quarter turn clockwise.

    For example, for the input

    tye
    xll
    epb
    tma
     id
     sa
    s e
    i r
    hsn
    Tiu
    

    print this:

    This  text
    is  simply
    unreadable
    

19. Read an integer between 1 and 40 and print a diamond of that side length.

    For example, for the input 3, print this:

      /\
     /  \
    /    \
    \    /
     \  /
      \/
    

20. Print this:

    ....@@@@....@@@@....@@@@....@@@@
    ....@@@@....@@@@....@@@@....@@@@
    ....@@@@....@@@@....@@@@....@@@@
    @@@@....@@@@....@@@@....@@@@....
    @@@@....@@@@....@@@@....@@@@....
    @@@@....@@@@....@@@@....@@@@....
    ....@@@@....@@@@....@@@@....@@@@
    ....@@@@....@@@@....@@@@....@@@@
    ....@@@@....@@@@....@@@@....@@@@
    @@@@....@@@@....@@@@....@@@@....
    @@@@....@@@@....@@@@....@@@@....
    @@@@....@@@@....@@@@....@@@@....
    ....@@@@....@@@@....@@@@....@@@@
    ....@@@@....@@@@....@@@@....@@@@
    ....@@@@....@@@@....@@@@....@@@@
    @@@@....@@@@....@@@@....@@@@....
    @@@@....@@@@....@@@@....@@@@....
    @@@@....@@@@....@@@@....@@@@....
    ....@@@@....@@@@....@@@@....@@@@
    ....@@@@....@@@@....@@@@....@@@@
    ....@@@@....@@@@....@@@@....@@@@
    @@@@....@@@@....@@@@....@@@@....
    @@@@....@@@@....@@@@....@@@@....
    @@@@....@@@@....@@@@....@@@@....
    

Scoring

The answer that manages to incorporate the highest number of programs in a single file that fits in a single 512-byte cluster wins. Ties are broken by byte count (lower is better).

Additional rules

• For each task you claim for your score, the same file (byte per byte) must constitute a full program – in a language of your choice – that solves this particular task.

• Each task has to be solved in a different language.

  Languages count as different if they are not different versions of the same language. For example, there's only one JavaScript, one Python and one TI-BASIC, but C, C++, Octave and MATLAB are four different languages.

• The selected language for each task has to satisfy our usual definition of programming language.

  In addition, the language must have been published and implemented before September 9, 2015.

• Your compiler/interpreter may not require any non-standard flags to produce the expected behavior.

  Exceptions to this rule include flags required to specify a particular language, to read the program from a (single) file or to suppress a banner.

• The input for each task will consist of printable ASCII characters (0x20 to 0x7E) and linefeeds (0x0A), and it will not exceed 255 bytes in length.

• All integers can be read in decimal or unary, unless stated otherwise in the task.

• Behavior for invalid input is undefined.

• You may read input from STDIN (or its closest alternative) or as command-line arguments.

  If a task requires reading two pieces of input, you can read them – in any order – separated by a one-byte delimiter of your choice, as separate command-line arguments or one from STDIN and the other as command-line argument.

  If one of the input pieces is a line, the only possible delimiter is a linefeed.

• Print the output to STDOUT (or closest alternative). All output to STDERR will be ignored.

• For each task, standard code-golf rules apply.

  In particular, this includes the Loopholes that are forbidden by default, with the exception of hard-coding the output, which is explicitly allowed for this challenge.

Answer 1

12 languages, 418 bytes

"1\"# &&+.@\""" "" "
#=
''''
<<s
""'("']0=~2base{+}*}
 ?
 :_7/!\_7%!@
"
R"Happy Birthday, "[?S"!"*"
>0[0>i:0(?v:{)?v0n;\!/
$'main';n1< .95<
 \@-[I love tabs!]o#
  \ >qi---@
( @-[ ]e<''';print hex(
input())#-[I hate spaces!]o#"]];ri:X{_~X+S*'/@S*_'\4$N}%_sW%1>"))?(!?)
'''=#print(([1 1;1 0]^int(readline()))[1,2])
#=
Tr is here.
>Tr, Hello, World!
>X Tr
s
l=gets
a='+-'+?-*~/$/+'-+'
puts a+'
| %s |
'%l+a#=#.91<0#'''#";

This is a fun challenge. It's getting hard to fit more languages in, but with this many bytes left I could probably do about one more.

Makes gratuitous use of 2D languages. Note that the char on between the [ ] on the @-[ ]e< line is a tab. Also, this requires \n line endings for TRANSCRIPT to work.

Prelude (Task 1 / Cat)

( 
      )?(!?)

?(!?) is just a direct translation of ,[.,] in BF. Prelude () loops act like BF [] loops, so everything from the ( in the leftmost column to the ) before the core program is unexecuted.

Prelude's syntax rules mean that parentheses need to be matched (reading left-to-right column-wise), and there can only be one parenthesis per column. Other than that, it's a pretty easy language to fit in.

Make sure NUMERIC_OUTPUT is set to False if you're using the Python interpreter.

TRANSCRIPT (Task 2 / Hello world)

Tr is here.
>Tr, Hello, World!
>X Tr

TRANSCRIPT is a thematic esolang based on interactive fiction. Lines not recognised by TRANSCRIPT are ignored, making it easy to fit in.

Tr is here. declares a Tr string variable, and the second line sets the contents of the variable to Hello, World!. X Tr (X for examine) then outputs the string.

Although TRANSCRIPT is very easy to fit in, it's a pretty verbose language, so I made it take the easiest challenge.

Fission (Task 3 / Birthday message)

R"Happy Birthday, "[?S"!"*
                   \!/

which prints the first part, cats the input with a small 2D loop, then outputs the trailing exclamation mark. The R signifies that an atom starts here moving rightward, which is useful because this program can be moved around anywhere.

Rail (Task 4 / Tabs)

$'main'
 \@-[I love tabs!]o#
  \ >qi---@
  @-[ ]e<
         -[I hate spaces!]o#

Like Fission, Rail is a 2D language which has the advantage of being able to be moved around anywhere. Execution starts from the $ of the main function, heading southeast.

First we head down the \s, turn left at -, hitting [<tab>] which pushes a tab. e< then branches based on EOF – if EOF, we head down and print "I hate spaces!" before halting, else we head up. If we headed upwards, we read the next char and compare it with the tab, once again branching – if tab, head up and print "I love tabs!" before halting, else head down and continue the input loop.

This program is pretty expensive, but since TRANSCRIPT took Hello World it was hard to pick and appropriate task for Rail.

><> (Task 6 / Ascending input)

"1\"#      \""" "" "


>0[0>i:0(?v:{)?v0n;
       ;n1< .95<


        .91<

Prints 1 if strictly ascending, 0 otherwise.

><> is another 2D language, and execution starts from the top left. "..." is string mode, pushing the inner chars one at a time. After the first string we hit #, which reflects the IP leftward, pushing more strings and wrapping around (><> is toroidal) before hitting \, a mirror which reflects us upwards.

At the bottom of the program is .91<, which teleports us to (9, 1), where the core program is. After this 0[ removes all the junk from the strings, 0 pushes a zero to represent the last char read, and after this it's just reading chars one at a time, making sure we're still ascending.

It's probably better to move the core program down instead of teleporting, but I'll deal with that later if necessary.

Befunge (Task 9 / Addition)

"1\"# &&+.@

Tested with the interpreter found here. This is a pretty straightforward program, with the start pushing a useless string and # jumping over the space. After that it's just the core program &&+.@.

Labyrinth (Task 10 / Divmod by 7)

"1
 =
 '
 <
""'("']
 ?
 :_7/!\_7%!@

Conveniently, ' and " are NOPs in Labyrinth which act like a walkable path in the maze. I'll skip the messy navigation, but basically there's a lot of turning and wandering around going on before we hit the ?, which is the start of the core program.

The program is not quite flush left to account for Prelude (e.g. ? is read input in Prelude).

Python 2 (Task 14 / Hexadecimal)

"1\"# &&+.@\""" "" "
#=
''''
xxx
xxx''';print hex(
input())#xxx
'''
xxx
xxx'''#";

The xxxs represent irrelevant portions commented out by multiline strings or comments. In between is print hex(input()), the core progam. This outputs with a leading 0x, but I'm assuming that's okay (if not, then it's an easy fix anyway).

The first line is a string "1\"# &&+.@\"" followed by two " "s. These three strings are concatenated by the parser, and left unused (this first line works similarly for Ruby and Julia later).

GolfScript (Task 15 / Hamming weight)

"1\"# &&+.@\""" "" "
#=
''''
<<s
""'("']0=~2base{+}*}

The first line pushes three strings, and the second line is a comment. '''' pushes two more strings, then << does two comparisons (s is ignored). Finally, ""'("' pushes another two strings.

All of this is junk is then removed by wrapping it in an array and getting the first element (]0=), which is the input initially on the stack. We then evaluate the input with ~, turn into binary with 2base then sum the bits with {+}*. The next } is unmatched, and super-comments the rest of the program.

Julia (Task 16, Fibonacci)

"1\"# &&+.@\""" "" "
#=
xxx
xxx=#print(([1 1;1 0]^int(readline()))[1,2])
#=
xxx
xxx=#.91<0#xxx

#= starts a multiline comment and =# ends a multiline comment. The core program uses matrix exponentiation to calculate Fibonacci numbers (taken from Rosetta).

Ruby (Task 17 / ASCII frame)

"1\"# &&+.@\""" "" "
#=
''''
<<s
xxx
s
l=gets
a='+-'+?-*~/$/+'-+'
puts a+'
| %s |
'%l+a#xxx

This program assumes that the input does not end with a trailing newline.

We have a useless string, a comment, another useless string then a heredoc which comments out most of the program. After that is the core program, followed by a single line # comment.

CJam (Task 19 / Diamond)

"1\"# &&+.@\""" "" "
#=
''''
<<s
""'("xxx
"
R"xxx"[?S"!"*"
xxx
xxx"ri:X{_~X+S*'/@S*_'\4$N}%_sW%1>"xxx
xxx
xxx";

The two space strings at the end of the first line are to satisfy CJam, since #= are two binary operators. I won't go into too much detail with this one, but basically it's a mess, with the core program being the mere

ri:X{_~X+S*'/@S*_'\4$N}%_sW%1>

in between.

The key differentiator between GolfScript and CJam is that, in CJam, a single quote ' doesn't start and end strings, but instead pushes the next character to the stack. This means that in CJam

'("'

pushes a ( then starts a string with " (the first char of which is '), whereas the above is just a straight single string in GolfScript.

Try it online. 1> is used instead of ( to account for Prelude.

---

Here's 12 languages, 373 bytes. Some tasks have moved around, TRANSCRIPT has been removed (it made Rail too expensive) and Scheme (chicken) has been added. This is just my golfing ground for to-be updates since updating the main post takes forever.

"1\"09!#.&&+.@"" "" "#|"
#=
''''
<<s
11]0=~2base{+}*}
 ?
 :_7/!\_7%!@
"
R"Happy Birthday, "[?S"!"*"
>0[0>i:0(?v:{)?v0n;\!/
$'main';n1< .95<
(-[Hello, World!]o#''';print(input()in input());'''"]];ri:X{_~X+S*'/@S*_'\4$N}%_sW%1>"=#print(([1 1;1 0]^int(readline()))[1,2])#=)?(!?)
s
l=gets
a='+-'+?-*~/$/+'-+'
puts a+'
| %s |
'%l+a# =##'''#";e# |#(print(format"~x"(eval(read))))

I could save a few bytes for Julia since unterminated multiline comments raise an error to STDERR.

Answer 2

7 8 9 10 languages, 398 431 447 507 bytes

This is probably the most I can fit in the current solution.

#if      + 0+0/*^",v  +- '[.,][[" ,yadhtrib yppaH"l?!;offf4+ + +0.0 +aa<*/
a=0--0;b=input();print(sorted(set(b))==list(b));[[""""                 ^ <
print("Hello, World!")--[[vv? +<
#endif/*  >.!0 + +1ffr"!"~< */
#include<stdio.h>/*>:1 +?!^>i:1^*/
int main(){int a=1,b=1,c,i;scanf("%d",&i);if(1//**/1==2
){printf("%x",/*>&:7/.7%.@*/i);}else{for(;--i-1>0;a=b,b=c)c=a +b;printf("%d",b);}}/*]]--"""]];#@;_J + + \+*\-hhlz \+s[\|dzd\|)J "` + +,*.]]]*/SSSTNSSNSNSTNTTTTTSSSTNSNSTNTTTTTTSSTNTTSNSSNNSSSNTTTTNSTNNNN

The last line contains Whitespace code encoded so that SE doesn't eat it. To run the code, replace all S with spaces, T with tabs and N with newlines.

C89, task 16

Here's what the compiler sees:

int main(){int a=1,b=1,c,i;scanf("%d",&i);if(1/ 1==2
){printf("%x",i);}else{for(;--i-1>0;a=b,b=c)c=a+b;printf("%d",b);}}

Everything else is stripped as comments or inside the #if 0.

C++, task 14

I used a trick stolen from here to differentiate between C89 and C++.

int main(){int a=1,b=1,c,i;scanf("%d",&i);if(1
){printf("%x",i);}else{for(;--i-1>0;a=b,b=c)c=a+b;printf("%d",b);}}

Lua, task 2

Here's the basic structure.

#comment
a=0--comment
print("Hello, World!")--[[
... multiline comment ...
]]--comment

Brainfuck, task 1

I just had to ensure no infinite loops or stray .,s are found. Lua's multiline comments also double as BF comments. Everything apart from the first 2 characters is a large NOP loop.

++,+-[.,][[,+++.+<--[[<,--[[+<>.++<<.>>+>,,,,,>..--->,+,]]--]]+++-+[++,.]]]

Python, task 6

Again, I'm using language-specific features to NOP or comment out the other code.

#comment
a=0--0;b=input();print(sorted(b)==list(b));[["""
... multiline string ...
"""]];#comment

Pyth, task 17

Pyth is nice for this thing. It takes the first # as a while True: loop that exits silently on error. So, I just make most of the code a string (as to avoid ;s ending the loop early), then just end the loop, exit another created by the Python comment and do the task. Here's it with all non-empty strings replaced with " string ", it's still functionally equivalent:

#if      + 0+0/*^" string " ,yadhtrib yppaH" string """" string "Hello, World!" string "!"  string "%d"  string "%x" string "%d" string """]];#@;_J + + \+*\-hhlz \+s[\|dzd\|)J " string

><>, task 3

This one is very interesting. The execution bounces around in the code, using jumps where necessary to get around obstacles. The relevant parts:

#                  v            " ,yadhtrib yppaH"l?!;offf4+ + +0.0 +aa<*/
                   i                                                   ^ <
                   !      vv? +<
          >.!0 + +1ffr"!"~<
                   >:1 +?!^>i:1^

Starry, task 9

Here I had to start going into the "discard all characters except " languages. Anything else stripped out, it looks like:

      + +*,  + '., , + + +. +*                  ,  +*  . + + *.* +*  ,,,,**,*..*, +,* + + +* + ` + +,*.*

The code skips most of the punctuation with a jump to avoid a hard time, just using the start and end of the code. The code is functionally equivalent to

      + +*,  + + +,*.*

Befunge-98, task 10

Works similarly to the ><> one. Luckily, # is a mirror in ><> and a skip in Befunge, so we can implement different behavior. Also, 0/0 == 0.

#if      + 0+0/*^
                >&:7/.7%.@

Whitespace, task 13

This was the last thing I fit in. The first few lines are just pushing zeroes onto the stack, as they only contain spaces and newlines from the "normal" code. The code is encoded; replace all S with space, T with tabs and N with newlines.

SSSSSSSSSSSSSSSN
SSSSSSSSSSSSSSSSSSN
SSN
SSSSSN
SN
SSN
SSSSSSSSSSSTN
SSN
SN
STN
TTTTTSSSTN
SN
STN
TTTTTTSSTN
TTSN
SSN
N
SSSN
TTTTN
STN
N
N

Answer 3

17 different versions of Pip, 383 bytes (invalid)

While this question was sandboxed, I combed through all the revisions of my language Pip and came up with a polyglot using 17 of them. Sadly, versions of the same language are disallowed by the challenge rules now, but with Dennis's permission and a disclaimer I'm posting my work anyway.

The raw code

I!ga:0m@0:0v:uIN[(oTM0,0i)EN1N1Y1RCkw(hR`1.+0``&2o`)@>3@AB0`u`rZ4AB6({a}V7)BN8AZ9@m]Iv<2W##YqlPByc:((J['.'@]X4)X4RL3)Jnc.:n.RVcc:cRL4|0Iv=3{d:sXaRLaFj,ad@j@j:'\d:(RVdR'\'/).d|0dJ:n}m:'+.'-X#a+2.'+.n."| "Iv=5La{i+:oSio}j:ak:bPv=11?a>1&0INa%(2,a)[((J_M ZRVl)|0)Jnl?lJnlcJnd.n.RVdm.a.RVmih:$+TBa({j@aEQk}FI0,#a).saTB16a>b?abh=1ua//7.s.a%7a+bbINa"Happy Birthday, ".a.'!"Hello, World!"]@v

The strategy

In Pip, lowercase letters are variables. Uppercase letters are more complicated: they are broken into runs of at most two characters, which can be operators or variables. If an uppercase token isn't specifically defined as a variable or operator, it is assumed to be an undefined variable, which evaluates to nil.

So, to distinguish between two versions of Pip, I just have to find some variable or alphabetic operator that was added in the newer of the two. In the older one, it will be nil instead. The code v:uIN[...] puts together a big list containing one of these checks for each version I want to test, finds out how many nils are in that list (the u variable is explicitly initialized to nil), and stores the number in v (for "version").

After some other calculations, there's another big list that calculates the results for 17 of the tasks from the challenge and uses v to select one based on what version this is.

Versions and tasks

0.15.09.04

Diagnostic: (oTM0,0i) (fixed a bug with TriM operator where trimming 0 characters from each end of a string would give the empty string instead; indexing into empty string gives nil)

Task 18: Iv<2W##YqlPBy (setup: read all lines from stdin if v is less than 2) followed by ((J_M ZRVl)|0)Jn (reverse list of lines, transpose, and join back into string)

0.15.08.06

Diagnostic: EN1 (added ENumerate operator)

Task 1: Iv<2W##YqlPBy (same setup code as above) followed by l?lJnl (join on newlines)

0.15.08.03

Diagnostic: 1N1 (added N as short version of IN operator)

Task 20: c:((J['.'@]X4)X4RL3)Jnc.:n.RVcc:cRL4|0 (setup: generate list containing upper and lower halves of chessboard and store in c) followed by cJn (join on newline)

0.15.08.01

Diagnostic: Y1 (added Yank operator)

Task 19: Iv=3{d:sXaRLaFj,ad@j@j:'\d:(RVdR'\'/).d|0dJ:n} (setup: if v is 3, build top half of diamond in d) followed by d.n.RVd (reverse for bottom half and join on newline)

0.15.06.19

Diagnostic: RCk (added Random Choice operator)

Task 17: m:'+.'-X#a+2.'+.n."| " (setup: build +----+\n| string in m) followed by m.a.RVm (wrap input in m and reverse of m)

0.15.06.12

Diagnostic: k (preinitialized k variable to ", "; previously it was undefined and thus nil)

Task 16: Iv=5La{i+:oSio} (if v is 5, generate Fibonacci number in i) followed by i

0.15.06.08 ^{(note: version number wasn't changed till the following commit)}

Diagnostic: w (preinitialized w variable to `\s+`)

Task 15: h:$+TBa (convert input to binary and sum digits; save result in h for task 12 later)

0.15.05.29

Diagnostic: (hR`1.+0``&2o`)@>3@AB0

This version added & as a replacement pattern for the whole matched string in a regex replacement (inspired by sed). The code above takes h (100) and replaces it with `&2o` (i.e. "1002o" in newer versions but simply "&2o" in older versions). It then slices all characters after the 3rd ("2o" in newer versions, "" in older versions) and attempts to index into that string. Indexing into an empty string gives nil.

Task 7: j:ak:b (setup: copies local vars a,b to global vars j,k so they'll be available inside a function) followed by ({j@aEQk}FI0,#a).s (filter for indices in a where the corresponding character equals b, and join on space)

0.15.05.26

Diagnostic: `u` (added Pattern type; in previous versions, backticks are ignored as unrecognized characters, and the expression evaluates to u, which is nil)

Task 14: aTB16 (convert To Base 16)

0.15.05.24

Diagnostic: rZ4 (created r special variable which returns a random value between 0 and 1 each time it is referenced; previously it was undefined and thus the expression evaluated to nil)

Task 13: a>b?ab (ternary expression)

0.15.05.12

Diagnostic: rZ4 (added Zip operator)

Task 12: h=1 (sum of bits from task 15 must equal 1)

0.15.05.11

Diagnostic: AB6 (added ABsolute value operator)

Task 11: Pv=11?a>1&0INa%(2,a)[...]@v (if v is 11, output 1 if input is greater than 1 and a smaller number divides it exactly, 0 otherwise; if v is anything else, use v as an index to the list to decide what to output)

0.15.05.02

Diagnostic: ({a}V7) (added V operator; when V was undefined, this sent arguments nil and 7 to a function {a} that returns its first argument)

Task 10: a//7.s.a%7 (input int-divided by 7 and mod 7, space-separated)

0.15.04.26

Diagnostic: BN8 (added Bitwise Negation operator)

Task 9: a+b

0.15.04.23

Diagnostic: AZ (preinitialized AZ variable to uppercase alphabet)

Task 5: bINa (IN gives count of occurrences)

0.15.04.20

Diagnostic: m@0:0 followed by 9@m

The m variable is preinitialized to 1000. In this commit, the @ operator was fixed to return lvalues; previously, assigning to m@0 gave a warning and did nothing. Thus, post-bugfix, the first statement sets m to 0000, which is a legal index for 9; pre-bugfix, m stays 1000, which is not a legal index. (Indices were not yet cyclical.)

Task 3: "Happy Birthday, ".a.'!

0.15.04.18

All previous diagnostics result in a nil being added to the diagnostic list.

Task 2: "Hello, World!"

---

Most of the other code is tweaks I had to make to avoid errors in various versions. This post is already far too long, so if you want to know about anything I haven't explained, let's take the discussion to the esoteric languages chatroom.

Answer 4

6 languages, 450 404 bytes

bash, brainfuck, C, gawk4, JavaScript and Minimal-2D

/*\t/#[R,+/D
/\t/ # UL.-L<script>var s=prompt().split(' ');alert(+s.pop()+ +s.pop())</script>
sed "s/^\(.*\)$/Happy Birthday, &!/;q"&&0
/\t/#*/
#define func
func main(){puts("Hello, World!");}
//{split($0,b,_);for(i in b)a[NR][i]=b[i++]}END{for(;j++<i;print"")for(k=NR;k;)printf a[k--][j]}
#//]++++++++[>+>+>++++++>++++++++<<<<-]>>++>--<<[>>>>>+++[<++++[<<....>....>-]<<<.>>>>-]<<<[>>+<<-]<[[>+<-]<]>>-]

Update: Golfed it down a little. Still not sure what else to add, and I'm not sure how the competing members would think about me using their languages for different tasks. Trying to explain the brainfuck algorithm.

Well this is/was my first polyglot experience, so I had to learn everything from scratch. Starting with awk was not the smartest idea I think, because it is relatively unforgiving. Because the number of completed tasks is relevant I started with the easiest tasks first. Not sure if that was a smart move. This is not very much golfed, because I had enought trouble getting these six working together, but I did what I could to keep it short.

Here are the languages and what they do in alphabetical order. I'll show an easy way to test them all further down. Because some of this might be version specific I'll give you the version numbers of the tools I used.

bash, task 3

Well, its obvious that I used sed. I tried to put a sed script in this somehow, but I couldn't get it to work, so I went the bash route. The way I dit it, it is inside a C comment and awk evaluates it to False.

sed --version gives sed (GNU sed) 4.2.2

bash --version gives GNU bash, Version 4.3.30(1)-release (x86_64-pc-linux-gnu)

So the sed part comes down to

sed "s/^\(.*\)$/Happy Birthday, &!/;q"

It groups the input, pastes it into a new string and prints the result. Pretty common stuff.

brainfuck, task 20

Well this is always pretty easy to hide I guess. A line starting with #// is ignored by C and awk. Or at least they can live with rubbish behind that.

bf gives bf - a Brainfuck interpreter version 20041219

This is the condensed code. The first line is only the garbage from the other languages.

[,+.-<>.+.++.<>.,,,,[][][++]++<[--][]]
++++++++[>+>+>++++++>++++++++<<<<-]>>++>--<<
[>>>>>+++[<++++[<<....>....>-]<<<.>>>>-]<<<[>>+<<-]<[[>+<-]<]>>-]

I'll try to explain how it works

++++++++[>+>+>++++++>++++++++<<<<-]>>++>--<<

this arranges the tape and pointer to this

0 8 10 46 64 C2 C1
  ^

the cell holding 8 is the global counter for the following loop
it's the number of times 3 same lines are printed

[>>>>>+++

sets C1 to 3, the number of same lines

    [<++++

sets C2 to 4, the number of "....@@@@" in a line (in the beginning)

        [<<....>....>-]<<<.>>>
    >-]

prints a complete line decrementing C2 in the process
when C2 is zero it prints a newline and decrements C1.

if C1 is zero the magic happens

    <<<[>>+<<-]
    <[[>+<-]<]

the 46 is moved behind the 64
the 10 and the global counter are moved one to the right

>>-]

then the global counter is decremented
if it's zero the program exits

C, task 2

I exhaust every last little ability of C here by printing "Hello, World!". Well, somebody had to do the job...

gcc --version gives gcc (Ubuntu 4.9.2-10ubuntu13) 4.9.2

The actual C code

#define func
func main(){puts("Hello, World!");}
#

The #define func is to make awk okay with this. It thinks this is an awk function. Abbreviation to func is a gawk feature.

gawk4, task 18

Since I have used awk for pretty much everything on here, I decided, that it had to be in this.

awk --version gives GNU Awk 4.1.1, API: 1.1 (GNU MPFR 3.1.2-p11, GNU MP 6.0.0)

awk sees this

/*\t/
/\t/
sed "s/^\(.*\)$/Happy Birthday, &!/;q"&&0
/\t/
func main(){puts("Hello, World!");}
//{split($0,b,_);for(i in b)a[NR][i]=b[i++]}END{for(;j++<i;print"")for(k=NR;k;)printf a[k--][j]}
#

The search patterns including \t evaluate to false. I chose tab here, because I think it can't be in the input. sed evaluates to false. "the string"&&0 evaluates to false. The function is okay. The program is executed if an empty pattern is matched, which it is for any input.

It does this

Input

elaic
parli
ucfit
srigs

Output

supe
rcal
ifra
gili
stic

You have to make sure all the input lines have the same length. Use spaces to fill them up.

JavaScript, task 9

I'm not sure if this is legit, because this was too easy. If you give the program file a html ending, and open it in a browser (I used Firefox 40.0.3 and chrome 45.0.2454.85) it prompts you for an input. You have to enter two numbers separated by space, and it will alert the sum of those.

<script>var s=prompt().split(' ');alert(+s.pop()+ +s.pop())</script>

Minimal-2D, task 1

This was pretty easy to fit into comment lines. I used the interpreter, who runs in python, to test this. It prints the input to the output. The program looks like this

R,+/D
UL.-L

R U D L are right, up, down and left. So it starts going right, reads a character from stdin into memory and adds one. The slash skips the next command if the memory has the value 0. This is to end this. If a character with value -1 is read, the input has ended. So if -1 is read it skips the D and terminates. If something else is read it goes down an left, adds that 1 back to the memory and prints the character to stdout. Then it goes left and up and starts over.

Testing

Disclaimer: I won't take any responsibility for any damages you do to your system with this.

This is assuming you have bash & co, gawk (at least version 4, because this uses multidimensional arrays), gcc, python, bf as a brainfuck interpreter and Firefox installed.

To make it easy, copy the program source to a file named cluster.html. Make that file executable for the bash task. Copy and paste the interpreter for Minimal-2d into a file named minimal2D.py in the same directory. Then copy and paste the following script to a script file and put it into the same directory, make it executable and run it... well, who am I talking to. If you read this you probably don't need that much explanation and are gonna get it to run somehow anyway.

#!/bin/bash
# Task  3: bash
echo "Dr. Hfuhruhurr" | ./cluster.html 2>/dev/null;echo
# Task 18: awk 
printf "elaic\nparli\nucfit\nsrigs\n" | awk -f cluster.html 2>/dev/null;echo
# Task  2: C
cp ./cluster.html ./cluster.c;gcc -w -o cluster cluster.c;./cluster;rm cluster cluster.c;echo
# Task  1: Minimal-2D
python minimal2D.py cluster.html <<<"This
has
to be
copied     !!!";echo
# Task 20: brainfuck
bf cluster.html;echo
# Task  9: JavaScript
firefox cluster.html 2>/dev/null
#google-chrome cluster.html 2>/dev/null

In there you also find the command for running the tests individually.

Have fun!

Answer 5

6 languages, 226 bytes (229 depending on how \x1b is accepted!)

/&&#[+.#]@>>+[>,]<[<]>>[.>]>\[/;//;#<?die("\x1bc".max($argv[1],$argv[2]));/*
$a=['Hello','World'];//;printf"%s, %s!
",$a[0]||'Happy Birthday',$a[1]||pop;#";$a="\
#";alert(prompt().match("\t")?"I hate tabs!":"I love spaces!");/\]/

So, I don't think I made the best choice of languages and I imagine this isn't particularly competetive but I found this an interesting challenge nonetheless! Overall, not many challenges complete, but I could probably shoehorn a challenge in whitespace or something similar, but this is what I have so far:

---

1. Brainfuck

[+.]>>+[>,]<[<]>>[.>]>[<.[],[][,],,[],[].]

Tested on http://copy.sh/brainfuck/ and http://brainfuck.tk/.

After stripping out all ignored chars, the above program is all we're left with, which is just the example cat program with some extra empty loops to bypass the other languages use of the symbols.

2. Ruby

/&&#[+.#]@>>+[>,]<[<]>>[.>]>\[/;//;
$a=['Hello','World'];//;printf"%s, %s!
",$a[0]||'Happy Birthday',$a[1]||pop;

Usage:

ruby cluster

The above is the code after all comments are removed. The first line is entirely useless in Ruby as we define some regular expressions to contain the Befunge-93 and brainfuck code, then we create an array to contain Hello and World and print it using printf (to add the , and !).

3. Perl

/&&#[+.#]@>>+[>,]<[<]>>[.>]>\[/;//;
$a=['Hello','World'];//;printf"%s, %s!
",$a[0]||'Happy Birthday',$a[1]||pop;

Usage:

perl cluster <name>

Very similar to Ruby, except that since we're storing an array reference in $a, when we try to access $a[0] it's empty, so we can replace it with the text for challenge 3, Happy Birthday and pop (which shows the last argument to the command-line program).

4. JavaScript

/&&#[+.#]@>>+[>,]<[<]>>[.>]>\[/;
$a=['Hello','World'];
",$a[0]||'Happy Birthday',$a[1]||pop;#";$a="\
#";alert(prompt().match("\t")?"I hate tabs!":"I love spaces!");/\]/

Usage: paste into browser console and run.

Same as Ruby and Perl, the first line essentially creates useless RegExp objects, we then store a useless array in $a and instantiate two useless strings, one containing the Ruby/Perl code and one containing a newline and a #, then we prompt() for input and alert() the result expected by most humans for challenge 4. We end with another useless RegExp object to close off the brainfuck loop.

9. Befunge-93

/&&#[+.#]@

Tested on http://www.quirkster.com/iano/js/befunge.html.

As I understand it, / divides the stack and pushes the result which has no ill-effects except pushing NaN on the above site, & asks for input of an integer so we read both numbers required by challenge 9 onto the stack, the # ensures we skip over the [ which is there for brainfuck, + then adds the top two numbers on the stack, . outputs them, #] for brainfuck again and @ exits.

13. PHP (running in Bash)

/&&#[+.#]@>>+[>,]<[<]>>[.>]>\[/;//;#<?die("\x1bc".max($argv[1],$argv[2]));

Usage:

php cluster <x> <y>

In PHP, anything not included within the <? tags is output verbatim, so this outputs the Befunge-93 and brainfuck code so we die() immediately in the code, output a screen clear (\x1bc) then the max() of the first two arguments.