Specifically in Jelly, it's possible only when the task is a simple composition of limited set of monads and dyads with some numbers and very few limited quicks, so it's extremely rare to have a fully golfed answer in pure ASCII
@emanresuA 1 such answer per year on average. My 9 (13 before golfing) is the longest one known, and the first to contain at least a dyad, a monad, a quick, and a number
@Bubbler None of the quicks are ascii only, and you need quicks for TCness
Even if you want to build arbitrary programs using a small number of characters, there's no way of converting a number to a character (or getting a specific character) without unord, which isn't ascii
can someone do me a favour and search "wear os tasker theatre mode" on duckduckgo and let me know the results? i'm trying to figure out why it's giving me roblox
you can probably tell what i was trying to do before i got distracted lol
removing "os" gives me a similar set (but not quite the same), rearranging the words doesn't change the results, and removing further words or letters gives actual information
CMQ: Lets say my stack is [a, b, c] and the operation is - then which is more intuitive (or makes sense to you): b - c OR c - b. For me it is the former.
you can remove "os" to preserve the weird behaviour, but i couldn't find any other modifications
if anyone's interested in why i was searching that, i got a new phone and google has a stupid design decision where you need to factory reset your watch to connect to a new phone, so i needed to redo some stuff
C character constants.
I'm not sure if we had something like this before.
Given a value n between 1 and 65535 output the shortest possible c type character constant.
Examples:
65 -> 'A'
13 -> '\13'
17473 -> 'DA'
The character constants can only contain ASCII characters from 32 - 128.
It occurred to me when I was browsing threads here that there is an immense collection of simple and extremely space-efficient functions on this site.
Although I imagine the end result of such an endeavor would be a complete bastardization of best-practices regarding readability and maintainabili...
imagine you have a sequence of positive integers and positive or negative counts in pairs. E.g. (2,3), (1,-2), (2,-2), (1,2) which means 3 twos, -2 ones etc. I want to know if there any of the integers end up with a non-zero count. In this case 2 gets count 1 and 1 gets count 0 so the answer is yes.
if I just let c equal the sum of the counts and z equal the sum of the product of the integers and counts I get c = 1 and z = 2
to answer my question about whether any of the integers have non-zero count, is it enough to check of c = z = 0?
@Anush No: if exactly two have nonzero count, those counts have to be negatives of each other to have c = 0, and then z will be nonzero because the values are different.
One of the main differences between British and American English is that British English tends to say re instead of er in words like center and theater. Center becomes centre and theater becomes theatre.
Your challenge:
You are given a word in American English, and your challenge is to convert th...
Inspired by a tweet by Nathan W. Pyle
There is, now, a standard method of converting your boring, normal human name into a mysterious, ethereal Ghost Name™️. Ably described by Mr Pyle...
Use your first name:
a - add “t” after it
e - add “boo” after it
h - becomes “s”
n - add “oo” after it
...
Da challenge
You are given by your boss some data in this format:
----------
Name | Age
----------
John | 56
Emily | 31
Bob | 26
----------
Your boss wants you to neatly line up the names and ages like so:
----------
Name | Age
----------
John | 56
Emily | 31
Bob | 26
----------
Note that no...
CMQ: Will this ever stop? m() Lets say m pushes the current millisecond on the stack and () Is a while loop and only loops if the top of the stack is truthy. (so 0.000 will stop the loop and the program will exit)
You have been hired by the American embassy in the UK to act as a translator. Being a programmer, you decide to write a program to do a bit of the work for you.
You've found out that often just doing the following things can satisfy Word's spellcheck, which has been set to "English (United States)"...
CMP: I have way too many projects and not enough time/motivation to do them all. I'm definitely going to continue work on RTO and my language ranking program, but I can't decide which to work on right now. Which one should I work on right now?
The main thing that will make RTO different from TIO will be the ability for people to submit their own languages
Along with other features that allow the site to continue to be updated regardless of how available I am to work on it
My main goal is to have the biggest library of languages possible, with the close secondary goals of having a very intuitive UI, and being usable and update-able without me being around
@BrowncatPrograms I vote for RTO because I think the current language-rating post is fine and we don't need a new one. Obviously you disagree, so take my opinion with however many grains of salt you like. :)
A meta-consideration that's been helpful to me sometimes: if you have one project that's close to completion, knocking that one out quickly will help with the "way too many projects" problem.
@BrowncatPrograms I also considered that for ATO but decided not to because 1) I think it will end up with a lot of cruft and duplicated languages and 2) it will require significant server-side storage
@pxeger You'll put the input in a box called "input", and it'll format it as args or STDIN so you don't need to think about which one the interpreter uses
@BrowncatPrograms it's probably possible to implement a more sophisticated system based on actual CPU time, so that running sleep 5 doesn't count (it only uses 0.001 seconds of CPU time despite taking 5 real seconds)
I find it very annoying tbh, especially given the other "equivalent" things: Try it online!
Jelly has it's own version of that (meaning weird string multiplication hacks): Try it online! (the outputs are "input", "input doubled", "length of the input doubled", "length of each element in the input doubled")
@cairdcoinheringaahing Yeah... I'm assuming it's a function (no pun intended) of the way Python does operator overloading, where int.__mul__(str) isn't defined, so it falls back to str.__rmul__(int). A language where operators are top-level functions instead of class member functions would theoretically not have that issue.
Okay I almost thought I lost all of my work on my partial pip answer last night, which was in a file with a bunch of other stuff I'd been working on, and I couldn't find it anywhere
Turns out I'd saved it to my chromebook's Linux Files partition by accident, and since that hadn't been booted up yet it didn't show up in recent :p
Take a sugar pill, turn up it's brightness without telling it if it's in the cafeteria. See if that changes it's behaviour. Then, take the Chromebook, also turn up the brightness without telling it if it's in the cafeteria, then measure performance :P
@BrowncatPrograms I think we'll need to fund at least 3 research projects to verify this, and maybe get a postgrad to write their PhD on their findings :P
C character constants.
I'm not sure if we had something like this before.
Given a value n between 1 and 65535 output the shortest possible c type character constant.
Examples:
65 -> 'A'
13 -> '\13'
17473 -> 'DA'
The character constants can only contain ASCII characters from 32 - 128.
