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 |
Code-golf is a competition to solve a particular problem in the fewest bytes of source code.
0
votes
Format the given number of bytes to a human readable format
brainfuck, 396 376 bytes
,[<[->>+<<]>>+>,]<<[>[<<+>>-]<<<]<-------<---<--<-[>+>-->+>>>>>>+<<<<<<<<<-------]>>>>>>>+++>>++++<<<<<--[>>>+<<<++++++]+>-[-[-[-[-[-[-[-[-[-[-<->]<[>>.>.>.[<<]>.>>>-]>]<[->>. …
2
votes
What's my middle name?
Brainfuck, 98 bytes
>+[,>++++[<-------->-]<]>++++[<++++++++>-]<[>,]++++[<-------->-]<[[-]++++[<-------->-]<]<[<]>>[.>]
Explanation
>+[,>++++[<-------->-]<] Skip input until first space
>++++[<++++++ …
2
votes
Chessboard pattern
brainfuck, 249 bytes
>-[-[-<]>>+<]>->+++>-[<+>---]+>>>>>>+[[-]>,[>++++++[<-------->-]<<<[->>++++++++++<<]>+>[-<<+>>]]<]<[<+<+>>-]<<[->[->+<<<+<[<<<.>>>->-<]>[<<<.>>+>-]>>]++++++++++.[-]>[<+>>+<-]>>++< …
1
vote
Output Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo
brainfuck, 226 bytes
--[++>+[<]>+]<++++[>++++++++<-]>>>---->-[<++>>++>++<<-----]->>>----[<<<+++++>>>--]----->++++++>+++++++++>-[<<<++>++>++>-----]<[<]>>.>>[.>]<[<]>.>>[.>]<[<]>.>.>>[.>]<[<]>.>>[.>]<[< …
0
votes
Langton's ant ASCII art.
brainfuck, 5040 4562 4390 bytes
,>,>,>++++++[->++++++++<]>[<<-<-<->>>>-]>++++++++>++++++++<<<<[>+>+<<-]>[<+>-]<<[>>+>+<<<-]>>[<<+>>-]<<<[>>>+>+<<<<-]>>>[<<<+>>>-]>[<+>[-]]<[>>>>+>+<<<<<-]>>>>>[<<<<<+> …
3
votes
Backhanded^H^H^H^H^H^Hspaces
brainfuck, 81 bytes
>,[[>+>+<<-]-[>-<---]>---------[>>+<<[-]]>>-[+<[-]<<<,[-]>>]<[<<+>>-]<,]<[<]>[.>]
Try it online!
1
vote
Print a 10 by 10 grid of asterisks
BRASCA, 14 bytes
l[ll['*o{]xo{]
Try it online!
2
votes
Draw a big slash X
brainfuck, 285 276 bytes
+++++++++++[>+>>++++++++>++++>++++++++>+++<<<<<<-]>->>++++>+++>>->>>,[>>-<<[<<[<.>->+<]<[<]>.[>]>>[<<++>>->+<]<<-[<.>-]<<<.<<<.>>[>]+>[<+>-]>>-[<+>-]<]<<[<.>->>+<<]<<.<<<<.>>[ …
4
votes
Make me a blanket!
Brainfuck, 301 bytes
-[>+<-----]-[>>+<<---]>---->+++++++>>++++[<++++++++>-]>+++>++++++++++<[-<++++++[-<<....<....>>>]>>.<<++++++[-<.<..<....>>.>]>>.<<++++++[-<..<<....>>..>]>>.<<++++++[-<.<<....>..>.> …
0
votes
Output the PPCG Prime
brainfuck, 531 503 bytes
-[>+>+<<-----]>++++>-->---[>+<+++++++]>++>>++++++++++<<<++++[->[>+<-]>[<<<<.>>>+>-]>.<<<]++[->[>+<-]>[<<<.>>+>-]>.<<<]<<+>>++[-<.<........>.>]++[-<..<......>.>]<.>>>>.<<<++[-< …
1
vote
Draw my downslashes
brainfuck, 151 bytes
>->++++[>++++++++<-]>>+[[-]>[-]>,[<+<+>>-]<<[>++++>-[<->-----]+<[<<<<+[>+<-]>[<+>>.<-]>>>>-]>[<<<<<[>+<-]>[<+>>.<-]->>>>->]<<<.>>>++++++++++.[-]>]<<<<]
Try it online!
1
vote
Coffee Machine Machine
brainfuck, 546 bytes
-[+>+[+<]>+]>>++++++++++>------->-[<++>-----]<........<<.+>>.........<.>>>++++[<++++++++>-]--->--[<+>--]++>-[<+>-----]+++>-[<+>---]<<<.<......>.<.<---.>...<<<--.++>>>...<<<.>.>>>. …
5
votes
Print a Ternary Value
brainfuck, 3178 3073 3072 2961 2955 bytes
-6 bytes thanks to Jo King
++>->>->->->>->>+>->->>->>+>>+>->->->+>>>->+>>+>+>->>+>>>>>>>>->->+>>->+>+>+>+>+>>>>>->+>->->->->>>>->->+>->>+>->>->+>->>>>+>>>->>> …
1
vote
I uppercase the source code, you reverse the input!
Self-modifying Brainfuck, 52 bytes
␀ represents the literal null byte \x00
-[<->---]<[[-]<[<]>----------------[>]]>,[␀>,]<[.<]u
Try it online!
On the interpreter the input has a null byte at the end
…
0
votes
Generate 100 Java Tuple classes
brainfuck, 881 781 bytes
--->-[<++>-----]>+[[-]--[----->+<]>---.+++++++++.-----------.--[---<+>]<--..+[---->+<]>+++.----[-<+++>]<.-[--->+<]>++++.-----.----.-------.[-]<<+[>>->+<<<-]>>>[<<<+>>>-]<[[+]< …