# Tag Info

Accepted

### Dennis, Doorknob, Martin Büttner, Chris Jester-Young - Pizzeria!

CJam, 20 bytes q~1$*4/"CEDM"e*/:$N* I think this should work :) Try it online Explanation: This first makes a pizza labeled CC…EE…DD…MM… from left to right ...

### Enumerate rhyme schemes

Python 2, 153 ...

### Generate all Sublist Partitions

Retina, 27 19 bytes Byte count assumes ISO 8859-1 encoding. +1%, ;$'¶$];[ ; , Try it online! Explanation Of course this computes all partitions using string ...

### Partition a square grid into parts of equal area

JavaScript (ES7), 166 bytes Outputs a matrix of integers that describe the partition, or $false$ if there's no solution. ...

### Partial factorisations of a positive integer

Haskell, 56 bytes _!1=[[]] i!n=[j:f|j<-[i..n],mod n j<1,f<-j!div n j] (2!) (2!)(1338557220::Int) prints in five ...

### Count occurences of a set in a list

Python, 30 bytes lambda s,l:min(map(l.count,s)) Try it online!

### Enumerate rhyme schemes

Haskell (GHC 7.10), 150 bytes ...

### Third Stirling numbers of the second kind

Jelly, 6 bytes 3Ḋ*)SI Try it online! -1 byte thanks to Jonathan Allan 1-indexed sequence without leading zeros. Uses the formula $\sum_{k=1}^{n} 3^k - 2^k$. ...
Accepted

### Sorted Lexical Partition of a Number

Pyth, 34 FNyUz#aYmv:zhdedC,+0N+NlzB)efqSTTY Try it online here. Notice, this has a time (and space) complexity of O(n). Therefore the test case ...

### Third Stirling numbers of the second kind

Jelly, 7 bytes cþæ*2FS Try it online! Now that xigoi has outgolfed me, I thought I'd share my answer. This outputs the $n$ term of the sequence without leading ...

### There's more than one way to skin a set

BQN, 15 bytesSBCS (1=⊒)⊸/·⥊(∾∾+)˝ Run online! BQN, 19 bytesSBCS (1=⊒)⊸/<+´∘×¨⟜⥊⟜↕2¨ Run online! ...

### Divisible subset sums

JavaScript (ES6), 40 bytes Expects (k)(n). k=>g=(n,s=0)=>n--?g(n,s)+g(n,s-~n):s%k<1 Try it online! Commented ...

### Divisible subset sums

Python 3, 54 bytes f=lambda n,k,r=0:n and f(n-1,k,r)+f(n-1,k,r-n)or r%k<1 Try it online!