Snakes all around

Question

Challenge

The challenge is simple: print a snake.
You will get the length of the snake as input.
A snake of length 2 looks like this:

==(:)-

A snake of length 7 looks like this:

=======(:)-

In other words, the length of a snake is how many equal signs are before the head.

Usage

Let's say I made a C++ implementation and compiled it to ./getsnake.
I could run it like so:

$ ./getsnake 10
==========(:)-

Clarifications

• Standard loopholes are disallowed.
• You can get input and output in any acceptable way.
• You can assume all inputs given are positive integers.
• You may write a function instead of a regular program.

Answer 1

Hexagony, 33 bytes

Not gonna win, but still cool. Might be able to get golfed more.

Try it online!

Golfed:

61}?.$)@$j;(3<./;.}l/.400;5\j;.'\

Formatted:

    6 1 } ?
   . $ ) @ $
  j ; ( 3 < .
 / ; . } l / .
  4 0 0 ; 5 \
   j ; . ' \
    . . . .

Colored (Made using Timwi's Hexagony Colorer)

Explanation:

Loop, print out "=" until the counter reaches 0.

    6 1 } ?
   . $ . . $
  . . ( . . .
 / . . } . . .
  . . . ; . .
   . . . ' .
    . . . .

Print "("

    . . . .
   . . . . .
  . . . . . .
 / ; . . . . .
  4 . . . . .
   j . . . .
    . . . .

Print ":"

    . . . .
   . . . . .
  . ; ( 3 < .
 . . . } l / .
  . . . . . .
   . . . . .
    . . . .

Print ")"

    . . . .
   . . . . .
  j . . . . .
 . . . . . . .
  . . . ; 5 \
   . . . . \
    . . . .

The above values were generated using a simple python script. However, I kind of ran out of room for the "-". So, I had to resort to more advanced tricks.

When the program prints out ")", the value of the cell isn't 41, it's 1065. Hexagony just mods the value when printing. As it turns out, (1065*1000+4)%256=44, just one away from 45, the ascii value for "-". Then, I just increment, print, and insert a @ somewhere after printing.

    . . . .
   . $ ) @ $
  j . . 3 . .
 / . . } . . .
  4 0 0 . 5 \
   . ; . . \
    . . . .

Answer 2

Cinnamon Gum, 7 bytes

0000000: 7043 dc95 6d4f ce                        pC..mO.

Try it online.

Would have been 6 bytes with the old p syntax :/

Explanation

Decompresses to p~=~(:)-, the p stage then simply reads input and repeats the = n times.

Answer 3

Brian & Chuck, 31 bytes

,{-?>}-):(=?
#}<<.{?_<.<.<.<.<.

Input in the form of a byte value, so e.g. input ! gives a snake of length 33.

Try it online!

It's been a while...

Explanation

A quick Brian & Chuck primer:

• The first line of the program is Brian, the second is Chuck.
• Brian and Chuck are two Brainfuck-like instances. The main catch is that Chuck's program is Brian's tape and vice versa. The tape heads/instruction pointers start on the first cell of each tape and execution starts on Brian.
• As for the commands, there are a few differences. Only Brian can use , (input) and only Chuck can use . (output). In addition to < and > there are { and } which move the tape head up to the next zero cell (or in the case of { to the left end of the tape if there is no zero cell on the way). Instead of [...], the only control flow is ? which switches control to the other instance if the current cell is non-zero. The first executed instruction on the other cell is the one after the condition. And finally, _ is just an alias for null-bytes, for convenience.

Now the code. Brian starts with this:

,{-?

This reads the input into Chuck's first cell, then moves the tape head to the left with { (does nothing right now) and decrements the input with - before switching control for Chuck if the value is still non-zero. This begins the main loop. Chuck then runs this bit:

}<<.{?

This moves the tape head on Brian to the very end, moves two cells left onto the = and prints it before the tape head all the way to the left and switching control back to Brian. This is how loops generally work in B&C.

Once the input has been reduced to zero, the ? on Brian's tape will do nothing. Then Brian executes this part:

>}-):(=?

The ):(= are no-ops, so the actual code is just >}-?. We move off the zero cell with >, move up to _ with }, decrement it to make it non-zero and switch to Chuck with ?. Then the last bit on Chuck is run:

