the language has a 1D tape of values (initially all at 0), +- increment/decrement the current cell, >< move left and right on the tape, ., print and receive input as bytes and [] is a loop that executes as long the current cell is not 0
so ++++++[>++++++++<-]>. will increment the first cell 6 times, then loop, incrementing the second cell 8 times and decrement the first cell once (thus looping 6 times putting 48 in the second cell), and finally move to the second cell to print it
like, maybe if you were lazy and used it instead of printing as bytes, but that wouldn't work if you wanted to print multi-byte characters or just bytes above 128
but then some interpreters cycle through a finite tape, which means if you've filled the entire tape with 1, you'll be making all the 1s into 2s, 2s into 3s, and so on
add nine to current cell, start loop, print cell to the right and increment it, add ten to the next cell and print (i.e print a newline), clear that cell, go back to first cell and decrement it
@DialFrost i think the problem exists between keyboard and chair
@DialFrost you mostly have to figure out everything in terms of increment/decrement, as well as the concept of working destructively
max could be something like; while both cells are not zero, decrement each one and increment an output cell. then add the remaining cell to the output cell, and you have your maximum
@DialFrost the numbers here are the amount of instructions and the number of cells it uses
Length of Binary as Base 10 [OEIS A242347]
Computers like binary. Humans like base 10. Assuming users are humans, why not find the best of both worlds?
Your task is to find the first n terms in the sequence A008559 where each term is the binary representation of the previous number interpreted as...
Python string parsing has quite a few edge cases. This is a string:
"a"
Putting 2 strings immediately after each other implicitly concatenates them, so this is also a string:
"a""a"
However, if you put 3 quotes in a row, it will create a "triple quoted string" which can only be ended by another...
Announcement: Now that NPSP 2.0 is feature complete and seems to be working, it just needs to hang out in the sandbox to make sure it works, then it'll be moved back in here
I'm thinking if it doesn't go down over a sliding one week window it's solid enough
Given a radius R, output a text representation of a circle. Input A positive integer R (strictly greater than zero) You do not need to handle values of R great...
problem: Eric has requested we not call Advent of Code Golf by that name
> Please do not call your event something like "Advent of Code Golf"; this makes it look like an official Advent of Code event. "Advent of Code" is a registered trademark in the United States. You can call it something like "Code Golf Advent Calendar" or "Santa Golf" or "Christmas Code Golf" or "Code Golf December 2022".
1. "Fair use" has to do with copyright, not trademark 2. It has nothing to do with making things similar to existing things, just criticism of them 3. Even if it's legally possible, I doubt the guy's threatening to sue us, just politely asking us not to
Most AoC challenges would be bad on CGCC anyway, but even if they weren't, cross-posting challenges from elsewhere takes very little creativity or work and makes AoCG even less original
Not only does it get rid of lots of weird operator precedence issues and the ambiguity that makes the error messages when you use it in a non-async function super confusing, it's just a more straightforward and linear description of what you're doing. E.g., "run xyz, wait for the result, then do this thing with it".
Python string parsing has quite a few edge cases. This is a string:
"a"
Putting 2 strings immediately after each other implicitly concatenates them, so this is also a string:
"a""a"
However, if you put 3 quotes in a row, it will create a "triple quoted string" which can only be ended by another...
