Today I learned why lock(thing) { await do_stuff(); } is a compiler error in C# by spending 4 hours fixing errors where threads would exit before releasing the locks they acquired.
I was reading a children's math book.. it says... On planet binary kids have only 1 finger on each hand. They count 1,10,... what are the next five numbers?
If you only have 1 finger on each hand, can you have more than 4 numbers in a sequence?!
Output digits of \$\pi^{1/\pi}\$ forever
This challenge is to produce the shortest code for the constant \$\pi^{1/\pi}\$. Your code must output consecutive digits of \$\pi^{1/\pi}\$ forever.
This is code golf, so the shortest submission (in bytes) wins except that it must output the first 10,0...
I think it would be interesting as code-golf, but that 10,000 digits is a lot. Maybe 1000? I also think I would personally be more interested to solve it if I had to only output a fixed number of digits, kolmogorov style
also i have no idea how hard is it to meet that speed requirement, which matters a lot - I don't think anyone would enjoy golfing a 400 byte answer in Jelly
@H.PWiz one makes constants not matter much as 10x worse speed just means posting the answer a bit later, the other makes them pretty important, especially if the limit is as low as 10s
e.g. Kotlins Hello World takes 8s on TIO for some reason, giving only 2s freedom (i have no doubt that's because of compilation/restarting everything from scratch for sandboxing, but still)
@Anush start with a big enough precision to get exactly 1000 decimal places, then after that, multiply precision by 9, start again, output the 1001th digit, multiply precision by 9, output 1002th, etc. Should work pretty fast for the requirement and work at all after
Output the 3x3x3 cube as a graph
Your task is to generate a graph with 54 vertices, each corresponds to a facet on a Rubik's cube. There is an edge between two vertices iff the corresponding facets share a side.
Rules
You may choose to output an adjacency list, adjacency matrix, edge list, or...
@Anush There's a limit to how many things can be on the sidebar. The update to the incident post knocked the Sandbox off. I removed the featured tag from Best of 2018, so the Sandbox will be back on the sidebar in some indeterminate amount of time.
code-golfnumber
To exponential digit growth and beyond!
Challenge
Given a base (which is less than 10) and a term, your mission (should you choose to accept it) is to:
Make a number which will be the base added by 1. We will call this "the current number"
Do the following the term number of ...
I was wondering about this passage in the finite promise game specification
Z is the set of all integers. N is the set of all nonnegative integers. All letters represent integers.
We say that T:N^k into N is PL if and only if it is piecewise linear with integer coefficients. I.e., T can be defined by various affine functions with integer coefficients on each of finitely many pieces, where each piece is defined by a finite set of linear inequalities with integer coefficients.
It says "finite set of linear inequalities with integer coefficients"
Which since there are `k` inputs to each PL function, I'm guessing it's a set of inequalities like
Given an ASCII art hexagon as input, output one whose sides are all one unit longer.
_____
____ / \
/ \ / \
/ \ / \
\ \ => \ \
\ / \ /
\____/ \ /
...
Output digits of \$\pi^{1/\pi}\$ forever
This challenge is to produce the shortest code for the constant \$\pi^{1/\pi}\$. Your code must output consecutive digits of \$\pi^{1/\pi}\$ forever.
This is code golf, so the shortest submission (in bytes) wins except that it must output the first 10,0...
Output the 3x3x3 cube as a graph
Your task is to generate a graph with 54 vertices, each corresponds to a facet on a Rubik's cube. There is an edge between two vertices iff the corresponding facets share a side.
Rules
You may choose to output an adjacency list, adjacency matrix, edge list, or...
code-golfnumber
To exponential digit growth and beyond!
Challenge
Given a base (which is less than 10) and a term, your mission (should you choose to accept it) is to:
Make a number which will be the base added by 1. We will call this "the current number"
Do the following the term number of ...
