Skip to main content
6 votes

Non-Decreasing Fibonacci Sequence modulo M

C (gcc), ~3.7ms ...
emanresu A's user avatar
  • 39.2k
5 votes

Non-Decreasing Fibonacci Sequence modulo M

Node.js 20.10.0, ~1.5 sec. ...
Arnauld's user avatar
  • 194k
2 votes

Flipping pancakes

R, 79 bytes \(v)for(j in sum(v|1):2){v[1:w]=v[(w=which.max(v)):1];v=rev(v[-1]);cat(w,j,"")} Attempt This Online! A function that takes in an unsorted ...
int 21h Glory to Ukraine's user avatar
2 votes

Sum It Up with a Digital Triangle

R, 75 74 bytes -1 byte thanks to pajonk `?`=\(x,n=j)if(j<-sum(x|1)){cat(strrep(" ",n-j),x%%10,"\n");x[-j]+x[-1]?n} Attempt This Online! A ...
int 21h Glory to Ukraine's user avatar
1 vote

Flipping pancakes

JavaScript (Node.js), 72 bytes f=x=>(i=1,k=x.find(c=>c>x[i++]))?[i,2,i--,...f(x,x[i-1]=x[i],x[i]=k)]:[] Try it online! Bubble sort Not directly ...
l4m2's user avatar
  • 25.1k
1 vote

It was just a bug

Regenerate, 66 bytes (((${($3+1)%10}!1)( {#5*#1/10}! {#1/10-2}!({#1} )! {8})){10} ){17} Attempt This Online! Explanation The output consists of 17 lines, each of ...
DLosc's user avatar
  • 40k
1 vote

Sum It Up with a Digital Triangle

K (ngn/k), 42 bytes {`0:({x#" "}'!#x),'{" "/$x}'-1_{1_+':x}\x} Try it online!
Ashy's user avatar
  • 51
1 vote

Sum It Up with a Digital Triangle

Uiua, 29 bytes ∧(◿10≡/+◫2&p⊂↯:@ ⊙⊸/$"_ _")°⊏ Try it ...
noodle person's user avatar

Only top scored, non community-wiki answers of a minimum length are eligible