mirror/ioccc
1
0 Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

Merge pull request #1922 from xexyl/carlini2020-dollar

Browse Source 
Remove \ from $ in code blocks in 2020/carlini

NOTE: This pull request was performed with
      an update index.html for 2020/carlini
This commit is contained in:
Landon Curt Noll authored and GitHub committed 2024-01-17 15:01:25 -08:00
2 parents f44b63bb9b 1aab58977e
commit 864bb7fd8e
2 files changed
+7 -7
Download Patch File Download Diff File Expand all files Collapse all files

No files matched your search

2020/carlini/README.md
+2 -2
View File
@@ -242,9 +242,9 @@ the following expression
where argument 1 is a pointer to a temporary variable followed by a NUL byte. where argument 1 is a pointer to a temporary variable followed by a NUL byte.
This works because if the current count is 0 mod 256, then `"%1$hhn"` will write This works because if the current count is 0 mod 256, then `"%1$hhn"` will write
zero to argument 1 and then "%1\$s" will never emit any text. If, on the other zero to argument 1 and then `"%1$s"` will never emit any text. If, on the other
hand, the count is not 0 mod 256, a length-1 string will be written to argument hand, the count is not 0 mod 256, a length-1 string will be written to argument
1, and then `"%1\$s"` will increment the count by one. By repeating this 256 1, and then `"%1$s"` will increment the count by one. By repeating this 256
times we're eventually going to reach 0 mod 256. times we're eventually going to reach 0 mod 256.
Checking if there has been an invalid move is achieved similarly. Checking if there has been an invalid move is achieved similarly.
2020/carlini/index.html
+5 -5
View File
@@ -267,11 +267,11 @@ configurations, for both players.</p>
<p>where argument 1 is a pointer to a temporary variable followed by a <p>where argument 1 is a pointer to a temporary variable followed by a
NUL byte.</p> NUL byte.</p>
<p>This works because if the current count is 0 mod 256, then <p>This works because if the current count is 0 mod 256, then
<code>"%1$hhn"</code> will write zero to argument 1 and then “%1$s” will <code>"%1$hhn"</code> will write zero to argument 1 and then
never emit any text. If, on the other hand, the count is not 0 mod 256, <code>"%1$s"</code> will never emit any text. If, on the other hand, the
a length-1 string will be written to argument 1, and then count is not 0 mod 256, a length-1 string will be written to argument 1,
<code>"%1\$s"</code> will increment the count by one. By repeating this and then <code>"%1$s"</code> will increment the count by one. By
256 times we’re eventually going to reach 0 mod 256.</p> repeating this 256 times we’re eventually going to reach 0 mod 256.</p>
<p>Checking if there has been an invalid move is achieved similarly.</p> <p>Checking if there has been an invalid move is achieved similarly.</p>
<p>In order to decide what to print out, we have to cast the “in-memory” <p>In order to decide what to print out, we have to cast the “in-memory”
array of bits to Xs and Os to print out. This is actually rather array of bits to Xs and Os to print out. This is actually rather