Write a program which will eventually (given enough time) print all possible strings of printable ASCII characters EXCEPT itself. You may print either all strings with length less than or equal to your program, or all strings regardless of length.
If your language requires characters that are not...
I know there's a challenge that's like "output every ASCII/0-255 char except the program" but that's just output the single complement string, not output every possible string except the program
yeah my review stats are pretty bad, to be completely honest :P not because i'm not willing to, otherwise i wouldn't nominate, but because there's never anything in it lol
Graduation Design Userscript
A collaborative graduation user-script has been put together. Github Repo
Pictures
Main
Question:
Leaderboard:
Auto TIO Execution:
Meta:
Chat:
Color Scheme:
If you have any ideas, don't hesitate to comment below.
Features:
See vote counts e...
The idea was I'd make a brainfucking.website in the style of motherfuckingwebsite.com
To handle click events and button presses I'd have a bf program that reads input as click events and modify the tape (where the tape is the website html) in response
> bork /ˈbɔːk/ past tense: borked; past participle: borked obstruct (someone, especially a candidate for public office) by systematically defaming or vilifying them. "‘We're going to bork him’, said an opponent"
Verify a Picture Hanging
There's a classic puzzle that goes:
Given a picture with a rope and two nails, hang the picture around the nails such that if you remove either nail, the picture falls.
Here's a solution to that problem:
Source: Picture-Hanging Puzzles by Demaine et al.
We might then...
Three points on Poincaré disk
What is Poincaré disk?
Poincaré disk is a projection of 2-dimensional hyperbolic geometry to the 2-dimensional Euclidean plane, or more precisely, onto the open disk \$\{(x,y): x^2 + y^2 < 1^2\}\$.
Objective
It is well-known that three distinct points on the Euclidea...
I'm thinking of posting a challenge which is "given N points that all have to be at least 2 metres away from each other pairwise, what's the minimum side length for a square bounding box that they could all fit into"; is this a dupe, would it be too trivial, and what do you guys think?
I may decide to still sandbox it but it seems simple enough that I may bypass the sandbox on this one
I'm just trying to make sure it's not an obvious dupe that I somehow missed or just somehow has a trivial mathematical answer; I'd usually still sandbox things but I occasionally bypass it if it's quite simple
fair enough, I think that's a good idea. that sounds like a really cool idea for a challenge though; I don't think it'd be a CnR? unless you have something in mind, because I'm not sure the KoTH and CnR win conditions are compatible
@Lyxal tag desc just says "For challenges which consist of two adversary (and asymmetric) sub-challenges." so I definitely think your idea would fit under this category
so, would cops write bots to defend an objective and robbers write bots to attack an objective, or something like that? usually with CnR a robber answer can only exist after a cop answer has been posted to break it, but here I think it'd have to work differently
@HyperNeutrino I think that's equivalent to packing N unit circles into a square, except that in your case you end up with a square 2 units smaller, since your square only needs to contain the centres of the circles
@Neil Hm, could be. For whatever reason I'm not convinced that's always true; I feel like removing the circle part and just reducing it to the centers may allow the square to fit more tightly if you rotate it rather than just shrinking by 2 units, but you could be right, I don't really have justification or reasoning for my thought.
dimensional flipper maze test-battery (need a better name)
You're stuck in a maze in one corner, and you want to get to the other corner. However, this maze is unfortunately one dimension higher than you (for simplicity of explanation, you are 1D and it is 2D). Thus, you can only see along one hy...
Inspired by and drawns from Is this number Loeschian?
A positive integer k is a Loeschian number if
k can be expressed as i*i + j*j + i*j for i, j integers.
For example, the first positive Loeschian numbers are: 1 (i=1, j=0); 3 (i=j=1); 4 (i=2, j=0); 7 (i=2, j=1); 9 (i=-3, j=3); ... Note that ...
About geohash
Geohash is one of many encoding systems for geographic positions. Geohash positions have some advantages. It provides a short code instead of the two usual numbers for latitude and longitude.
The challenge
Given two numbers, the latitude and longitude, compute and return or print t...
What?
Many programming languages, both practical and esoteric, have functions, methods, etc to convert a given string to a decimal number. This is how the process might work:
For each character in the given string.
Take the character's ASCII value and subtract it by 48.
Multiply the output by 1...
@RedwolfPrograms Oh, basically I mean once you get to the end, you've finished the maze so it'll just stop your program. Not sure what the significance of that is, I could remove that line.
@RedwolfPrograms I would recommend visiting Jelly Hypertraining (JHT), our chat room specifically for learning Jelly. Mr. Xcoder has made a really awesome summary of how the language structure works, so I recommend you take a look at the tutorial first, and then Mr. Xcoder's summaries,...
... and try some things out and ask in JHT if you'd like help.