<.<.<.<.<.

This simply prints the five characters in front of Chuck, i.e. =(:)-. Note that we need to print another = since the main loop is only executed N-1 times for input N.

Answer 4

V, 8 bytes

Àé=A(:)-

Try it online!

V uses the "Latin1" encoding.

Explanation:

À        "Arg1 times:
 é=      "Insert an '='
   A(:)- "Append the head

Answer 5

Retina, 10 bytes

.+
$*=(:)-

Try it online!

This is a simple regex substitution.

It matches .+ which matches the whole input, and then substitutes it with $*=(;)-.

The $* is a feature unique in Retina: it is the character-repetition special operator.

For example, 5$*x would become xxxxx.

In the case that the previous argument is absent, the whole match is used as the default argument.

Answer 6

Python, 21 bytes

lambda n:"="*n+"(:)-"

Ideone it!

Answer 7

Java 8, 52 bytes

n->new String(new char[n]).replace("\0","=")+"(:)-";

Test suite. (Compile > Execute)

Credits.

teh traditional way, 61 54 53 bytes

7 bytes thanks to Kevin Cruijssen.

1 byte thanks to Dom Hastings.

n->{String s="";for(;n-->0;)s+="=";return s+"(:)-";};

Answer 8

Haskell, 25 bytes

f n=('='<$[1..n])++"(:)-"

'='<$[1..n] is equivalent to replicate n '='.

Answer 9

Python, 24 bytes.

print"="*input()+"(:)-"

input() gets input from user

*, when used on strings and an integer, creates a new string, which is made of joined copies of the original. For example: "hello "*3 outputs hello hello hello.

By multiplying = and input(), you get a string of = the length that the user specifies.

Using + joins two strings, in this case, our body "=…=" with our head, "(:)-" to make the snake.

print outputs the result.

Answer 10

Jelly, 9 bytes

”=x;“(:)-

Try it online!

”=x;“(:)-
”=          '='
  x         repeat (argument) that many times
   ;        append
    “(:)-   "(:)-"

Answer 11

05AB1E, 10 9 bytes

'=×"ÿ(:)-

Explanation

'=         # push equal-sign
  ×        # repeat input nr of times
   "ÿ(:)-  # interpolate snake body with head as a string
           # implicitly display

Try it online

1 byte saved thanks to Adnan.

Answer 12

C, 38

f(n){for(;n--;printf(n?"=":"=(:)-"));}

Try it on ideone.

Answer 13

Javascript, 23 bytes

n=>"=".repeat(n)+"(:)-"

Answer 14

C#, 28 bytes

n=>new string('=',n)+"(:)-";

Answer 15

GolfScript, 11 10 bytes

~"="*"(:)-"

Multiplies "=" by input, and adds head.

-1 thanks to Leaky Nun

Answer 16

Mathematica, 21 20 bytes

"="~Table~#<>"(:)-"&

Anonymous function. Takes a number n as input, and returns a snake of length n as output. "="~Table~# generates a list {"=", "=", ..., "="} of length n, and <>"(:)-" concatenates the list's elements and appends "(:)-" to the resulting string.

Answer 17

Batch, 68 bytes

@set h=(:)-
@for /l %%i in (1,1,%1)do @call set h==%%h%%
@echo %h%

Answer 18

R, 32 27 bytes

This solution is pretty straightforward, rep function repeats the first element ("=") scan() times, which is in fact the user's input.

a=scan();cat(rep("=",a),"(:)-")

EDIT:

cat(rep("=",scan()),"(:)-")

Slighly shorter answer, using scan() directly.

Alternatively,

cat(rep("=",scan()),"(:)-",sep="")

for a non-chopped snake (34 bytes)

Answer 19

C, 46 45 43 bytes

saved 2 bytes thanks to owacoder! saved 3 bytes thanks to rici!

