Lean, 42 bytes
def f:nat->nat|0:=0|1:=1|(n+2):=f(n+1)+f n
Try it online!
Lean is a completely different kind of a programming language: it is a proof-assistant. That means, mathematical theorems can be formalized and proved in Lean, and mathematical objects can be constructed in Lean.
Introduction
I have some ASCII cars that have velocity and direction. For example:
<>
1>
2>
3>
After one second, I get
<>
1>
2>
3>
After two, I get
<>
1>
2>
3>
If two cars are too close, they crash.
1> <1
1> <2
After a second, this becomes
###
##
If two cars in...
@Downgoat the fact that the T is a different width from everything else bugs me
@musicman523 test cases would be nice :) I would also suggest rewording the case for which no intersecting plane exists, perhaps something along the lines of "If no such plane exists, return something recognizably distinct from other valid outputs of your program, such as an empty tuple (), false, etc."
Lean, 42 35 bytes
7 bytes thanks to Mario Carneiro.
def f:_->nat|(n+2):=f(n+1)+f n|x:=x
Try it online!
Lean is a completely different kind of a programming language: it is a proof-assistant. That means, mathematical theorems can be formalized and proved in Lean, and mathematical objects ca...
Background
IEEE 754 Double-precision floating-point format is a way to represent real numbers with 64 bits. It looks like the following:
A real number n is converted to a double in the following manner:
The sign bit s is 0 if the number is positive, 1 otherwise.
The absolute value of n is r...
@LeakyNun Is it? How is it different from, say, Coq or Agda. It's not like it's the first theorem prover to exist. (Note that I don't know either of those languages)
Uhh... In Python def is a reserved name. And I want to create a class with a property named def, since it's a very common name for the defence character stat. I could name it DEF, but that's commonly used for constants... now what?
Introduction
I have a lot of ASCII rocks. They are built with dashes, pipes, Vs, carets, slashes and spaces. Example:
/--\
| |
| |
\--/
I want to erode them, like this:
/\
/ \
\ /
\/
All of the corners have become rounder. A more complicated example:
/----\
| \------\
| ...
Curry which is very similar to Haskell doesn't use fall throughs and while it can be annoying it forces you to write cleaner clearer code. And gives you the advantage of being much closer to pure declarative programming.
And it looks like your hypothetical language has much more powerful pattern matching making the need for fall throughs smaller.
ASCII-art to numbers
Any suggestions for the title?
code-golf ascii-art
Inspired by Digits in their lanes
Input:
An ASCII-art of width ≤ 11, consisting of spaces and #. (You can choose any two distinct characters instead.) Example:
#
###
#
#
# #...
guys I just found the best way to optimize programs: sleep for a negative duration, it'll make your programs terminate instantly, if not earlier than when they were executed!
Hyperprogramming: X×Y, X^Y, X^^Y all in two
code-golf math number arithmetic source-layout, just like the original.
Heavily inspired by Hyperprogramming: N+N, N×N, N^N all in one.
Your task is to write two programs so that they compute different hyperoperations when they are placed in relation...
4 | // a string you would eat ungodly amounts of memory so for this purpose you may
5 | // want to reference the File class.
> 6 | //
| ^
7 | // VSL strings are _immutable_. This means that you can't really 'modify' a
8 | // string, you must create a new one. This is automatically done with string
And the Platinum subscription gives you access to a Seed variant where the seed is written in hexadecimal instead of base 10. Imagine the byte savings!
Befunge-93, 99 98 96 95 92 90 bytes
<vp90:g80<p80 &
v?v>v>9g1-:0`|
0^1-:0v\g80:$<
>v<10^ +*2p90<
v>\^`$`>!
.v _^>|
@ >$v
Try it online!
This deserves a separate spot from my other answer, as I did this from scratch.
This generates an integer (x) in the range [0,2^n) using random binary...
Lean, 42 bytes
def f:nat->nat|0:=0|1:=1|(n+2):=f(n+1)+f n
Try it online!
Lean is a completely different kind of a programming language: it is a proof-assistant. That means, mathematical theorems can be formalized and proved in Lean, and mathematical objects can be constructed in Lean.
Introduction
I have some ASCII cars that have velocity and direction. For example:
<>
1>
2>
3>
After one second, I get
<>
1>
2>
3>
After two, I get
<>
1>
2>
3>
If two cars are too close, they crash.
1> <1
1> <2
After a second, this becomes
###
##
If two cars in...
Background
IEEE 754 Double-precision floating-point format is a way to represent real numbers with 64 bits. It looks like the following:
A real number n is converted to a double in the following manner:
The sign bit s is 0 if the number is positive, 1 otherwise.
The absolute value of n is r...
ASCII-art to numbers
Any suggestions for the title?
code-golf ascii-art
Inspired by Digits in their lanes
Input:
An ASCII-art of width ≤ 11, consisting of spaces and #. (You can choose any two distinct characters instead.) Example:
#
###
#
#
# #...
Hyperprogramming: X×Y, X^Y, X^^Y all in two
code-golf math number arithmetic source-layout, just like the original.
Heavily inspired by Hyperprogramming: N+N, N×N, N^N all in one.
Your task is to write two programs so that they compute different hyperoperations when they are placed in relation...
Befunge-93, 99 98 96 95 92 90 bytes
<vp90:g80<p80 &
v?v>v>9g1-:0`|
0^1-:0v\g80:$<
>v<10^ +*2p90<
v>\^`$`>!
.v _^>|
@ >$v
Try it online!
This deserves a separate spot from my other answer, as I did this from scratch.
This generates an integer (x) in the range [0,2^n) using random binary...
Printable ASCII table
Your challenge is to output this exact text:
32 33 ! 34 " 35 # 36 $ 37 % 38 & 39 ' 40 ( 41 )
42 * 43 + 44 , 45 - 46 . 47 / 48 0 49 1 50 2 51 3
52 4 53 5 54 6 55 7 56 8 57 9 58 : 59 ; 60 < ...
