Search Results

Desmos, 19 bytes f(m,c,v)=[1...v]m+c Try It On Desmos! What better way to solve a "graphing" calculator problem... than to literally use a graphing calculator! …

Desmos, 57 bytes f(1)=1 f(n)=max(1,∑_{d=2}^{n^½}0^{mod(n,d)}f(d)f(n/d)) Uses the given formula. Try It On Desmos! Try It On Desmos! … - Prettified It's really annoying that I have to define a base case f(1)=1 because otherwise Desmos would complain that I don't have a base case for my recursive function, even though f(1) is literally …

Desmos, 81 67 bytes -14 bytes thanks to @emanresu A due to the fact that I didn't realize that it was always guaranteed to be exactly 3 numerical inputs. … Try It On Desmos! Try It On Desmos! - Prettified …

Desmos, 26 bytes f(L)=U[U.count] U=L.unique Try It On Desmos! Try It On Desmos! - Prettified …

Desmos, 14 bytes f(l)=l^l.total Try It On Desmos! Try It On Desmos! - Prettified …

Desmos, 44 42 bytes f(L,N,K)=[L[i-K+1...i].medianfori=[K...N]] Try It On Desmos! Try It On Desmos! - Prettified …

Desmos, 41 bytes I=[2...5] f(n)=\{n>1:\min(f(n/I)+I+1),0\} Port of @xnor's Python 3 answer so make sure to upvote that answer too! Try It On Desmos! Try It On Desmos! - Prettified …

Desmos, 43 bytes f(n)=g(n,1) g(n,k)=\{n<0:0,g(n-1/k,k+1)+1\} Port of xnor's Python answer. Try It On Desmos! Try It On Desmos! - Prettified …

Desmos, 109 bytes a=A.length b=B.length i=[2...2max(a,b+1)] k=floor(i/2)-1 f(A,B)=\{\mod(i,2)=0:A[\mod(k,a)+1],B[\mod(k,b)+1]\} Try It On Desmos! Try It On Desmos! …

Try It On Desmos! Try It On Desmos! - Prettified Second ever Desmos answer using recursion!!! … I am still gushing over the fact that Desmos actually added recursion; it's now turing complete and that opens the door for so many challenges that Desmos previously couldn't solve. …

Desmos, 102 101 bytes -1 bytes thanks to @fireflame241!!! … Try It On Desmos! Try It On Desmos! - Prettified WOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOOO DESMOS RECURSION IS OUT OMFG!!!!!!!!! …

Desmos, 102 bytes f(n,k)=∑_{a=0}^{n^n/n-1}0^{[(B[B<i].count-i)^2fori=B].max} B=mod(floor((na+(k-1)n^n)/n^{[1...n]}),n) Try It On Desmos! Try It On Desmos! …

Desmos, 61 bytes f(n)=4\sum_{a=0}^n\sum_{b=1}^n0^{\gcd(a,b)-1}\{aa+bb<=nn,0\} Try It On Desmos! Try It On Desmos! …

Desmos, 29 28 bytes -1 bytes thanks to @Neil f(a,b,c)=\{a<=b:b,b>c:a,c\} Literally just the piecewise function given in the challenge description. Try It On Desmos! Try It On Desmos! - Prettified …

Desmos, 19 bytes f(a,b,c)=c(a+c)/b-b Try It On Desmos! Port of dingledooper's Python 3 solution, so make sure to upvote that one too! …