f(n){while(4-printf("=\0(:)-"+2*!n--));}

Try it on Ideone!

Answer 20

CJam, 13 11 bytes

qi'=*"(:)-"

Test it here.

-2 bytes thanks to quartata

Answer 21

JAISBaL, 9 bytes

t=*Qb(:)-

Verbose:

# \# enable verbose parsing #\
push1 =        \# push = onto the stack #\
mul            \# multiply the top two values of the stack #\
popout         \# pop the top value of a stack and print it #\
print4 (:)-    \# print (:)- #\

Tested with JAISBaL-0.0.7 (The compiled .jar was just pushed, but the source has been up on git for a while)

Answer 22

Perl 6,  16 15  12 bytes

{"{'='x$_}(:)-"}
{'='x$_~'(:)-'}
'='x*~'(:)-'

Explanation:

'=' x * # ｢=｣ string repeated by the only parameter ｢*｣
~        # concatenated with
'(:)-'   # the head

Usage:

# store it in the lexical namespace
my &snake = '='x*~'(:)-';

put snake 10;

# put ^5 .map: &snake;
put ^5 .map: '='x*~'(:)-';

==========(:)-
(:)- =(:)- ==(:)- ===(:)- ====(:)- =====(:)-

Answer 23

PowerShell v2+, 19 bytes

'='*$args[0]+'(:)-'

Full program. Takes input $args[0], uses string multiplication to construct the body, then string concatenation to tack on the head.

PS C:\Tools\Scripts\golfing> .\snakes-all-around.ps1 7
=======(:)-

PS C:\Tools\Scripts\golfing> .\snakes-all-around.ps1 77
=============================================================================(:)-

Answer 24

Cheddar, 15 bytes (noncompeting)

n->'='*n+'(:)-'

A straightforward answer.

Answer 25

Befunge 93, 25 bytes

Try it Online!

