@user You'd have to ask the radio DJ. I don't think the maintenance guy picked the radio station just because they were playing Astley. It might've been a station that played stuff from that era, though.
I was discussing this on CHQ or TL (can't remember which) and... our conclusion was pretty much it might be for SEO, and more likely they get paid to post it here and it doesn't matter to them if it works or not as long as they've posted it so they get paid.
but i don't think it automaticaly suspends you immediately
they don't use the same account anyway and i destroy them anyway. i've destroyed close to 30 accounts within the past few days cuz i decided to clean up some profile spam while i had not much better to do
enough times will probably auto suspend, but even then, i'm not sure if it actually will, or if it's up to a mod to decide to do that
or at the very least, use secrets.token_hex and don't plonk (even sanitised) user input in an os.system call
@hyper-neutrino Resource limits with cgroups, sandboxing with Bubblewrap, and timeout using wrapper.c (a modified GNU coreutils timeout). Read the architecture docs for a bit more detail
Given a number 10000=>n >= 2, output all the positive integers less than n where gcd(x, n) == 1 (with x being any one of the output numbers). Numbers of this sort are coprime to each other.
Example: 10 gives the output [1, 3, 7, 9] (in any form you like, as long as the numbers are unambiguously ...
@NewMainPosts I just got outgolfed by my past self, I thought this was a nice little challenge, started working on it, it got closed as a dupe and I realized I already had a better anwer in that one.
If we assume there's a function md5 that returns the hexadecimal representation, it'd be d=>(z=md5(d).match(/^0*./)).length*4-(Math.log2("0x"+z)|0) in JS
K is a proprietary array processing programming language developed by Arthur Whitney and commercialized by Kx Systems. The language serves as the foundation for kdb+, an in-memory, column-based database, and other related financial products. The language, originally developed in 1993, is a variant of APL and contains elements of Scheme. Advocates of the language emphasize its speed, facility in handling arrays, and expressive syntax.
== History ==
Before developing K, Arthur Whitney had worked extensively with APL, first at I. P. Sharp Associates alongside Ken Iverson and Roger Hui, and later at...
Your challenge is to output the MD5 hash of your input. The specification of MD5 can be found here. Crypto builtins are NOT allowed. Shortest code wins. Psuedocode:
//Note: All variables are unsigned 32 bit and wrap modulo 2^32 when calculating
var int[64] s, K
//s specifies the per-round shift...
@rak1507 "hey man, I want to watch a film" "Sure, let me just buy a movie studio, fund it, cast it and edit it" "Why not just... open Netflix?" "Oh, you banned builtins so ¯\_(ツ)_/¯"
If you have to ban builtins to make your challenge interesting, your challenge is boring
barring languages with exceptionally silly functionalities, picking some common built-in function and saying "just implement it" isn't an interesting challenge even if non-trivial for languages without that built-in
then again, i'm not good with challenge-writing so don't really take my opinion on what challenges are interesting all that seriously. i just solve challenges i feel like doing :p
with the proliferation of specialized golfing languages, golfing has become boring. there are more languages than users. the answers are siloed and mostly not competing against each other. i think we need cross-language criteria to decide which answer is better.
CMC: Given an array A (where each element is either an integer or a similar list) and an integer n, replace all integers in A with n. [[-1, [2, 3]], 4, [0, [6, [7, [8, 19]]]]], 5 -> [[5, [5, 5]], 5, [5, [5, [5, [5, 5]]]]]
@RedwolfPrograms How about this one: CMC: Given an array A, where each element is either an integer or a similar array, and a flat list of integers L, replace the integer elements of A with the elements of L: A = [[-1, [2, 3]], 4, [0, [6, [7, [8, 19]]]]], L = [1, 2, 3] -> [[1, [2, 3]], 1, [2, [3, [1, [2, 3]]]]]. If the number of elements of L does not divide the number of integers in A, only repeat the specific number of elements of L required:
That's going to be complicated, I guess the easiest solution would be to make a really long list of [1, 2, 3, 4, 1, 2, 3, 4, ...], push it all to the stack, then recursively vectorize pop over the array
@cairdcoinheringaahing Some are related (like * and ⍣), but they are not diacritics according to some grammatical system that lets you deduce meaning, as in e.g. Hebrew and Arabic.
In fact, it is more like the ¨ ties together related built-ins, with the rest of the glyph being the specific part.
Not sure, probably mostly ones like xor that are commonly used for crypto algos, but I don't know enough about MD5 specifically to know which ones would be most appropriate
... if using a regex replacement on the string representation of the array is acceptable.
If it has to take a list as argument, then the same code still works, but you have to wrap it in a function because Pip full programs don't have a way to input lists. 7 bytes: {aRXIb}
It's an invalid submission; usually my policy is to wait for a day or two to allow the user to fix their own submission, so I'd just skip it and leave it in the queue. If it's been a few days since my comment and they haven't addressed it then you can VTD it though I'll probably delete it by then.
I'd suggest kicking them, but you can't kick suspended users :/
@WheatWizard Forgive my ignorance, but how can something be "infinite time" but still halt in a finite number of steps? I tried reading the intro to the arxiv paper but it didn't really explain too well
From what I can remember from cardinal numbers, omega is the smallest "infinite" number. You can then keep "counting up" from omega to "omega+omega" or 2omega, and so on until omega^2 and eventually omega^omega and higher