Search
x86-64 machine code, 32 bytes A4 FF CA 6A 06 58 F6 F2 50 3C 03 59 51 74 08 AC F3 AA FF CA 75 F5 F3 66 AD 66 F3 AB 58 B0 07 C3 Try it online! Following the standard calling convention for Unix-...
Consider a type of hexadecimal colour code that supports shorthand for both greyscale and colour: A 6 digit code is interpreted as 2 digits for red, followed by 2 for green, then 2 for blue. A ...
Japt, 12 bytes Outputs an empty array if no solution is possible. Íà5 â fÈx ¶V Try it Íà5 â fÈx ¶V :Implicit input of array U & target integer V Í :Sort U à5 ...
Vyxal, 24 bytes 16ʀẋfÞ×'ẏ16$e*∑?=;hṘk6i∑ Try it Online! All this when just H, 16R, or even k6τ would have sufficed. Times out for every input > 100 Explained 16ʀẋfÞ×'ẏ16$e*∑?=;hṘk6i∑...
Python 3, 48 bytes def f(n,d):return f"[{(50*n+d//2)//d*'|':-<50}]" Try it online!
Some additional cosiderations on using the sandbox: First, a migration mechanism might encourage good behaviour, for example by migration being only possible if the post has a minimal score, and/o...
C (gcc), 88 bytes char a[53]={91},*p=a+1,i;f(n,d){for(;i<50;)p[i++]=1.*n/d<=i/50.?45:124;p[i]=93;puts(a);} Try it online! There's two approaches to this in C that I came up with - eith...
Does a positive integer have a substring as a factor? Input A positive integer. Output One of 2 distinct values to indicate whether the input has a factor that is a strict substring of it...
BQN, 29 28 bytes (⍉≍""){⍉⌽𝕩∾˘𝕨⥊˜⋈˜≠𝕩}´⟜⌽'@'+↕ Try it here! Explanation: (⍉≍""){⍉⌽𝕩∾˘𝕨⥊˜⋈˜≠𝕩}´⟜⌽'@'+↕ # a function taking a single argument ⍉≍"" # a 0-by-1 matrix (...
BQN, 37 bytes ⍉∘⌽∘∾˜´(⍉{1⊸⌈⊸⋈⊑+`∘⌽⍟𝕩↕2}⥊'@'⊸+)¨∘⌽∘↕ -3 thanks to dzaima The output isn't the same as the example but I think it's still correct if I understand the challenge correctly. Result...
This is already a category-level setting. An admin can change it to whatever y'all want it to be. I assume this would be for both the sandbox and the challenges category?
Vyxal, 46 bitsv2, 5.75 (6) bytes ɾ6*1p¦c Try it Online! Bitstring: 0010000001011001000111011010010100001111001000 Link is to test suite. Should execute up to 870 or so. Try it without the ...
The title of a Codidact question has a minimum length of 15 characters. For a question this is generally fine, as the title will be a summary of the question in the form of a single sentence. Howe...
Python 3.8+, 577 bytes (was 634 than 591 bytes before) V="eéiíaáoóuúEÉIÍAÁOÓUÚ" r={"mé":("mo",0),"tú":("do",0),"sí":("a",1),"sé":("a",0),"muid":("ár",2),"sibh":("bhur",2),"siad":("a",2)} s=la...
Python, 220 bytes Works with Python 3.8 or newer. n=" IVXLCDM" x=("".join([n[(d:=ord(c)-32)//8]+n[d-8*(d//8)]for c in'&PW!H.!@/$HF$@G"H6"@7"03#P?%N%O%U%]%^%_&N&O!*!+!1!=!9!<!:!;...
Also posted here on CodeGolf.SE Brief introduction to Emmental: Emmental is a self-modifying programming language defined by a meta-circular interpreter. It is a stack based language, but also ...
Python, 104 bytes f=lambda n:"1.0000000.7272730.7285710.7368420.7437890.7491640.7533440.7566570.7593360.761542"[8*n-8:8*n] Try it online! Not too clever. I am curious whether it can be beaten ...
x86-64 machine code, 27 bytes 6A D7 58 99 B1 10 48 D3 C0 48 AB C6 07 0A AE 80 C1 48 73 F2 FF C2 74 EC 88 37 C3 Try it online! Following the standard calling convention for Unix-like systems (f...
Japt -R, 16 15 bytes Uses spaces for #s and "s for Qs. ##Ë64ì £QùXÄÃy Test it (footer reformats the output to use the characters from the spec) This one uses 1s for #s. ##Ë64ì £#ÿ¤hXQ ...
Sclipting, (UTF-16) 86 bytes 標갠 관上가①要❶❹剩걉눑감⓶重右갰雙⓷加⓶❸分終⓷棄終并❶訂乾⓶折❷同終長괐縮⒈棄丟 Explanation: Input n 標 갠 관上 for b from 2 to 16 가 s = 0 ① n' = n 要 while n' is not 0 ❶❹剩 x = n...
Addressing only the technical (platform) issues, and not community culture: We need to make pending edits more visible in two ways. As you said, you have to go to each category to see what's wait...
JavaScript (Node.js), 146 bytes f=(a,c=n=~(b=d=[],e=x=>x&&(c>191|d>2?b.push(d+192,c):b.push(...d+n?[c,c]:[c]),c=n,d=0)))=>(a.map(b=>c^n?c=(e(d>62|b-c),d++,b):(c=b,d=1))...
JavaScript (Node.js), 101 82 bytes -19 bytes thanks to Shaggy! x=>x.replace(/(..)\1{0,62}/g,(c,g)=>c>'c'||c[5]?(192+c.length/2).toString(16)+g:c) Try it online! Everything can be sol...
