barrett/barrettruth.com
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

feat: run prettier on css

Browse source
This commit is contained in:
Barrett Ruth 2025-11-09 15:27:07 -05:00
parent 15a2355f05
commit 7989ba0033
2 changed files with 3 additions and 3 deletions
Download patch file Download diff file Expand all files Collapse all files

2
package.json
View file

@ -11,7 +11,7 @@
"check": "astro check"
},
"lint-staged": {
"*.{js,ts,jsx,tsx,astro,html,md,json,yml,yaml}": [
"*.{js,ts,jsx,tsx,astro,html,md,json,yml,yaml,css}": [
"prettier --write",
"astro check"
]

4
src/content/algorithms/proofs.mdx
View file

@ -65,8 +65,8 @@ Let $X$ and $Y$ be the number of occurrences of zeroes and ones in the substring
$$
\begin{align*}
\sum_{1\leq r\leq n}\sum_{1\leq l<r} f(s[l:r+1])&=\sum_{1\leq r\leq n}\sum_{1\leq l<r} \frac{X+Y+|X-Y|}{2}
&=\frac{1}{2}(\sum_{1\leq r\leq n}\sum_{1\leq l<r} X+Y+\sum_{1\leq r\leq n}\sum_{1\leq l<r} |X-Y|)
\sum_{1\leq r\leq n}\sum_{1\leq l<r} f(s[l:r+1]) &= \sum_{1\leq r\leq n}\sum_{1\leq l<r} \frac{X+Y+|X-Y|}{2} \\
&= \frac{1}{2}(\sum_{1\leq r\leq n}\sum_{1\leq l<r} X+Y+\sum_{1\leq r\leq n}\sum_{1\leq l<r} |X-Y|)
\end{align*}
$$