I'm thinking of posting the below two challenges, but fear that they are too close to Convert to and from the factorial number system. However, mine do not involve detection of conversion direction, but do involve larger numbers by using letters. Please comment or vote to indicate if I should pos...
,,,, 5 bytes
:↔b%¬
Gah, it took me way too long to implement base conversion.
Explanation
Take input 10, 27 for example.
:↔b%¬
input reversed by command line args [10, 27]
: duplicate [10, 27, 27]
↔ reverse the stack ...
@Christopher As tricho rightly pointed out, no matter what ints you passed me, theoretically there exists some generator with which the next number in the sequence is 1, therefore 1 is always a correct answer
There was a challenge up a while ago about multiplying strings. It showed us how we can multiply not only numbers, but also strings. However, we still can't multiply a number and a string properly. There has been one attempt, to do so but this is obviously wrong. We need to fix that!
Your Ta...
Look at the "Introduced in" date on the doc page you linked, and at the last commit date on the project I linked (which actually was last modified about 5 years before that...)
@NewMainPosts At first I was super excited to do this in V and brain-flak, but then I wrote it in V and it's the worst answer I've ever written and I started doing it in brain-flak and I realized it's nearly impossible. Ugh
Given a positive integer n (Example: n=1234444999)
Separate into consecutive digit runs:
[1, 2, 3, 4444, 999]
Take the digital product of each run.
[1, 2, 3, 4*4*4*4, 9*9*9] = [1, 2, 3, 256, 729]
Sum it...
991
Repeat until this converges to a single number:
1234444999
991
82
10
1
Re...
Write the shortest parser for the grammar:
M -> M + n | n
Output must be some representation of a structured value representing the concrete syntax tree produced by the input n+n+n.
The code to produce the textual output from the structured value is not necessary.
The code to read/validate in...
@Downgoat many linux distros use python for a lot of commands, it's a very bad idea to change the default python version from 2.x to 3.x on those distros
Scale my ASCII-Art
Given an input string s and a number n, scale the ASCII art s by a quantity of n.
Examples
Input:
##
$$
2
Output:
####
####
$$$$
$$$$
Input:
#
#
#
#
#
#
#
#
#
#
2
Output:
##
##
##
##
##
##
##
##
...
@Downgoat I've actually been working on a language where most of the syntax is just combining diacretic marks. Will still take some time to develop fully, but eventually we'll be able to program in ry'leh
So, I've been personally noticing that the difficulty of our average challenge has seemed to progress higher and higher as I've been a member. No longer do we see alphabet challenges, nor as many OEIS challenges. I have a question for the community in regards to this progression; is this a good t...
for example in the beginning you mostly just learn the foundations like how atoms chain together and how quicks kinda work (you look more at that in lvls 1-2 I think)
obviously you use syntax stuff throughout but that's easier to understand
then lvl 3 is like more complex stuff, using more quicks
I realized a bug in my session code for a-ta.co that kept sessions that weren't logged in active forever rather than for an hour like they were supposed to.
I expected +undefined to cast to 0, but apparently it just casts to NaN