I'm really disappointed winterbash2018.stackexchange.com doesn't currently have some easter egg. (Or maybe I haven't looked hard enough... who wants to go through the minified JS with me? :P)
So this is my first challenge on this site.
What this challenge is is that you input a number, and your code spits out numbers which can be calculated as an exponent. The sum of the exponent and base in the number must equal the input.
The numbers must start from \$1^{n-1}\$ to \$(n)^0\$.
Examp...
I guess it comes down to which is greater: how much the title underspecifies the challenge, or how much more concise golfing languages are than English
Well what distribution are you taking the average over?
Distribution of questions entered, or distribution of all questions here? Because Jelly is often fairly long at tasks it's unsuited for, and Osabie is proabably worse in that regard
@lirtosiast I think I somewhat understand it now, the rows are the starting card, and the columns are the last card, and you get the new statistics of drawing a card by multiplying the matrices?
Consider a sequence of natural numbers in which N appears in N^2.
Output the nth element of this sequence.
Rules
Program takes only n as input and outputs just one number - N.
The sequence can be 0-indexed or 1-indexed.
Sequence: 1 5 6 10 25 50 60 76 100 250 376 500 600 625 760 ...
Squares: ...
@Cowsquack (for the Fibonacci case) Given a bitstring of length n-1, All of them can be turned into bitstrings of length n by adding a 0 to the front. The ones that start with a 0 can have a 1 added to the front. The number of bitstrings of length n who start with a 0 is the same as the number of bitstrings of length n-1.
I think the general case can be shown in the same way
@Anush Would the input be the PDF, or a bitmap of the equation? I haven't done extensive research on the subject, but I think the majority of our golfing languages don't have pdf support.
@maxb Re codegolf.stackexchange.com/questions/176685/… : PPCG is not really well-defined regarding huge input, so just make sure that the algorithm is not obviously cheating and works fine with small input is ok.
@user202729 I wasn't really satisfied with that answer. Usually you run into integer overflows for "big inputs", but since my code doesn't even handle all the test cases in practice (but in theory it does) it felt a bit like cheating. That's why I added the alternative answer which is more useful as a program.
Ah right gotcha, so for example in some arbitrary language Array + Object might append the object to the array, whilst Object + Array might not, so that would be non commutative?
English has a set of "phonemes", or sounds that are distinguished. These are usually transcribed in the International Phonetic Alphabet.
Your task is to check a text and see if it has only English phonemes, returning a boolean output like 0/1, Y/N, etc. The list of symbols, not including affrica...
@Pavel Android's autogenerated text responses are hilarious. Someone texted me the other day "So-and-so is resigning" and the responses were like "Great!", "Ok, thanks!", and "Awesome, haha!"
Ehhh. More like "They work Ok-ish about 50% of the time"
I think my biggest complaint with them is that generally all 3 choices effectively mean the same thing. It's like three different ways to say "yes" and never a way to say "no"
when I was interviewing for new jobs, I got an email asking if I would be available for a call at X time, and my options were "Yes I will be available", "That works for me" or "Sorry, that doesn't work for me"
which works pretty well
Also the auto-responses are one thing, we're talking about gmail's autocomplete system, which is much better because it handles common email phrases, rather than entire responses
Oh yeah, absolutely. It's a lot easier to predict that "Sounds g" --> "Sounds good to me." than parsing and understanding what a text is about and how I'd respond to it
Given integer n, output the smallest exponent e greater than 1 such that n^e contains n as a substring.
For example, for 25, the answer should be 2, as 25 ^ 2 = 625, which contains 25 as a substring, but the answer for 13 should be 10, as 13 ^ 10 = 137858491849, so 10 is the lowest exponent for ...
Challenge
Mark is a student who receives his N marks in a concatenated way in a one single line.
The challenge is to separate his marks, knowing that each mark can only be 0 or 1 or 2 or 3 or 4 or 5 or 6 or 7 or 8 or 9 or 10.
Input
N natural number and one line.
Output
A set of natural nu...
I wonder if in the future we'll ever see "Neuron-golf" challenges for creating simple machine learning neural nets to complete a challenge using the lowest number of neurons or something like that
So this is my first challenge on this site.
What this challenge is is that you input a number, and your code spits out numbers which can be calculated as an exponent. The sum of the exponent and base in the number must equal the input.
The numbers must start from \$1^{n-1}\$ to \$(n)^0\$.
Examp...
Consider a sequence of natural numbers in which N appears in N^2.
Output the nth element of this sequence.
Rules
Program takes only n as input and outputs just one number - N.
The sequence can be 0-indexed or 1-indexed.
Sequence: 1 5 6 10 25 50 60 76 100 250 376 500 600 625 760 ...
Squares: ...
Challenge
Mark is a student who receives his N marks in a concatenated way in a one single line.
The challenge is to separate his marks, knowing that each mark can only be 0 or 1 or 2 or 3 or 4 or 5 or 6 or 7 or 8 or 9 or 10.
Input
N natural number and one line.
Output
A set of natural nu...
Print this text:
_________
| |
| |
| |
|_________|
Shortest code wins. Notice the space at the start of the first line.