1+:&`#v_"=",
"(:)-"<@,,,,

Not compatible with '98, because the & character acts like r when there is no input, instead of repeating the last token

Answer 26

C++14, 59 bytes

As unnamed lambda:

#import<string>
[](int n){return std::string(n,61)+"(:)-";}

Usage:

#include<iostream>

#import<string>
auto f=
  [](int n){return std::string(n,61)+"(:)-";}
;

int main(){
  std::cout << f(2) << std::endl;
  std::cout << f(5) << std::endl;
  std::cout << f(10) << std::endl;
}

Answer 27

Turing machine code, 242 bytes

0 * * r 0
0 _ _ l A
A 0 9 l A
A 1 0 r 1
A 2 1 r 1
A 3 2 r 1
A 4 3 r 1
A 5 4 r 1
A 6 5 r 1
A 7 6 r 1
A 8 7 r 1
A 9 8 r 1
A _ _ r 3
1 _ = l 2
1 * * r 1
2 = = l 2
2 * * * A
3 = = r 4
3 * _ r 3
4 = = r 4
4 _ ( r 6
6 _ : r 7
7 _ ) r 8
8 _ - * halt

Try it online.

Answer 28

Common Lisp, 29 bytes

(format t"~v{=~}(:)-"(read)1)

Answer 29

Befunge-98 (FBBI), 22 18 bytes

Saved 4 bytes by putting the "-):(" at the beginning. This let me get rid of the separate printing of the head, and also the ' for pushing the =.

"-):(="&k:$$>:#,_@

Try it online!

Explanation

"-):(="                   Pushes '-):(=' to the stack - the head reversed
       &k:                Duplicates the = N+1 times (now there are N+2 '='s on the stack)
          $$              Discards 2 so that there are N '='s
            >:#,_         Prints all the top non-zero chars on the stack (the whole snake)
                 @        Exits

Answer 30

VBA Excel, 23 bytes

using Immediate window and cell [A1] as input

?string([A1],"=")"(:)-"

Answer 31

Sesos, 11 bytes

Hexdump:

0000000: aaaa5e a0f7b4 ed4cee 5d3b                         ..^....L.];

Try it online!

Assembler:

set numin
add 61
fwd 1
get
jmp,sub 1,rwd 1,put,fwd 1,jnz
add 40,put
rwd 1,sub 3,put
fwd 1,add 1,put
add 4,put

Answer 32

K, 17 Bytes

{,[x#"=";"(:)-"]}

Example;

f:{,[x#"=";"(:)-"]}
-1(f'!10);          /print out the result of calling f where x is 0 1 2 3 4 5....
(:)-
=(:)-
==(:)-
===(:)-
====(:)-
=====(:)-
======(:)-
=======(:)-
========(:)-
=========(:)-

Explanation;

{}                 /function x is implicit and is an int
x#"="              /take (#) x of "=" --> so 3#"=" gives "==="
,[x#"=";"(:)-"]    /comma is a join that takes 2 args --> ,[x;y] gives the concatination of x and y --> "a","abc" is the same as ,["a";"abc"] and gives "aabc"

Answer 33

Perl, 16 + 1 (-p flag) = 17 bytes

$_="="x$_."(:)-"

Needs -p flag, so run with :

perl -pe '$_="="x$_."(:)-"'

Answer 34

Minkolang 0.15, 12 bytes

"=(:)-"nD$O.

Try it here!

Explanation

"=(:)-"         Push this to the stack in reverse order - ["-",")",":","(","="]
       n        Take number from input
        D       Pop k and duplicate top of stack (the "=") k times
         $O.    Output whole stack as characters and stop.

Answer 35

Befunge-98, 24 bytes

Takes numerical input from the user, then prints the snake.

'=&:00pk:00gk,"-):("4k,@

Answer 36

Matlab / Octave, 22 bytes

@(n)[~(1:n)+61 '(:)-']

This is an anonymous function.

Try it on Ideone.

Explanation

Assume n= 5.

1:n produces the row vector [1 2 3 4 5].

~(1:n) negates each entry, so it gives [0 0 0 0 0].

...+61 adds 61 to each entry, so it gives [61 61 61 61 61]. 61 is the ASCII value of character =.

[... '(:)-'] concatenates that with the string '(:)-'. This automatically converts [61 61 61 61 61] into the string '=====' before the concatenation.

Answer 37

Dyalog APL, 13 bytes

'(:)-',⍨⍴∘'='

'(:)-',⍨ the snake head appended to
⍴∘'=' n repetitions of a body segment

TryAPL online!

A proper function. The equivalent program is '(:)-',⍨⎕⍴'='.

Answer 38

Brainfuck, 53 bytes

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

Explanation:

++++[->+++++<]    We build a 20 as 5*4
>[->+++>++<<]     We build a 60 and a 40 in two neighboring cells out of the 20, by multiplying the 20 with 3 and with 2
,>+<[->.<]        Read input, and print 61 ('=') as many times as the input idicates
>>.<---.>+.++++.  Print out the rest, "(:)-", noting how close each character is to either 60 or 40.

Answer 39

x86 COM, 29 bytes

8A 0E 82 00 80 E9 30 B4
02 B2 3D CD 21 49 75 FB
BA 18 01 B4 09 CD 21 C3
28 3A 29 2D 24

aka

16DA:0100 8A0E8200      MOV     CL,[0082]
16DA:0104 80E930        SUB     CL,30
16DA:0107 B402          MOV     AH,02
16DA:0109 B23D          MOV     DL,3D
16DA:010B CD21          INT     21
16DA:010D 49            DEC     CX
16DA:010E 75FB          JNZ     010B
16DA:0110 BA1801        MOV     DX,0118
16DA:0113 B409          MOV     AH,09
16DA:0115 CD21          INT     21
16DA:0117 C3            RET
16DA:0118 283A          SUB     [BP+SI],BH // Snake Head
16DA:011A 292D          SUB     [DI],BP    // Snake Head
16DA:011C 2400          AND     AL,00      // Snake Head

Name it "snake.com"

Call it from cmd (tested with Win XP), parameters 1 to 9 supported:

snake 5

results in

=====(:)-

Answer 40

C#, 42 bytes

string w(int n)=>new string('=',n)+"(:)-";

Try it here!

Answer 41

Lua, 28 Bytes

Takes input in the form of a command-line argument and outputs via its return value. Even if it uses a return statement, it is still a full program :).

return("="):rep(...).."(:)-"

Answer 42

LiveScript, 15 bytes

->'='*it+'(:)-'

Answer 43

BASIC, 30 bytes

Let's keep it simple in BASIC. QB64 and TRS-80 Extended Color BASIC both tie, since TRS-80 needs a line number but doesn't need the space after INPUT, and it won't let you use INPUT in immediate mode. One liners are rare on a 32x16 screen.

TRS-80: (should also work on Microsoft GW-BASIC/BASICA)

0INPUTL:?STRING$(L,"=");"(:)-"

QB64:

INPUT L:?STRING$(L,"=");"(:)-"

Answer 44

Java 1.7, 46 bytes

A recursive (and shorter) alternative to the iterative and 'replace' versions.

String f(int n){return n>0?"="+f(--n):"(:)-";}

Run it here.

This function first builds the n tail elements recursively, then appends the head.

Answer 45

Brainfuck, 47 46 44 bytes

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

Try it online! Takes input as a single byte value (e.g. space is 32). The program requires an interpreter with 8-bit cells and a tape not bounded on the left.

+[+<-[<]>->>++] (found by a bit of brute forcing) initialises the tape to

[253, 0, 0, 232, 0, 0, 40, 0, 59, 86, 0]
                                      ^

We then increment the 59 to 61 with <<++ and read the input char with <,. [->.<] then outputs the required number of =, and <.>>---.<<+.++++. outputs the (:)- portion, making use of the aforementioned 61 as well as the 40 two cells away.

Answer 46

Fish (><>), 33 bytes:

An upside down F cause ><>. Takes integer as command line argument by running ./fish.py snake.fish -v [number].

\
"
-
)
:
(!;!?lo<
=
"
>{1-:?!^}:

Try it here! The best explanation is to watch it with animation on the website.

Answer 47

Scala, 30 Bytes

(x:Int)=>print(("="*x)+"(:)-")

Answer 48

Microscript, 14 bytes

ic'=P]"-):("ah

Answer 49

Microscript II, 13 bytes

"="sN*p"(:)-"

Answer 50

SNOBOL4 (CSNOBOL4), 39 bytes

 OUTPUT =LPAD('(:)-',INPUT + 4,'=')
END

Try it online!

Answer 51

Charcoal, 7 bytes

×=Ｎ(:)-

Try it online!

This is equivalent to the following code:

Print(Times("=", InputNumber()));
Print("(:)-");

Answer 52

Excel VBA, 20 Bytes

Anonymous VBE immediate window function that takes input, a, from range [A1] and outputs a snake of the length a to the VBE immediate window.

?[Rept("=",A1)]"(:)-

Answer 53

Sinclair ZX80 (4K ROM) ~39 bytes

 1 INPUT L
 2 FOR I=1 TO L
 3 PRINT "=";
 4 NEXT I
 5 PRINT "(:)-"

No explanation needed really.

Answer 54

JavaScript 6, input unary '=', 11B

x=>x+'(:)-'

Standard rule allowes it.

Fix it if that's not what you want.

Answer 55

Pyth, 10 bytes

+*\=Q"(:)-

Test suite.

+*\=Q"(:)-
    Q        get input
 *\=         repeat "=" that many times
+    "(:)-   append "(:)-"

Answer 56

C++, 106 103 bytes

#include <iostream>
void s(int n){for(int i=0;i<n;i++){std::cout<<"=";}std::cout<<"(:)-"<<std::endl;}

Usage

#include <string>
int main(int argc, char *argv[]) {
    int length = std::stoi(argv[1]);
    s(length);
    return 0;
}

Ungolfed

#include <iostream> // for printing
void outputSnake(int length) {
    for (int i = 0; i < length; i++) { // iterates over length of snake
        std::cout << "="; // prints an equals sign
    }
    std::cout << "(:)-" << std::endl; // prints rest of snake
}

---

Thanks @LeakyNun for shaving off 3 bytes.

Answer 57

><>, 26 23 bytes

:?!v"="o1-
oo;>"-):("oo

-3 bytes thanks to Leaky Nun

Test it here. (you have to input the code manually)

Answer 58

Java, 133 bytes

public class Snake {
    public void s(int n){
        for(int i=0;i<n;i++){
            System.out.print("=");
        }
        System.out.println("(:)-");
    }
}

Answer 59

Bash, 52 36 bytes

while [[ ${#a} -lt $1 ]];do a=$a=;done;echo "$a(:)~"

printf -vs %$1s;echo "${s// /=}(:)~"

Excellent suggestion by @manatwork.

If one would like to use external programs (sed) this could be a bit smaller(31 bytes):

printf "%$1s(:)~"|sed 's/ /=/g'

Run like that:

$ bash snake.sh 1
=(:)~
$ bash snake.sh 3
===(:)~

Answer 60

Javascript (using external library) (39 bytes)

n=>_.Range(0,n).Write("=",x=>"")+"(:)-"

Link to lib: https://github.com/mvegh1/Enumerable

Code explanation: Create an array of n elements, and Write a concatenated string with "=" as the delimiter and an empty string as the current element. Then concatenate the head of the snake

Answer 61

Matricks, 24 bytes

Very simple, just wanted to show off the new matrix definition feature.

m61:1:n;;a<40,58,41,45>;

Run with python matricks.py snek.txt [[]] <input> --asciiprint

Answer 62

MATL, 12 bytes

61iY"'(:)-'h

Try it on MATL Online.

Explanation

61       % ASCII value for '='
i        % Take input number, n
Y"       % Row vector with 61 repeated n times
'(:)-'   % Push this string
h        % Concatenate horizontally. This converts to string. Implicitly display

Answer 63

Nim, 46 bytes

import strutils,future
n=>repeat("=",n)&"(:)-"

This is an anonymous function that must be passed to a procedure to be used. To test, use the testing program below:

import strutils,future
proc test(f: int -> string) = echo f(#[Your input here]#)
test(n=>repeat("=",n)&"(:)-")

Answer 64

Clojure, 35 bytes

#(str(apply str(repeat %\=))"(:)-")

This is an anonymous/unnamed function that takes a single integer as an argument and returns a string.

Answer 65

ECMAScript 6, 37 44 37 bytes

Try it here!

Golfed

alert("=".repeat(prompt())+"(:)-");

Ungolfed

alert("=".repeat(prompt()) + "(:)-");

Revisions

• Original revision.
• Added alert(); because it used to save to a variable, n. Try it here!
• Used ECMAScript 6's String.prototype.repeat method instead of the previous method that didn't even work and took more bytes. Try it here!

---

ECMAScript 6, 53 bytes

This is a version of the above code that is a function, not a full program. Try it here!

Golfed

function makeSnakeArt(n){return"=".repeat(n)+"(:)-")}

Ungolfed

function makeSnakeArt(n) {
    return "=".repeat(n) + "(:)-"
}

alert(makeSnakeArt(5));

Revisions

• Original revision, stemming off the 3rd revision of the full program. Try it here!
• Returns the snake instead of alerting it. Try it here!

Answer 66

PL/SQL: 28 bytes

rpad('=','&n','=')||'(:)-');

Answer 67

VBA, 37 bytes

Function S(L):S=String(L,"=")&"(:)-"

and enter gives the End Function. Immediate window of VBA editor:

?S(41)
=========================================(:)-

Answer 68

Brainfuck, 67 bytes

Code:

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

Explanation:

> At #1
++++++[>++++++++++<-]>+< Put '=' in #2
, Input into #1
[->.<] Output '=' #1 times thereby emptying #1
<++++[>++++++++++<-]>. Put '(' in #1 and output

> At #2
--- Change #2 to ':'
. Output

< At #1
+.++++. Change to '(' and 'minus' and output

Try it online!

Input works using the corresponding ASCII characters - that is, to input 33 you would type !. For convenience, you can use \d as the input in the interpreter linked, where d is any non-negative integer.

Answer 69

Julia, 15 bytes

x->"="^x*"(:)-"

Wow, this is short.

Answer 70

Racket, 46 bytes

(λ(n)(string-append(make-string n#\=)"(:)-"))

Pretty terrible golfing language :)))

Answer 71

, 10 chars / 13 bytes

⍘=Ċï+'(:)-

Try it here (ES6 browsers only).

Should be rather self-explanatory.

Answer 72

Silicon, 12 bytes

I"="*"(:)-"+

Explanation:

I"="*"(:)-"+

    *   Times
I       Get an integer as input
"="     Push "="

"(:)-"  Push "(:)-"
+       Append

Alternatively, 11 bytes (but non-competing):

"="ã"(:)-"+

Answer 73

PHP, 27 bytes

Not the most wonderfull creation, but with register_globals on you can set it via url.

<?=str_repeat('=',$n)?>(:)-

Answer 74

Ruby, 20 bytes

->n{puts?=*n+"(:)-"}

Answer 75

Ruby, 27 bytes

puts"="*($*[0].to_i)+"(:)-"

Answer 76

J, 14 bytes

'(:)-',~'='#~]

Very simple. This is a five train:

'(:)-' ,~ '=' #~ ]

Both strings, in this case, become constant verbs. #~ essentially repeats its left argument the amount of times as its right argument. ,~ then appends its left argument to the end of its right argument.

Test cases:

   f 2
==(:)-
   f 7
=======(:)-
   f 10
==========(:)-
   f 0
(:)-

I think that it would look more snake-like with a tilde at the end, but eh.

Answer 77

Kotlin, 34 bytes

{String(ByteArray(it){61})+"(:)-"}

This assumes that a function of (Int)->String type is requested (in such case, it is assumed to be an Int). Version with explicit typing (40 bytes):

{n:Int->String(ByteArray(n){61})+"(:)-"}

Try it out on the JVM target:

fun main(args: Array<String>) {
    val f: (Int)->String = {String(ByteArray(it){61})+"(:)-"}
    println(f(5))
}

Answer 78

R, 39 bytes

Mildly different than others above

for(i in 1:scan())cat("=");cat("(:)-")

or, if we can precede the line with the input

->n;for(i in 1:n)cat("=");cat("(:)-")

Answer 79

Perl, 16 bytes

say'='x<>.'(:)-'

Takes input from stdin

Answer 80

Pyke, 10 bytes

\=*"(:)-"+

Try it here!

Or 8 bytes (noncompeting)

\=*"(:)-

Try it here!

Answer 81

Python, 23 bytes

print'='*input()+'(:)-'

Answer 82

Ruby, 24 bytes

def f(l) ?=*l+"(:)-";end

Answer 83

PyMin, 15 bytes

»"="*¬+"(:)-"

Answer 84

GameMaker Language, 49 bytes

s="(:)-"for(a=0;a<argument0;a++){s="="+s}return s

Answer 85

Factor 34

[ [ "="write ] times "(:>~"print ]

Quotation (anonymous function) that takes a number and prints a snake.

Alternative (also 34):

[ 61 <string> ":>~""("glue print ]

^{Sorry, but i made some aesthetic changes...}

10 [ [ "="write ] times "(:>~"print ] call
==========(:>~

Answer 86

Neoscript, 15 bytes

{n|'=*n+"(:)-"}

Answer 87

Fourier, 28 bytes

I(61ai^~i)40a-8a58a32a41a+4a

Try it online

Answer 88

GNU sed, 16 bytes

y/0/=/;s/$/(:)-/

Since sed has no native support for numbers, the input is given in unary based on this consensus.

Run:

sed -f snake.sed <<< "000"

Output:

===(:)-

Answer 89

JavaScript, 53 Bytes

function a(b){return "=".repeat(parseInt(2))+"(:)-"}