Activity for m90
| Type | On... | Excerpt | Status | Date |
|---|---|---|---|---|
| Edit | Post #287134 |
Post edited: Correction in explanation |
— | about 1 year ago |
| Edit | Post #287134 | Initial revision | — | over 1 year ago |
| Answer | — |
A: 8 coexisting queens 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! – Try It Online") Following the standard calling convention for Unix-like systems (from the System V AMD64 ABI), this takes in RDI a memory address at which to place ... (more) |
— | over 1 year ago |
| Edit | Post #287111 | Initial revision | — | over 1 year ago |
| Answer | — |
A: 8 coexisting queens JavaScript, 48 bytes =>[..."41506372"].map(x=>1e8/9+10x|0).join` ` Try it online! The string `"41506372"` encodes the position of the queen in each row. `1e8/9` gives 11111111.1111..., and adding 10x changes a digit from 1 to 2 at position `x`. The bitwise operation is... (more) |
— | over 1 year ago |
| Edit | Post #286953 | Initial revision | — | over 1 year ago |
| Answer | — |
A: Find n Niven Numbers x86-64 machine code, 36 bytes 31 C0 8D 48 0A FF C0 50 99 89 17 48 F7 F1 01 17 99 85 C0 75 F6 58 50 F7 37 58 85 D2 75 E7 AB FF CE 75 E2 C3 Try it online! – Try It Online") Following the standard calling convention for Unix-like systems (from the System V AMD64 ABI), this takes in RDI an addre... (more) |
— | over 1 year ago |
| Edit | Post #285882 | Initial revision | — | about 2 years ago |
| Answer | — |
A: Can you give me half? [Python 3], 7 distinct characters, 11 bytes True/-True Try it online! (more) |
— | about 2 years ago |
| Edit | Post #285833 | Initial revision | — | about 2 years ago |
| Answer | — |
A: Keyword golfing [Python 3.7], 231 bytes class C:pass def g(): async def f():return;yield;await[3for()in()];nonlocal f if None: with lambda:3or 7and 8as q:del x elif False:raise else:assert 1is not 5 try:from x import except:global a finally:9 while True:... (more) |
— | about 2 years ago |
| Comment | Post #285273 |
Improvement: `i&1?4:3` can be changed to `i%2+3`. (more) |
— | over 2 years ago |
| Edit | Post #285296 | Initial revision | — | over 2 years ago |
| Answer | — |
A: Find the IP address class JavaScript, 43 bytes s=>"ABCDE"[Math.log2(s.slice(0,3)^255|8)^7] Try it online! Taking the first 3 characters of the string is always enough to include the first octet, while including at most one full stop. Before the bitwise XOR, the substring is converted to a Number (if a full... (more) |
— | over 2 years ago |
| Comment | Post #284952 |
Improvement: `for(--s?s+=5-p:0;s-=!*t++;);` (more) |
— | over 2 years ago |
| Comment | Post #284522 |
83, using a different way of specifying the operators and comparison chaining: `lambda a,b,c:[p for p in[*"+-*%","//","**"]if('%'<p<'.')>-b<=c==eval(f"{a}{p}{b}")]`
80, similar, producing slightly different output, which I think is allowed, but it's not completely clear: `lambda a,b,c:[p for p in[... (more) |
— | over 2 years ago |
| Edit | Post #283354 | Initial revision | — | over 2 years ago |
| Answer | — |
A: Word Set Square JavaScript, 102 bytes s=>[...x=s.split``].concat(x.reverse()).reduce((l,c,i,a)=>l+` `+(a[i+1]?c+' '.repeat(i-1)+c:a.join``)) The first part creates the 'mirrored' string in an array. `reduce` starts with the first element (which conveniently handles the top vertex of the triangle) and ... (more) |
— | over 2 years ago |
| Comment | Post #283342 |
Improvement: remove `j=1` (leaving the starting value of 0) and replace `i+=j` with `i-=~j`. (more) |
— | over 2 years ago |
| Edit | Post #283308 | Initial revision | — | over 2 years ago |
| Answer | — |
A: Are All Elements Equal? [Python 3], 20 bytes lambda l:len({l})<2 Try it online! (more) |
— | over 2 years ago |
| Comment | Post #283171 |
[Cracked -- Jelly](https://codegolf.codidact.com/posts/283187#answer-283187) (more) |
— | over 2 years ago |
| Edit | Post #283187 | Initial revision | — | over 2 years ago |
| Answer | — |
A: Guess the language! (Robbers' Thread) Cracks Shaggy's answer: Jelly “¿×⁶ṆḶN{N=ȷṾ» Try it online! (more) |
— | over 2 years ago |