Obviously it's not that simple since there are other factors (number of cores, architecture, cache size, AMD vs intel) but higher clock speed is always faster
In my group, we've been working with the understanding that you can wear a shield and fight with a two-handed weapon, the assumption being that you only get the +2 AC if you're actively wielding the shield with 1 hand. We're treating "wielding" a shield as different from "wearing" a shield. When ...
Draw a Bumpy String
code-golf ascii-art string
(Inspired by this challenge.)
Let's say we have a string ABBCBA. We can say that there is a rise between A and B, for B follows A; we can say that there is a run between B and B, for nothing changes; and finally we can say there is a fall between ...
@ConorO'Brien I would have expected the output to rise when it rises, fall when it falls and stay the same when it stays the same. For example: ABBCBA:
o
oo o
o o
Actually, I think that's a dupe of something helka did.
CMC/poll: what meta functional grouping seems useful to you? E.g., J has a "fork" functional grouping: fork(f,g,h) = (x,y) -> g(f(x,y),h(x,y)). Another one could be meta(f, g) = (x, y) -> f(g(x), g(y))
You must write a program or function that creates a "stair-ified" string. Here is how you "stair-ify" a string:
For each character in the string:
If the character is an upper or lowercase vowel, not including 'y', output it then move the rest of the string up a column.
If the character is a sp...
Write a program (or function) that takes in a non-empty string of any printable ASCII characters.
Print (or return) a zigzagging chain of the characters in the string with every neighboring pair of characters linked by:
/ if the first character occurs before the second character in normal ASCI...
@Downgoat e.g. the LSB of 11111110 is the 0 at the end, the LSB of 1001 is the second 1 at the end. The "location is bit 0" is probably just using a convention that numbers a bit based on which power of 2 it corresponds to.
halp in C++ do i declare a string and make every instance of a class to point to it, or is it equally performant to have the string in member initializer
I thought debugging Cheddar was difficult but I am trying to debug my Whiteout tape and this has turned out to be the most difficult thing I have ever done
Earlier this week, we learned about how to format esoteric languages for commenting. Today, we're going to do the inverse of that. I need you to write a program or function that parses some well-commented esoteric code and parses the comments out, returning just the code. Using some examples from...
@ASCII-only basically the tape should be like around the lip. but mine is like a giant huge strand of tape just leaking out and everything is borking and ugggghhhh
LabVIEW, 246.5KB
First we convert to lowercase, then to byte array. Trim off the first element of the byte array as it has no precedent. Then, for each element in the array, check if it's greater than the previous one (U8 char maps to ASCII as you expect) and store the result for the next iter...
@DJMcMayhem cheaper point is true, but wireless haedphones are also easy to cary. In terms of discreteness it annoys the hell out of me when people have earbuds coming out of their shirt
@Downgoat It's sometimes nice though. I like to have 2-3 earbuds that I can carry around and use when I don't really care about sound quality (like if I'm just goofing around, watching yt on my phone) or take on road trips, cause then I don't really have to care if they break or not.
Let's use augmented reality to hunt small creatures hidden in source-code. Write a quine program that outputs its own code source, except for 5 consecutive characters that will be modified and that will display a PCG-mon : (^_^)
The 5 consecutive characters can be positioned anywhere in the sour...
Vim, 33 keystrokes
qqqqqS<C-v>40<C-v>94<C-v>95<C-v>94<C-v>41q@q<esc>hh"qPq@q
Note that <C-v> means ctrl+v, and is byte 0x16 and <esc> is the escape character, and is byte 0x1B.
This just uses a slightly modified version of my Golf you a quine for great good! answer.
Outputs:
(^_^)S^V40^V94^...
Traceback (most recent call last):
File "filenamehere", line 53, in <module>
.string(' ==')
UnicodeEncodeError: 'ascii' codec can't encode characters in position 0-2: ordinal not in range(128)
it does this with any string I put in, regardless of the characters in it
@Dennis It's becoming a regular occurrence where I post a challenge, you post a competitive answer within ten minutes and the next thirty answers say "basically just a port of Dennis's answer". :P
I started looking at the cosmic call just prior to Aaron's revival of it... found a very interesting high level pattern... performed some stats, calculated the entropy, and discovered that if I write an ideal arithmetic compressor exploiting it, I could encode it in twice what he had
Unfortunately, this is not possible. Vim relies upon ASCII representations of keystrokes, so it can only map to keys that produce ASCII results. Here is every ctrl+key that you can map to, and the byte it represents.
Ctrl-@ 0x00 NUL
Ctrl-A to Ctrl-Z 0x01 to 0x1A...
It's \ by default, but you can map it to whatever you want. Basically, it's a way to make it easier to define your own mappings without worrying about overwriting other mappings
@ASCII-only The first is a crappy one that picked up for free a long time ago, and the second one is the "official" company computer they bought me (recently). So I own the first one, the company owns the second one. Problem is, I've been trying to switch over to the company one, but the older one has a project on it that the newer one doesn't like so I'm using both until I figure it out
In order to execute run, please complete the code below.
Conditions:
1.You must finish your code in one line.
2.You cannot use such words like 'main', 'run', 'asm', '#', '&', '*', '%', '/', '_', '(', ','.
3.You can only use one semicolon.
4.You cannot use more than 20 characters in your code...