Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with code-golf
Search options not deleted
user 59288
Code-golf is a competition to solve a particular problem in the fewest bytes of source code.
8
votes
Connect the pixels
Python 2.7, 318 315 bytes (270 267 chars)
I'm sure this can be golfed further (particularly I'd love to get rid of that annoying first-line comment) but here's my entry:
#encoding:utf-8
f=lambda t:(la …
- 706
5
votes
Just repeat yourself
Befunge 98, 70 66 bytes
Try it online!
After my invalid answer, here's a better one that actually fits the challenge!
2200**xx""!!fflleessrruuooyy ttaaeeppeerr ttoonn ooDD��""kk,,@@
(Thanks to …
- 706
8
votes
Let's draw some Atari ST bombs!
Python, 223 179 bytes
Second approach:
f=lambda n:'\n'.join(''.join(2*' #'[int(d)]for d in bin(int('0c0052000100908023e003e00ff81ffc1ffc3ffe3fde1fdc1fbc0ff807f001c0'[i:i+4],16))[2:].zfill(16))*n for …
- 706
4
votes
Happy Birthday V!
Python, 110 bytes
Try it online!
I'm sure this isn't optimal, but it's pretty Pythonic at least:
def f(s):n=len(s)*2-1;return''.join(i*' '+s[:n+1-i]+(n-2*i)*' '+s[n-i-1::-1]+'\n'for i in range(n))+ …
- 706
2
votes
Quine in Bytes, not Characters
Metatape, 22 bytes
@a{ooxooeooxoeo} !a !a
The space characters are not syntactically necessary, but they take up less space than it would to output 21 or 20.
@a{...} defines a subroutine named a, …
- 706
1
vote
How much will this cost?
TI-BASIC, 3 tokens
sum(L₁L₂
Input in L₁ and L₂, output in Ans.
Usage:
{1,2,3→L1
{4,5,6→L2
prgmCOST
Output: 32
- 706
0
votes
Will it halt? (Cops)
Befunge-98, 34 bytes, Possibly cracked
> #;de+294&:0\`#;_3*+*\-\0pqk$#q_
Unfortunately I couldn't get this to halt in TIO or CCBI, but it works in BefungeSharp. (If you can find a way to make it ha …
- 706
1
vote
Count up forever
Befunge - 4 bytes
I’m surprised there isn’t already a Befunge answer on here.
1+:.
- 706
16
votes
Hyperprogramming: N+N, N×N, N^N all in one
Befunge-98 (FBBI), 38 41 bytes
(+3 bytes to fix bug, thanks Jo King!)
vx:k::1-k*\/.@
20@
j3.
>^*
>:^
>:+.@
Try it online: N+N, N*N, N^N
This program won't work out-of-the-box since it requires input …
- 706