prev • index • info

code guessing, round #104, stage 2 (guessing)

started at ; stage 2 since . guess by

specification

hear that? it's the very first source-layout we've done! detect your own stride length. submissions can be written in any language, but may you? ...yes, you may.

this is also the very first challenge that does not ask for a full program, but only an expression. it's double the firsts for your buck; code guessing is entering the 21st century! really, we're asking for a set of expressions, since your original expression will be modified.

let me explain. we'll say you submit mycoolsubmission as your expression. it should evaluate to 1. here's the catch: if you remove every other character from it (mcosbiso), it should evaluate to 2, and if you only keep every 3rd character (mosmsn) it should evaluate to 3, and so on. you can continue the pattern as long as you like, anywhere from 1 to the length of your program. but if you go all the way, I'll think you're cool.

your challenge, given nothing, is to evaluate to a number as described above. as any language is allowed and expressions don't have APIs, there is no fixed one.

and DON'T ask me what counts as an expression.

players

  1. essaie
  2. haru~
  3. Luna
  4. Makefile_dot_in
  5. oleander
  6. seshoumara

entries

you can download all the entries

entry #1

comments 0

post a comment


rulebreaker.py ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
def entry(dave):
    return (lambda dirk:
        (lambda texas:
            (lambda doll, stride: doll(doll, stride)) (
                (lambda doll, stride: (lambda shrimp:
                    0 if len(shrimp) < len(dave) else
                    stride if shrimp == dave else
                    doll(doll, stride + 1)
                ) (texas[::stride])), 1
            )
        ) ("""def entry(dave):
    return (lambda dirk:
        (lambda texas:
            (lambda doll, stride: doll(doll, stride)) (
                (lambda doll, stride: (lambda shrimp:
                    0 if len(shrimp) < len(dave) else
                    stride if shrimp == dave else
                    doll(doll, stride + 1)
                ) (texas[::stride])), 1
            )
        ) (""" + dirk + """)
    ) (""" + chr(39) * 3 + dirk
           + chr(39) * 3 + ")")
    ) ('''"""def entry(dave):
    return (lambda dirk:
        (lambda texas:
            (lambda doll, stride: doll(doll, stride)) (
                (lambda doll, stride: (lambda shrimp:
                    0 if len(shrimp) < len(dave) else
                    stride if shrimp == dave else
                    doll(doll, stride + 1)
                ) (texas[::stride])), 1
            )
        ) (""" + dirk + """)
    ) (""" + chr(39) * 3 + dirk
           + chr(39) * 3 + ")"''')

entry #2

comments 0

post a comment


cg104.bf ASCII text
1
+

entry #3

comments 0

post a comment


cg-104.ua Unicode text, UTF-8 text
1
2
3
4
5
6
7
8
# Works up to 7; I didn't find any expression for more than 2 characters that worked up to the number of characters.
⌈⨪÷√π56τ
# ⌈÷π6
# ⌈√6
# ⌈π
# ⌈5
# ⌈6
# ⌈τ

entry #4

comments 0

post a comment


cg.R ASCII text, with no line terminators
1
5-     1      -       1                   -           1                 -           1

entry #5

comments 0

post a comment


I_am_almost_cool.dc ASCII text
1
A0Zv
output.sh ASCII text
1
2
3
4
5
#!/usr/bin/bash

dc --expression 'A0Zv' -ef
dc --expression 'AZ' -ef
dc --expression 'Av' -ef

entry #6

comments 2
[cg: author of #6] 
m: 2
a: {1 2 3 4 5 6 7 8 9 h}
p:
    h -> 1
    1 -> 1
    2 -> 1
    3 -> 2
    4 -> 3
    5 -> 4
    6 -> 5
    7 -> 6
    8 -> 7
    9 -> 8
death of the author

im hungry

post a comment


ceegee.md ASCII text, with no line terminators
1
9HHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHHH