« first day (5104 days earlier)      last day (34 days later) » 

noodle person
noodle person
00:57
@SandboxPosts Any feedback on this challenge would be appreciated, mostly to see if it's a duplicate or if there's an edge case/IO annoyance that I didn't account for
Ginger
Ginger
lgtm
but admittedly I only gave it a cursory glance :p
 
2 hours later…
Unrelated String
Unrelated String
03:05
@noodleperson Feels like there could be a dupe of the pile spread shuffling but definitely not combined with the over-under recombination
noodle person
noodle person
03:20
@UnrelatedString Yeah, that's what I thought too
Not sure if that's a good thing or not... I mean, I'm sure there's some golf optimization to do both at once
Unrelated String
Unrelated String
yeah, it feels like it's kind of on the border of being potential-chameleon two things glued together, but it feels like there should be something more to that combination than just one thing then another
(but then again, the last time I thought that it took me the better part of a week to find a language where completely gluing them together loses to a more synthesized approach after giving up on figuring out a way to math it out that makes them actually go together)
(sorry for how much I've been editing that btw ;_;)
noodle person
noodle person
03:53
Do you think it would be okay to post as is, though? Or that it would benefit from trimming some part?
Unrelated String
Unrelated String
No idea tbh
noodle person
noodle person
04:25
I think it is shorter to combine the steps partially in Uiua
pretty sure
 
9 hours later…
New Posts
New Posts
13:23
0
Q: Meandering over ZZ

Sophia AntipolisThe easiest way to understand this task is to look at this graph, which you can change interactively. It defines a sequence n -> a(n) like this: a(0) = 0; thereafter a(n) is the least integer (in absolute value) not yet in the sequence such that the absolute difference of a(n-1) and a(n) is a sq...

code-golf sequence combinatorics permutations
 
4 hours later…
noodle person
noodle person
17:23
@ATaco Pretty sure Trilangle counts
Yeah definitely does
 
2 hours later…
New Posts
New Posts
19:23
0
Q: How many chains?

Wheat WizardGiven a positive integer \$n\$, a partition of \$n\$ is a ascending sequence of numbers that sum to \$n\$. Given two partitions \$a\$ and \$b\$, \$a\$ is a refinement of \$b\$ iff \$b\$ can be created by combining elements of \$a\$. (The elements do not need to be adjacent.) For example 1+2+3+4+7...

code-golf sequence combinatorics integer-partitions
 
1 hour later…
Rosario
Rosario
20:43
in C int *a,*b; than *a+*b==(*a)+(*b) or *a+*b==(*a+(*b))
Rosario
Rosario
21:30
in C int *a,*b; than *a+*b==(*a)+(*b) or *a+*b==*(a+(*b))
Unrelated String
Unrelated String
22:00
the former
It would be pretty bizarre if it parsed like the latter since you can just do a[*b] for that
and unary operators in general usually like binding pretty tightly
 
2 hours later…
emanresu A
emanresu A
23:59
→ 1 message moved to The Nineteenth Bakery
→ 1 missing objective winning criterion moved to The Nineteenth Bakery

« first day (5104 days earlier)      last day (34 days later) »