|
You are here |
jiggerwit.wordpress.com | ||
| | | | |
susam.net
|
|
| | | | | A tiny, stack-based, postfix canvas colouring language. | |
| | | | |
www.tartley.com
|
|
| | | | | I've been doing some programming tests and puzzles while job hunting lately. One quick challenge was quite nice, reminding me a bit of Project Euler questions, and I nerd sniped myself into doing a 2n | |
| | | | |
thehousecarpenter.wordpress.com
|
|
| | | | | Given two integers $latex n$ and $latex k$, where $latex k$ is non-negative, an ordered $latex k$-partition of $latex n$ is a $latex k$-tuple $latex (m_1, \dotsc, m_k)$ of positive integers such that $latex \displaystyle m_1 + \dotsb + m_k = n. $ For example, the ordered 3-partitions of 5 are $latex (1, 1, 3)$,... | |
| | | | |
chava61photography.photo.blog
|
|
| | | Visit the post for more. | ||