I have a question idea, but decent chance it's a dup even though I can't find it searching. Hoping someone here knows. Idea is this: Input is a list of code golf scores, output is each score's overall ranking. Ties receive the same rank, but consume ranks below them. So if you had scores 5 5 5 6 6 7, the ranks would be 1 1 1 4 4 6.
@lyxal I don't care about mobile support because I'mma make up for it by designing a programming language which is designed specifically with mobile users in mind
Everything will be designed with things like autocorrect, the additional annoyance that's required to add non-alpha characters, the space-space-to-add-a-dot shortcut, etc. in mind
And since the iPhone keyboard and, IIRC, the Android one have some non-ASCII characters within easy reach, I'll make those meaningful
It'll probably be a while before I get around to it though, since I've got like half a dozen other projects which are currently higher priority (e.g., getting SOCK² up and running before school starts again)
@thejonymyster First, say that you are interested and then say that your communications aren't "secure" enough and you should use a secret code - replace some of the words witt stuff like "Juice" or "Canada"
Fibonacci word fractal
code-golf fibonacci fractal ascii-art graphical-output
This is a only draft. I'm not sure what this challenge should be like.
The Fibonacci word is a sequence of binary strings defined as:
\$F_0 = \$ 0
\$F_1 = \$ 01
\$F_n = F_{n-1} F_{n-2}\$
The first few Fibonacci words...
A better Hexagony template code-golf ascii-art hexagonal-grid
We once made a Hexagony template without actually knowing it. But after a bit of experience with Hexagony, it becomes apparent that it is not enough; sometimes the source code is too short for the given hexagon, and you get totally une...
Anti-divisors of a number code-golf math number-theory
Given a positive integer n, output its anti-divisors.
From A006272:
Anti-divisors are the numbers that do not divide a number by the largest possible margin. E.g. 20 has anti-divisors 3, 8 and 13. An alternative name for anti-divisor is unbi...
When to give up and start again
Consider the following setup. A random integer \$x \in \{1 \dots 10\}\$ is chosen. Now \$x\$ real number points are chosen between 0 and 1. You want to find out if there are 10 points that have been chosen and if so, you win a prize.
In this game you can look in...
It's frustrating when you're on a system with X and you ctrl+alt+F2 to get into a TTY and nothing happens... It's hard to tell if it'll ever switch over and if it's worth waiting, or if it's deadlocked trying to find the memory.
Radiation Hardening Koth king-of-the-hill radiation-hardening
The goal of radiation hardening is to make a program still work after you remove a byte. However, what if a skilled competitor is purposefully trying to mess with you?
In this game, each bot will take turns removing one character from ...
@mousetail that'd make sense normally, but the original language was a stack based golfing language and the fork is a more verbose esolang with keywords and everything
Like it's really a completely different language now
> The program must take no input (however, reading from a file is allowed), and should not print anything to STDOUT. Output to a file is also forbidden.
@mousetail well really it depends on whether you require an infinite loop to use some sort of control structure, and whether you define looping as needing to repeat source code commands or just the interpreter looping forever internally
In most programming languages, arithmetic is written with infix notation -- i.e. the operator is put in between the operands -- e.g. 1+2. In contrast, with Polish notation (a.k.a prefix notation), the operator comes before the operands -- e.g. +1 2. As long as the number of operands for each oper...
Convert English to integer
code-golf
When saying a number out loud in English, or writing it out in words, speakers use a certain method.
Since there's lots of variations from person to person on the specific method, I'll define the format I'm using here:
[TODO]
Some things to note about the fo...
if you're going to use something that obviously isnt a programming language you'd think to at least use one that isnt 4x as long as the thing youre trying to output
Hey all. I'm sorry for disappearing on you and for taking bad care of TIO lately. I'll try to explain what's been happening, although it's not easy for me to talk about this...
Hidden from you, he chooses That is, there should be coins to boxes, from all possible assignments prove that, in fact, there are x=10 coins hidden in the boxes, the wizard
In this game, you can look When you do that, you can see
At any point, you can choose Of course, if you have looked in all the 9 boxes, and you still have not found 10 coins, you have no choice Sadly, you never get any money back, so your costs
Once you have chosen your strategy, you should run