all stats

kimapr's stats

guessed the most

namecorrect guessesgames togetherratio
seshoumara441.000
olive670.857
Palaiologos340.750
luatic9180.500
olus20009190.474
moshikoi490.444
LyricLy10240.417
theqwertiest250.400
Olivia4110.364
JJRubes260.333
Dolphy5150.333
essaie3110.273
taswelll3110.273
ponydork140.250
yeti140.250
soup girl140.250
chirk3130.231
Moja170.143
yui180.125
vspf040.000
razetime070.000
at040.000

were guessed the most by

namecorrect guessesgames togetherratio
olive670.857
luatic12180.667
Dolphy9160.562
vspf240.500
yui480.500
seshoumara240.500
Makefile_dot_in240.500
LyricLy12240.500
rrebeccca240.500
Olivia5110.455
razetime370.429
essaie4110.364
moshikoi390.333
Moja270.286
chirk3110.273
olus20005190.263
oleander140.250
theqwertiest150.200
taswelll2110.182
JJRubes160.167
ponydork040.000
yeti040.000
Palaiologos040.000
at040.000

entries

round #73

submitted at
0 likes

guesses
comments 0

post a comment


entry.php ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
<?php

ob_start(function($buffer) {
	fwrite(STDERR, $buffer);
}, 1);

if (!(
	file_exists(__DIR__.'/vendor/amphp/amp') &&
	file_exists(__DIR__.'/vendor/amphp/byte-stream') &&
	file_exists(__DIR__.'/vendor/amphp/websocket-client')))
{
	$composer_path = 'composer';

	system($composer_path." -qV", $result_code);

	if ($result_code) {
		$composer_path = __DIR__.'/composer';
		copy("https://getcomposer.org/download/latest-stable/composer.phar", $composer_path);
		chmod($composer_path, 0755);
	}

	system('cd '.__DIR__.'; '.$composer_path.' require '.implode(' ', [
		'amphp/websocket-client',
		'amphp/byte-stream',
		'amphp/amp'
	]));
}

require __DIR__.'/vendor/autoload.php';

use function \Amp\async;
use function \Amp\delay;
use function \Amp\Websocket\Client\connect;
use function \Amp\ByteStream\getStdin;
use \Amp\ByteStream\BufferedReader;

echo 'connecting -';

$conn = false;

$spin = 0;

async(function() {
	global $conn, $spin;

	while (!$conn) {
		$spin += 1;
		$spin %= 4;
		echo "\x08".['-','\\',"|",'/'][$spin];
		delay(0.1);
	}
});

$conn = connect('wss://codeguessing.gay/73/ws');
echo "\r            \r";

ob_end_flush();

async(function() {
	global $conn;

	foreach($conn as $msg) {
		$msg = $msg->buffer();
		$msg = json_decode($msg);

		switch($msg->reason) {

		case "connect":
			echo"*** ".$msg->name." joined the game. ***\n";
			break;

		case "disconnect":
			echo "*** ".$msg->name." left the game. ***\n";
			break;

		case "message":
			if (is_string($msg->content)) {
				echo "<".$msg->name."> ".$msg->content."\n";
				break;
			}

		default:
			echo json_encode($msg)."\n";
		}
	}
});

$io = new BufferedReader(getStdin());

while(1) {
	try {
		$x = $io->readUntil("\n");
	} catch (Exception $e) {
		break;
	}
	$conn->sendText(json_encode(["content" => $x]));
}

round #70

submitted at
3 likes

guesses
comments 0

post a comment


longjet.js Unicode text, UTF-8 text, with very long lines (418), with CRLF line terminators
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
(q=>(([x,y,z])=>y(`(require)=>{||${x}||}`)(z))(([(q=[
 "๐Ÿ ๐œฌ๐œฌ๐œฌ๐„ฒ๐Ÿ‚๐•ช๐•Œ๐Ÿ ๐ƒ˜๐‚บ๐œฟจ๐‚๐ƒถ๐‚๐œพŽ๐œปš๐œผ–๐‹–๐œปธ๐œผด๐„ฒ๐œพฌ๐พ๐‚บ๐œผด๐œผ–๐•ช๐•Œ๐‚บ๐œบผ๐„ฒ๐œฟจ๐Ÿ ๐ƒ˜๐‚บ๐œฟจ๐‚๐ƒถ๐‚๐œพŽ๐œปš๐œผ–๐‹–๐œปธ๐œผด๐„ฒ๐œพฌ๐พ๐‚บ๐œผด๐œผ–๐Ÿ‚๐Ÿ‚๐Ÿ ๐ข”๐‚บ๐œบผ๐„ฒ๐œฟจ๐Ÿ ๐‡ฆ๐œฌ๐œฌ๐œฌ๐ƒ˜๐‚บ๐œฟจ๐‚๐ƒถ๐‚๐œพŽ๐œปš๐œผ–๐‹–๐œปธ๐œผด๐„ฒ๐œพฌ๐พ๐‚บ๐œผด๐œผ–๐†ช๐œฌ๐œผด๐‚บ๐œบผ๐‚บ๐œผด๐œผ–๐‚บ๐Ÿ ๐Ÿ‚๐œฌ๐€ค๐œพŽ๐‚๐œพฌ๐Ÿ ๐Ÿพ๐Ÿพ๐Ÿ‚๐Ÿ‚๐œŽ๐œŽ๐Ÿ‚๐Ÿ‚๐Ÿ‚๐Ÿ‚๐Ÿ‚๐šด๐‚บ๐š–๐œฌ๐œŽ๐Ÿ‚๐Ÿ‚๐Ÿ ๐œปธ๐“ฒ๐œปธ๐œพฌ๐‚๐œพŽ๐Œฐ๐‚บ๐ƒ˜๐œพŽ๐ƒถ๐œฌ๐œบ€๐Š๐™š๐‚บ๐š–๐œฌ๐›’๐Ÿ ๐Ÿ ๐œผด๐œพŽ๐œพŽ๐œฟจ๐‚œ๐œฌ๐ ๐œปธ๐„ฒ๐ŽŠ๐•Œ๐•ช๐œบ€๐Ÿ ๐œฝฐ๐„ฒ๐œฟŠ๐œฌ๐†ช๐œบ€๐œฌ๐œฌ๐œฌ๐‡ฆ๐œฌ๐œฌ๐œฌ๐Ÿ ๐œปธ๐œพฌ๐‚๐œพŽ๐Œฐ๐‚บ๐ƒ˜๐œพŽ๐’ถ๐œฟŠ๐œพŽ๐œผด๐‚œ๐œฌ๐พ๐œพฌ๐‚๐œผด๐œปธ๐‹–๐•Œ๐•ช๐Ÿ‚๐œบ€๐จ๐…ฎ๐Ÿ ๐จ๐พ๐œŽ๐œธˆ๐‡ˆ๐‡ˆ๐œธˆ๐‡ˆ๐‡ˆ๐Ÿ‚๐žค๐œฌ๐Ÿ ๐œธˆ๐‡ˆ๐‡ˆ๐œธˆ๐‡ˆ๐‡ˆ๐œŽ๐Ÿ ๐œฟจ๐œฟจ๐“ฒ๐‚บ๐ƒถ๐„ฒ๐œฟจ๐œฝฐ๐‚บ๐œผด๐œฌ๐œบ€๐Ÿ ๐œฟจ๐„ฒ๐œบผ๐‚บ๐•Œ๐•ช๐œบ€๐ข”๐Ÿ‚๐Ÿ ๐œฌ๐œฌ๐œฌ๐„ฒ๐Ÿ‚",
 "๐Ÿœ ๐Ÿฒ๐žน–๐žถข๐žปฌ๐Ÿ€ถ๐Ÿœ ๐žบ’๐Ÿœ‚๐Ÿ’ฉ๐Ÿ’‹๐žตฅ๐žพ๐žฟ›๐ŸœŸ๐žพฝ๐žผง๐žป๐Ÿ’๐Ÿฐ๐žผฆ๐Ÿ‡ถ๐žพž",
 "๐žพ‚๐žน–๐Ÿœ‚๐žฟบ๐žปฌ๐žธธ๐žนด๐žถข๐Ÿ’ช๐ŸœŸ๐ŸœŸ๐Ÿ„ฅ๐Ÿ€—๐Ÿšง๐Ÿ“๐Ÿƒฉ๐Ÿšง๐žผ‰๐Ÿšฆ๐žพผ๐Ÿšฆ๐žธถ๐Ÿšฆ๐žฝข๐Ÿœ€๐Ÿ’จ๐Ÿ’‰๐Ÿœ๐Ÿชก๐žผ‡๐Ÿ’ง๐Ÿœ๐žถŸ๐Ÿšฅ๐žถฝ๐Ÿšค๐žพœ",
 "๐Ÿšจ๐Ÿฒ๐Ÿšจ๐Ÿ”๐Ÿœ‚๐Ÿ’ช๐Ÿ’Œ๐Ÿœ ๐Ÿชค๐Ÿฑ๐Ÿ’ฉ๐Ÿ‚ญ๐Ÿ’ฉ๐Ÿ’‹๐žถก๐Ÿ“‡๐Ÿ˜ฏ๐Ÿ‘ญ๐Ÿ„ค๐Ÿ™ช๐Ÿ™ช๐Ÿ™ช๐Ÿฐ๐žนฒ๐žนฒ๐Ÿฐ๐žถŸ๐Ÿœ๐Ÿš‡๐žถŸ๐Ÿ›ฟ๐Ÿƒง๐Ÿ™ฉ๐žผ‡๐Ÿฏ๐žบฌ๐Ÿœœ๐Ÿ‚ช๐Ÿ’ฆ๐Ÿ’ˆ๐Ÿ€”๐Ÿ™จ๐žธ–๐Ÿœ›๐Ÿ›ฝ๐Ÿ›ฝ๐Ÿ“ฟ๐Ÿ„ก๐Ÿ™ง๐Ÿ™ง๐Ÿ™ง๐Ÿญ๐žนฎ๐žนฎ๐Ÿฌ๐žถœ๐Ÿœš๐žถœ๐Ÿ›ผ๐Ÿƒค๐Ÿ™ฅ๐žผƒ๐Ÿซ๐žบฉ๐Ÿœ™๐Ÿ‚ง๐Ÿ’ฃ๐Ÿ’…๐Ÿ€‘๐Ÿ™ค๐Ÿ€๐Ÿœ˜๐Ÿ›บ๐Ÿ›บ๐Ÿš ๐Ÿชœ๐ŸŒ๐Ÿ’ก๐Ÿ‚ฅ๐Ÿ’ก๐Ÿ’ƒ๐žถท๐Ÿ’ฟ๐Ÿ˜ง๐Ÿ‘ฅ๐Ÿ„๐Ÿ™ข๐Ÿ™ข๐Ÿ™ข๐Ÿจ๐žนช๐žนช๐Ÿจ๐žถ˜๐Ÿœ•๐Ÿ™ฟ๐žถต๐Ÿ›ท๐ŸƒŸ๐Ÿ™ก๐žปฟ๐Ÿง๐žบฅ๐Ÿœ”๐Ÿ‚ข๐Ÿ’ž๐Ÿ’€๐Ÿ€Œ๐Ÿ™ ๐žผœ๐Ÿœ”๐Ÿ›ต๐Ÿ›ต๐Ÿ“ท๐Ÿ„™๐Ÿ™Ÿ๐Ÿ™Ÿ๐Ÿ™Ÿ๐Ÿฅ๐žนง๐žนฆ๐Ÿค๐žถ”๐Ÿœ’๐žถฒ๐Ÿ›ด๐Ÿƒœ๐Ÿ™ž๐žปป๐Ÿฃ๐žบก๐Ÿœ‘๐Ÿ‚Ÿ๐Ÿ’›๐Ÿ‘ฝ๐Ÿ€‰๐Ÿ™๐žนค๐Ÿœ๐Ÿ›ฒ๐Ÿ›ฒ๐Ÿš˜๐Ÿช”๐žพ",
 "๐Ÿ‘ฎ๐Ÿœ ๐Ÿฒ๐Ÿœ ๐Ÿœ‚๐Ÿšจ๐Ÿ”๐Ÿœ ๐Ÿœ‚๐Ÿœ๐Ÿ”ƒ๐ŸœŸ๐Ÿ“๐ŸœŸ๐Ÿœ๐Ÿšง๐Ÿฑ๐ŸœŸ๐Ÿœ€๐Ÿœ€๐Ÿœ€๐Ÿšฆ๐Ÿชข๐žพผ๐Ÿ’จ๐Ÿœž๐žน“๐Ÿšฅ๐žบญ๐Ÿšฅ๐žฟ™๐Ÿšฅ๐žพ",
 "๐Ÿšจ๐žพพ๐Ÿœ‚๐Ÿ’ช๐Ÿ’Œ๐Ÿœ ๐žพพ๐Ÿ’ช๐Ÿ€˜๐Ÿ™ซ๐žน•๐ŸœŸ๐Ÿœ๐Ÿšง๐žพฝ๐Ÿ‘ญ๐ŸœŸ๐žพฝ๐Ÿ’จ๐žพผ๐Ÿ™ช๐žน”๐žบฎ๐žผฆ๐žพ€๐žธถ๐Ÿœ๐Ÿœป๐Ÿ„…๐žปฉ๐Ÿœป๐Ÿ›ฟ๐Ÿ™ฉ๐žผ‡๐Ÿฏ๐žบฌ๐Ÿœœ๐žฟถ๐Ÿ’ฆ๐Ÿ’ˆ๐žฟถ๐Ÿ™จ๐žน’๐žบซ๐žผฃ๐žฝฝ๐žธณ๐Ÿœ›๐Ÿœน๐Ÿœน๐Ÿ›ฝ๐Ÿ›ฝ๐Ÿšข๐žน๐Ÿ’ค๐Ÿ„ ๐žพธ๐Ÿ™ฆ๐žผข๐žฟด๐žปฅ๐žพท๐žธฑ๐žพ™",
 "๐Ÿšจ๐žพพ๐Ÿ„ฆ๐Ÿ˜ฐ๐Ÿƒช๐Ÿ™ฌ๐žผจ๐žฟบ๐žปฌ๐žพฝ๐žธท๐žพŸ",
 "๐Ÿƒช๐Ÿšจ๐Ÿชค๐žพพ๐Ÿ™ฌ๐žฟœ๐žปŽ๐žนด๐ŸŽบ๐Ÿฑ๐Ÿ€ต๐žพŸ",
 "๐Ÿœ ๐Ÿœ ๐žนด๐Ÿšจ๐žถข๐Ÿœ‚๐Ÿ’ช๐Ÿ’Œ๐žนด๐Ÿ™ซ๐žฟ›๐žป๐žนณ๐ŸŽน๐Ÿฑ๐Ÿ€ต๐žพŸ",
 "๐Ÿœ ๐Ÿœ ๐Ÿ€ถ๐Ÿšจ๐žท€๐Ÿœ‚๐Ÿ’ช๐Ÿ’Œ๐Ÿ€ถ๐Ÿ’ฉ๐Ÿ’ฉ๐Ÿœฝ๐Ÿ‘๐Ÿœฝ๐Ÿ‘ญ๐žบฏ๐Ÿ’ฉ๐Ÿ„ฅ๐žถ ๐Ÿšฆ๐žถพ๐Ÿƒจ๐Ÿ”‚๐Ÿ€ด๐Ÿ’จ๐Ÿ’จ๐Ÿœป๐Ÿ›ƒ๐Ÿœป๐Ÿ‘ซ๐žฟ™๐Ÿ’ง๐Ÿ„ฃ๐žถŸ๐Ÿšฅ๐žถผ๐Ÿƒฆ๐Ÿ”€๐Ÿ€ฒ๐Ÿ’ฆ๐Ÿ’ฆ๐Ÿœบ๐Ÿ› ๐Ÿœน๐Ÿ‘ฉ๐žพ›",
 "๐Ÿ’ช๐Ÿ„ฆ๐žถข๐Ÿšจ๐žท€๐Ÿƒช๐Ÿ”„๐Ÿ„ฆ๐Ÿƒช๐Ÿ„ฅ๐Ÿ˜ฏ๐Ÿƒฉ๐Ÿœ๐Ÿœ๐Ÿšง๐Ÿ„ฅ๐žน•๐Ÿšง๐žบฎ๐Ÿšฆ๐žฟš๐Ÿšฆ๐žพž",
 "๐Ÿƒช๐Ÿœ‚๐Ÿ”„๐žปฌ๐žธš๐žผจ๐žผจ๐Ÿœ‚๐Ÿšจ๐Ÿชฃ๐žธท๐Ÿ’ฉ๐ŸœŸ๐Ÿฑ๐Ÿšง๐Ÿ“๐Ÿšง๐Ÿ€ต๐Ÿœ€๐Ÿ’จ๐Ÿ’Š๐Ÿœž๐Ÿ€ด๐Ÿ„ค๐Ÿ˜ฎ๐Ÿƒจ๐Ÿ“…๐Ÿ’ง๐Ÿ‹‡๐Ÿฏ๐žธต๐žพ",
 "๐Ÿ™ฌ๐žผŠ๐Ÿฒ๐žท€๐Ÿœ ๐Ÿฒ๐Ÿ„ฆ๐Ÿ˜ฐ๐Ÿƒช๐Ÿšง๐Ÿ“๐Ÿ„ฅ๐Ÿ˜ฏ๐Ÿƒฉ๐Ÿœ๐Ÿ›๐Ÿ›๐Ÿ€ต๐Ÿ„ค๐Ÿ˜ฎ๐Ÿƒจ๐Ÿ’Š๐Ÿ’จ๐Ÿ‹ˆ๐Ÿฐ๐žธถ๐žพ",
 "๐Ÿ™ฌ๐žผŠ๐žพ‚๐žปฌ๐Ÿœ ๐Ÿฒ๐Ÿ„ฆ๐Ÿ˜ฐ๐Ÿƒช๐Ÿšง๐Ÿ“๐Ÿ„ฅ๐Ÿ˜ฏ๐Ÿƒฉ๐Ÿœ๐Ÿชฃ๐Ÿ›๐Ÿ›๐Ÿ€ด๐Ÿ„ค๐Ÿ˜๐Ÿƒจ๐Ÿ“†๐Ÿ’จ๐Ÿ‹ˆ๐Ÿฐ๐žธต๐žพ",
 "๐Ÿ™ฌ๐žผŠ๐Ÿฒ๐žท€๐Ÿœ ๐Ÿฒ๐Ÿ„ฆ๐Ÿ˜’๐Ÿƒช๐Ÿšง๐Ÿ“๐Ÿ„ฅ๐Ÿ˜‘๐Ÿƒฉ๐Ÿœ๐Ÿ›๐Ÿ›๐Ÿ€ต๐Ÿ„ค๐Ÿ˜๐Ÿƒจ๐Ÿ’Š๐Ÿ’จ๐Ÿ‹ˆ๐Ÿฐ๐žธถ๐žพ",
 "๐Ÿ™ฌ๐žผŠ๐žพ‚๐žปฌ๐Ÿœ ๐Ÿฒ๐Ÿ„ฆ๐Ÿ˜’๐Ÿƒช๐Ÿšง๐Ÿ“๐Ÿ„ฅ๐Ÿ˜‘๐Ÿƒฉ๐Ÿœ๐Ÿœ๐Ÿšง๐Ÿชฃ๐žฝข๐Ÿ’จ๐Ÿœž๐Ÿฐ๐Ÿšฆ๐Ÿ’๐Ÿšฆ๐Ÿ€–๐Ÿšฅ๐žพ",
 "๐Ÿœ‚๐Ÿ’ช๐Ÿ’Œ๐Ÿœ ๐Ÿ€˜๐Ÿ‘ฎ๐Ÿœ ๐žธธ๐Ÿœ ๐Ÿ„ฅ๐Ÿฑ๐Ÿ„ฅ๐Ÿ˜ฏ๐Ÿƒฉ๐Ÿšง๐Ÿฑ๐Ÿ„ฅ๐Ÿ˜‘๐Ÿƒจ๐Ÿƒจ๐Ÿšฆ๐Ÿ„ค๐Ÿ’๐Ÿ„ค๐Ÿ˜ฎ๐Ÿƒจ๐Ÿšฅ๐Ÿฏ๐Ÿ„ฃ๐Ÿ˜๐Ÿƒง๐Ÿƒง๐Ÿšฅ๐žพ",
 "๐Ÿœ‚๐žตˆ๐žตˆ๐žธธ๐Ÿœ ๐Ÿ„ฆ๐Ÿ”๐Ÿ„ฆ๐Ÿ˜ฐ๐Ÿƒฉ๐Ÿšง๐Ÿฑ๐Ÿ„ฅ๐Ÿ˜‘๐Ÿƒฉ๐Ÿƒฉ๐Ÿšง๐Ÿ„ฅ๐Ÿ’๐Ÿ„ค๐Ÿ˜ฎ๐Ÿƒจ๐Ÿšฆ๐Ÿ’๐Ÿ„ค๐Ÿ˜๐Ÿƒง๐Ÿƒง๐Ÿšฅ๐žพ",
 "๐Ÿœ‚๐Ÿœ‚๐Ÿชค๐Ÿ”„๐Ÿœ ๐žธธ๐Ÿœ ๐Ÿ„ฆ๐Ÿฒ๐Ÿ„ฅ๐Ÿ˜ฏ๐Ÿƒฉ๐Ÿšง๐Ÿฑ๐Ÿ„ฅ๐Ÿ˜‘๐Ÿƒฉ๐Ÿƒฉ๐Ÿšฆ๐Ÿ„ค๐Ÿฐ๐Ÿ„ค๐Ÿ˜ฎ๐Ÿƒจ๐Ÿšฆ๐Ÿ’๐Ÿ„ฃ๐Ÿ˜๐Ÿƒง๐Ÿƒง๐Ÿšฅ๐žพ",
 "๐Ÿœ‚๐žตˆ๐žตˆ๐žธธ๐Ÿœ ๐Ÿ„ฆ๐Ÿฒ๐Ÿ„ฆ๐Ÿ˜ฐ๐Ÿƒฉ๐Ÿšง๐Ÿ“๐Ÿ„ฅ๐Ÿ˜‘๐Ÿƒฉ๐Ÿƒฉ๐Ÿšง๐Ÿ„ฅ๐Ÿ’๐Ÿ„ค๐Ÿ˜ฎ๐Ÿƒจ๐Ÿšฆ๐Ÿ’๐Ÿ„ค๐Ÿ˜๐Ÿƒง๐Ÿƒง๐Ÿšฅ๐žพ",
 "๐Ÿœ‚๐Ÿœ‚๐Ÿœ‚๐Ÿšจ๐Ÿชค๐Ÿฒ๐žน–๐žถข๐žปฌ๐Ÿ€ต๐ŸœŸ๐Ÿœ๐Ÿ’ฉ๐Ÿ’‹๐žตฅ๐žฟ›๐žป๐žนณ๐Ÿœž๐Ÿ“ค๐Ÿ“ค๐Ÿœ€๐žธถ๐žนฒ๐žถ ๐žตค๐Ÿฏ๐žท›๐Ÿฏ๐žฝฟ๐žธต๐Ÿ ๐Ÿ€•๐Ÿ™ฉ๐žถฝ๐Ÿœœ๐Ÿ›พ๐Ÿ“ข๐žฟ˜๐žปŠ๐žนฐ๐Ÿœœ๐Ÿ“ข๐Ÿ“ก๐Ÿ›ฝ๐žตก๐žผฃ๐žฟต๐žธณ๐Ÿ ‹๐žผฃ๐Ÿ’ฅ๐žพธ๐Ÿœš๐Ÿ›ผ๐Ÿ“ ๐žฝผ๐žฟ–๐Ÿœš๐ŸŸฌ๐žผก๐Ÿ›ป๐Ÿ๐žนญ๐žฟณ๐Ÿซ๐žผฟ๐Ÿ“Ÿ๐Ÿช๐žผ ๐žฟฒ๐žธฐ๐Ÿ ˆ๐Ÿ„ž๐žนŽ๐Ÿš ๐žบจ๐ŸšŸ๐žฟ“๐ŸšŸ๐žพ—",
 "๐Ÿƒช๐Ÿ’ช๐žผจ๐Ÿ“ฆ๐žพ‚๐žฟœ๐Ÿœ ๐Ÿ€˜๐Ÿ™ฌ๐žบฏ๐žบฏ๐Ÿ›๐Ÿ›๐ŸŸฑ๐žพŸ",
 "๐Ÿœ‚๐žตฆ๐žผจ๐žฟบ๐žธธ๐Ÿ ๐žท€๐Ÿ’ช๐žบฐ๐Ÿšง๐žถƒ๐Ÿ’ฉ๐Ÿ˜ฏ๐Ÿšง๐žฝฃ๐Ÿ’ฉ๐žปซ๐žฟน๐žทœ๐Ÿ Ž๐Ÿˆ”๐žฟธ๐žธถ๐Ÿœž๐Ÿœ€๐Ÿ“ค๐žท›๐žพ",
 "๐žพ‚๐žผจ๐žฟบ๐Ÿœ ๐Ÿ˜’๐Ÿœ‚๐žตฆ๐Ÿชค๐žผจ๐žฟน๐žธท๐Ÿ ๐žทป๐Ÿ’ฉ๐žบฏ๐Ÿ„ฅ๐Ÿ˜ฏ๐Ÿƒฉ๐Ÿธ๐Ÿ—ฒ๐Ÿ›ข๐Ÿ—ฒ๐Ÿšˆ๐Ÿ˜๐Ÿšฆ๐Ÿ‚ฌ๐Ÿ“ฃ๐Ÿ„ฃ๐Ÿ‚ซ๐Ÿšฅ๐žบญ๐Ÿƒง๐Ÿ’ง๐Ÿœ๐žบญ๐Ÿ„ข๐Ÿ˜Ž๐Ÿƒฆ๐Ÿ›‚๐žทธ๐Ÿ“„๐žน’๐Ÿ„ข๐Ÿ˜๐Ÿƒฅ๐Ÿ—๐Ÿ—๐žบซ๐Ÿ„ก๐Ÿ˜๐Ÿƒฅ๐Ÿ›๐žทถ๐Ÿ’†๐Ÿ’ค๐Ÿ˜ช๐Ÿ›ผ๐Ÿ‘จ๐Ÿ„ ๐žผ„๐Ÿœ™๐Ÿ˜ฉ๐Ÿšก๐žทต๐Ÿ›ป๐Ÿšก๐Ÿ„Ÿ๐žบฉ๐Ÿ„Ÿ๐Ÿ˜จ๐Ÿƒข๐Ÿš ๐žบจ๐Ÿ„ž๐Ÿ˜Š๐Ÿƒข๐Ÿšพ๐žทณ๐Ÿƒก๐Ÿƒก๐Ÿช›๐Ÿ“ป๐Ÿœ—๐Ÿœ—๐žทณ๐Ÿ’ก๐žตบ๐Ÿฐ๐Ÿ—ช๐Ÿ›š๐Ÿ—ช๐Ÿš€๐Ÿ˜ˆ๐Ÿšž๐žบฅ๐Ÿ„›๐Ÿ˜ฅ๐ŸƒŸ๐Ÿšป๐žทฑ๐Ÿ’ฝ๐žน‹๐Ÿ„›๐Ÿ˜ค๐Ÿƒž๐Ÿ๐Ÿ๐žบค๐Ÿ„š๐Ÿ˜ค๐Ÿƒž๐Ÿšน๐žทฏ๐Ÿ‘ฟ๐Ÿ’๐Ÿ˜ฃ๐Ÿ›ต๐žดป๐žดป๐Ÿœ“๐žทฎ๐Ÿ’œ๐Ÿ™ผ๐žทฎ๐Ÿšš๐žตถ๐Ÿšธ๐Ÿšธ๐Ÿ›ณ๐Ÿš™๐Ÿ„—๐žปป๐Ÿœ‘๐žทญ๐Ÿš™๐Ÿ˜ก๐Ÿ›ณ๐Ÿš˜๐Ÿ„–๐žบ ๐Ÿ„–๐Ÿ˜ ๐Ÿƒš๐Ÿšถ๐žทฌ๐Ÿš˜๐žบŸ๐Ÿ„•๐Ÿ˜๐Ÿƒ™๐Ÿƒ™๐Ÿƒ™๐Ÿ›ฑ๐Ÿ“•๐Ÿช’๐žผ–๐žฟจ๐žธฆ๐ŸŸพ๐žผด๐Ÿ’˜๐Ÿ‚œ๐Ÿ’˜๐Ÿ‘น๐Ÿœ๐Ÿ„“๐Ÿ™™๐Ÿ™™๐Ÿ™™๐Ÿ๐Ÿƒ—๐Ÿ™˜๐žปถ๐Ÿž๐žบœ๐ŸœŒ๐žฟฆ๐Ÿ’–๐Ÿ‘ธ๐žฝ๐Ÿ™—๐žพ‹",
 "๐Ÿฒ๐žน–๐Ÿœ ๐žฟบ๐Ÿœ‚๐Ÿ‘ฎ๐žฟบ๐Ÿ”„๐žฝค๐Ÿ™ซ๐Ÿฑ๐Ÿ€—๐Ÿ€—๐ŸœŸ๐žฟน๐Ÿ™ซ๐žฟ›๐žพ๐žปช๐Ÿฐ๐žผฆ๐žผฆ๐žถ ๐Ÿœž๐Ÿ‚ฌ๐Ÿ’จ๐Ÿ’‰๐Ÿœ๐Ÿ‘๐Ÿ™ฉ๐Ÿ€•๐žฟท๐žผฅ๐žฟท๐žธต๐žฟถ๐Ÿœœ๐žฟถ๐Ÿ›พ๐Ÿšค๐žฝ ๐Ÿ™จ๐Ÿ€”๐žฟต๐žผฃ๐žฟต๐žธณ๐žฟต๐Ÿœ›๐žฟต๐Ÿ›ฝ๐Ÿ›ฝ๐Ÿ›ผ๐Ÿ™ฆ๐Ÿ€ฐ๐Ÿฌ๐žธฒ๐Ÿ€ฐ๐žพš",
 "๐Ÿœ ๐Ÿ‚ฎ๐Ÿ’ช๐Ÿ’Œ๐žตฆ๐žดช๐Ÿœ‚๐Ÿœ‚๐Ÿœ‚๐Ÿšง๐Ÿ€—๐Ÿ™ซ๐žผ‰๐žน•๐žพฝ๐Ÿ’ฉ๐Ÿ“๐Ÿ™ซ๐žน”๐žพ€๐žถ‚๐žฟธ๐Ÿœ€๐Ÿชข๐žฝ„๐Ÿœž๐Ÿ›ฟ๐Ÿ“ฃ๐žฝฟ๐žฟ™๐Ÿœ๐Ÿ‘๐Ÿ™ฉ๐žน“๐žฝฟ๐žถ€๐žฟถ๐Ÿ’ˆ๐Ÿ˜Ž๐Ÿ˜ฌ๐Ÿ˜ฌ๐Ÿ›พ๐žทš๐žพ›",
 "๐žพ‚๐žผจ๐žฟบ๐Ÿœ ๐Ÿ”๐Ÿ™ฌ๐žน–๐žพ‚๐žถ„๐žฟน๐Ÿ’‹๐Ÿ”ก๐Ÿ˜ฏ๐Ÿœ๐žฝ…๐ŸœŸ๐Ÿœ๐Ÿšง๐Ÿชข๐Ÿฐ๐žทœ๐Ÿฐ๐žพ€๐žธถ๐Ÿ Ž๐žบ๐Ÿœ๐Ÿ˜๐Ÿ˜ญ๐Ÿ˜ญ๐Ÿ›ฟ๐Ÿ“ฃ๐žผฅ๐Ÿ’ง๐žพป๐Ÿœœ๐Ÿ›พ๐Ÿ“ข๐Ÿ„ข๐žน’๐Ÿšค๐Ÿ‚ช๐Ÿšค๐žฟ—๐Ÿšฃ๐žพ›",
 "๐Ÿƒช๐Ÿ’ช๐žผจ๐Ÿ“ฆ๐žพ‚๐žฟœ๐Ÿœ ๐žผจ๐Ÿœ๐Ÿ›๐žผง๐Ÿ„ฅ๐Ÿ—•๐Ÿƒฉ๐Ÿœ๐žตฅ๐Ÿ€—๐Ÿ™ซ๐žบฎ๐žบฎ๐Ÿ’จ๐Ÿ˜ฎ๐Ÿ“ค๐Ÿ’๐žนฒ๐žฟธ๐Ÿฏ๐žฝƒ๐žดง๐Ÿชก๐žดง๐žดง๐žฟท๐žผฅ๐žน“๐žฟถ๐Ÿ Œ๐žฝพ๐žฟ˜๐Ÿœœ๐ŸŸฎ๐žพœ",
 "๐Ÿœ‚๐žตฆ๐žผŠ๐Ÿœ ๐žฟœ๐Ÿ„ฆ๐Ÿ˜ฐ๐Ÿƒช๐ŸšŠ๐žบฏ๐Ÿ„ฅ๐Ÿ˜ฏ๐Ÿƒฉ๐Ÿšง๐žฟ›๐Ÿ„ฅ๐Ÿ˜‘๐Ÿƒฉ๐Ÿšˆ๐žบฎ๐Ÿ„ค๐Ÿ˜๐Ÿƒจ๐Ÿœ€๐žดจ๐žฟธ๐žผฅ๐žน“๐žฟท๐žตฃ๐Ÿชก๐žผฅ๐žฟท๐žธต๐Ÿ ๐Ÿ„ข๐žธ–๐Ÿšค๐žถผ๐Ÿšค๐žถž๐Ÿƒฆ๐Ÿ’ฆ๐Ÿ„ก๐Ÿ„ก๐žบซ๐Ÿ„ก๐Ÿ˜ซ๐Ÿƒฅ๐Ÿšฃ๐žบซ๐Ÿ„ก๐Ÿ˜Œ๐Ÿƒค๐Ÿƒค๐Ÿšข๐Ÿ‹„๐Ÿฌ๐žธฒ๐žพš",
 "๐Ÿ™ฌ๐žนด๐Ÿฒ๐žปฌ๐Ÿ€˜๐žปŽ๐žผŠ๐Ÿœ ๐Ÿœ‚๐Ÿ’‹๐Ÿ˜ฏ๐Ÿ™ซ๐Ÿ–™๐Ÿšง๐Ÿ‹‰๐Ÿฑ๐žธท๐žพŸ",
 "๐Ÿ™ฌ๐žนด๐Ÿฒ๐žปฌ๐Ÿ€˜๐žปŽ๐žผŠ๐Ÿœ ๐Ÿœ‚๐Ÿ’‹๐Ÿ˜ฏ๐Ÿ™ซ๐Ÿ–™๐Ÿƒฉ๐Ÿ“ฅ๐Ÿชฃ๐žผง๐žฟน๐žธถ๐Ÿ Ž๐žพ€๐Ÿ’จ๐Ÿ˜ฎ๐Ÿ“ค๐žทœ๐žพž",
 "๐žพ‚๐žผจ๐žฟบ๐Ÿœ ๐Ÿ˜’๐Ÿœ‚๐žตฆ๐Ÿชค๐žพ‚๐žฟ›๐ŸœŸ๐ŸŸฑ๐ŸœŸ๐žฝฃ๐ŸœŸ๐žบฏ๐Ÿšง๐žธ™๐Ÿšฆ๐žถพ๐Ÿšฆ๐žพž",
 "๐Ÿœ‚๐žตˆ๐žตˆ๐žฝค๐Ÿœ ๐žธš๐Ÿšจ๐žฟœ๐Ÿšจ๐žถก๐Ÿšง๐žพŸ",
 "๐Ÿœ‚๐Ÿœ‚๐Ÿœ‚๐Ÿ ๐Ÿ”๐žนด๐žฟบ๐Ÿฒ๐žฝ†๐Ÿ“ฅ๐Ÿชฃ๐žธ™๐Ÿ’ฉ๐Ÿ„ฅ๐Ÿ‹‰๐Ÿฑ๐žธท๐žพŸ",
 "๐Ÿ™ฌ๐žฟœ๐žผจ๐žปŽ๐žปŽ๐žนด๐Ÿœ ๐Ÿ‹Š๐Ÿฒ๐žธท๐žพŸ",
 "๐Ÿ™ฌ๐žนด๐Ÿฒ๐žปฌ๐Ÿ€˜๐žปŽ๐žผŠ๐Ÿœ ๐Ÿœ‚๐Ÿ›ฃ๐žน•๐Ÿ„ฅ๐Ÿ˜ฏ๐Ÿƒฉ๐Ÿœ๐Ÿšง๐Ÿ‹‰๐Ÿฑ๐žธถ๐žพž",
 "๐Ÿ™ฌ๐žฟœ๐žผจ๐žปŽ๐žปŽ๐žนด๐Ÿœ ๐Ÿ‹Š๐Ÿฒ๐žธท๐žพŸ",
 "๐Ÿ™ฌ๐žนด๐Ÿฒ๐žปฌ๐Ÿ€˜๐žปŽ๐žผŠ๐Ÿœ ๐Ÿœ‚๐Ÿ›ฃ๐žน•๐Ÿ„ฅ๐Ÿ˜‘๐Ÿƒฉ๐Ÿœ๐Ÿƒฉ๐Ÿ“ฅ๐Ÿชฃ๐žถพ๐Ÿ’จ๐Ÿ‹ˆ๐Ÿฐ๐žธถ๐žพž",
 "๐Ÿ™ฌ๐žนด๐Ÿฒ๐žปฌ๐Ÿ€˜๐žปŽ๐žผŠ๐Ÿœ ๐Ÿœ‚๐Ÿ’‹๐Ÿ˜ฏ๐Ÿ™ซ๐Ÿ–™๐Ÿ“ฅ๐žถก๐Ÿ’ฉ๐Ÿ‹‰๐Ÿฑ๐žธถ๐žพž",
 "๐Ÿ™ฌ๐žนด๐Ÿฒ๐žปฌ๐Ÿ€˜๐žปŽ๐žผŠ๐Ÿœ ๐Ÿœ‚๐Ÿ’‹๐Ÿ˜ฏ๐Ÿ™ซ๐Ÿ–™๐Ÿ“ฅ๐Ÿชฃ๐žพ๐Ÿ›…๐Ÿ›…๐Ÿ“ค๐žพ€๐žฟš๐Ÿœž๐žพ€๐Ÿ’Š๐Ÿ˜๐Ÿ˜ฎ๐Ÿ˜ญ๐Ÿ˜ญ๐Ÿ›ฟ๐žตฃ๐žฝฟ๐Ÿ’ง๐Ÿ˜ญ๐Ÿ“ฃ๐Ÿ€ณ๐žปŠ๐žปจ๐žน’๐žปŠ๐žผค๐žฟถ๐Ÿ™จ๐žฟถ๐žนฏ๐žนฏ๐žป‰๐žนฏ๐Ÿœ›๐ŸŸ๐ŸŸญ๐ŸŸ๐Ÿ›ฝ๐Ÿ“ ๐Ÿฌ๐žท˜๐Ÿฌ๐žฝผ๐žธฒ๐Ÿ Š๐žบŒ๐Ÿœ™๐Ÿ˜‹๐Ÿ˜ฉ๐Ÿ˜ฉ๐Ÿ›ป๐žดฃ๐Ÿช๐žดฃ๐žผƒ๐Ÿœ˜๐žธ’๐Ÿ„ž๐Ÿ˜จ๐Ÿƒข๐Ÿš‚๐žบจ๐Ÿ„ž๐Ÿ˜ง๐Ÿƒก๐ŸšŸ๐žธ‘๐Ÿ„๐Ÿ˜‰๐Ÿƒก๐Ÿš๐žบง๐Ÿ„œ๐Ÿ˜ˆ๐Ÿƒ ๐Ÿšž๐žถถ๐Ÿ›ธ๐Ÿ“œ๐Ÿชš๐žปฟ๐Ÿœ•๐žฟ‘๐Ÿ„›๐Ÿ˜ฅ๐ŸƒŸ๐Ÿ™ฟ๐žธ๐Ÿ„›๐Ÿ˜ค๐Ÿƒž๐Ÿšœ๐žฟ๐Ÿ„š๐Ÿ˜†๐Ÿƒž๐Ÿ™พ๐žธ๐Ÿ„™๐Ÿ˜…๐Ÿƒ๐Ÿš›๐žถ•๐Ÿ›ต๐Ÿ“™๐Ÿช—๐žดœ๐Ÿค๐žท๐Ÿค๐žฝด๐žธช๐Ÿ ‚๐Ÿœ’๐žผ™๐Ÿ’›๐Ÿ‘ฝ๐Ÿ‰ก๐žนฅ๐žบฟ๐žปป๐žฝณ๐žน‡๐žฟช๐Ÿ™œ๐Ÿข๐žผ˜๐žผ˜๐Ÿœ๐Ÿ„๐Ÿ›ฒ๐Ÿ™œ๐žฟ‹๐žฝฑ๐žป›๐Ÿก๐žผ—๐žผ—๐žถ‘๐Ÿœ๐Ÿ‚œ๐Ÿ’˜๐Ÿ‘บ๐žผ–๐Ÿ™š๐žฟŠ๐žบผ๐žนข๐ŸŽจ๐ŸŸ๐Ÿ€ฃ๐žพ",
 "๐Ÿœ ๐žฟบ๐Ÿ’ช๐Ÿ’Œ๐Ÿ”๐Ÿ™ฌ๐Ÿ€˜๐žฟบ๐žผจ๐žฟน๐žธท๐žฟน๐ŸœŸ๐žฟน๐Ÿœ๐Ÿœ๐Ÿœ๐Ÿœ๐Ÿœž๐Ÿ„ค๐Ÿ™ช๐Ÿ™ช๐Ÿ™ช๐Ÿ’๐Ÿƒจ๐Ÿœ€๐Ÿ“ฃ๐Ÿชก๐žดง๐Ÿ‘๐žนฑ๐žฟท๐Ÿฏ๐žฝƒ๐žดง๐Ÿ€ฒ๐Ÿฎ๐žธด๐Ÿ€ฒ๐žพœ",
 "๐Ÿœ ๐žฟบ๐Ÿœ‚๐žตฆ๐Ÿ€ถ๐žปŽ๐žปฌ๐žน–๐žปŽ๐žผง๐žฟน๐Ÿ™ซ๐žฟน๐žนณ๐žนณ๐žป๐žนณ๐ŸœŸ๐žฟธ๐Ÿœ€๐Ÿ“ค๐Ÿฐ๐žทœ๐Ÿฐ๐žพ€๐žธถ๐Ÿ ๐žบ๐Ÿœ๐Ÿ˜๐Ÿ˜ญ๐Ÿ˜ญ๐Ÿ˜ญ๐Ÿ›ฟ๐Ÿ“ฃ๐žดฆ๐žดฆ๐Ÿ›พ๐Ÿ›พ๐Ÿช ๐Ÿœœ๐Ÿœœ๐ŸŸฎ๐žพน๐žผฃ๐žป‰๐Ÿ๐Ÿญ๐žผฃ๐Ÿ‡ณ๐žพ›",
 "๐žพ‚๐žน–๐Ÿ™ฌ๐žทž๐žพ‚๐žปฌ๐Ÿ€˜๐žปŽ๐žทž๐Ÿœ๐Ÿ‘ญ๐Ÿฑ๐žท๐Ÿฑ๐žพ๐žธท๐ŸœŸ๐Ÿฑ๐žน”๐žถ ๐žปช๐Ÿ€ด๐Ÿœž๐žตค๐Ÿด๐žผฆ๐žฝฟ๐žฟท๐žปฉ๐žธต๐žดง๐Ÿšฅ๐Ÿ™‹๐Ÿ›ก๐Ÿ ๐Ÿฒ๐žปŠ๐žปจ๐žฟ˜๐žฝพ๐žพบ๐Ÿ Œ๐Ÿ€”๐Ÿญ๐žธณ๐Ÿญ๐Ÿ ‹๐Ÿš…๐Ÿš…๐Ÿš…๐Ÿš…๐Ÿ’‡๐Ÿ›ž๐Ÿ™ˆ๐žต ๐žปˆ๐žนฎ๐žฝผ๐žพธ๐žฝผ๐žปฅ๐Ÿšก๐Ÿ€ฏ๐žป‡๐žป‡๐žผฟ๐žฝป๐žฟณ๐Ÿšก๐žนŽ๐žบจ๐Ÿช๐žผ‚๐žดข๐Ÿš ๐Ÿชœ๐žนŽ๐ŸšŸ๐žพต๐ŸšŸ๐Ÿ€๐ŸšŸ๐Ÿ‹๐Ÿ›น๐Ÿ’ก๐Ÿ’ƒ๐žตœ๐žฝธ๐žฟ’๐Ÿœ–๐ŸŸจ๐Ÿœ–๐žป„๐žนช๐žฝท๐žพณ๐žฝท๐žปก๐Ÿ‘๐Ÿ‘๐Ÿ€ซ๐žปƒ๐žปƒ๐žผบ๐žฝถ๐žฟฎ๐Ÿ›ถ๐Ÿ›ถ๐ŸŽ๐žธŽ๐žป ๐Ÿ€ฉ๐žธซ๐žฝต๐žป๐žปŸ๐Ÿœ“๐Ÿœฑ๐žถณ๐Ÿœฑ๐Ÿšš๐Ÿœฐ๐žธช๐žพ’",
 "๐žนด๐žปŽ๐žทž๐Ÿ ๐žปฌ๐žฟบ๐žทž๐Ÿ ๐ŸŽบ๐žนณ๐žนณ๐žป๐žนณ๐ŸœŸ๐žถฟ๐Ÿœ๐Ÿœฝ๐Ÿœ๐Ÿœž๐Ÿœผ๐Ÿ€ด๐žปŒ๐žปช๐žฟš๐žพ€๐žพผ๐Ÿ™ฉ๐žฝก๐žน“๐žป‹๐žปฉ๐Ÿ ๐ŸŸฏ๐Ÿ’ง๐Ÿ ๐žตข๐ŸŸ๐žปŠ๐žนฐ๐žฝพ๐žพบ๐žฝพ๐žปจ๐ŸŸ๐Ÿ“ฟ๐Ÿ ‹๐Ÿ‹ฃ๐žถ๐žนฏ๐žฝฝ๐Ÿ€ฑ๐Ÿ‹ฃ๐žถœ๐Ÿ™ฆ๐Ÿ€ฐ๐žปˆ๐žผ„๐Ÿšข๐Ÿ Š๐ŸŸŽ๐žน๐žบฉ๐Ÿซ๐žผƒ๐ŸŸ๐Ÿ“ฝ๐Ÿ‘ง๐Ÿ‘ง๐Ÿ‘ง๐Ÿš ๐Ÿ ˆ๐ŸŸŒ๐Ÿ€ฎ๐žป†๐žป†๐žผพ๐žฝบ๐žฟฑ๐ŸŸ‹๐Ÿ“ป๐Ÿ ‡๐ŸŸ‹๐žน๐žฟฑ๐žน๐žน๐žฝธ๐žป„๐žปข๐Ÿ’ ๐Ÿœด๐Ÿ›ธ๐Ÿ“œ๐Ÿชš๐žน‹๐Ÿ’Ÿ๐žปก๐žฟฏ๐žท“๐Ÿ …๐Ÿซ๐žผ๐žฝท๐žฟฎ๐žป ๐žธฌ๐Ÿœ”๐žป‚๐žนจ๐žฝถ๐žพฒ๐žฝต๐žปŸ๐Ÿš›๐žต™๐žบฃ๐žฝต๐žบฃ๐žฟญ๐žผ›๐žฝด๐žปž๐žฝด๐žปž๐žพฐ๐Ÿ“ถ๐Ÿ˜„๐Ÿ˜ข๐Ÿ˜ก๐Ÿš™๐žพ‘",
 "๐žฟบ๐Ÿฒ๐Ÿ€˜๐žฟบ๐žนด๐žน–๐Ÿ‡ธ๐žพ‚๐žผŠ๐žฟน๐žป๐žธ™๐žธท๐Ÿ”ƒ๐Ÿ˜‘๐Ÿ˜ฏ๐žฟน๐Ÿ—•๐Ÿšฆ๐Ÿ’๐žปŒ๐Ÿ€–๐žถ ๐Ÿ‡ถ๐žพ€๐žผˆ๐žฟท๐žป‹๐žธ—๐žธต๐Ÿ”๐Ÿ˜๐Ÿ˜ญ๐žฟท๐Ÿ—“๐žดฆ๐Ÿ›พ๐Ÿ“ข๐Ÿ๐Ÿ’ฆ๐žปจ๐žฟถ๐žทš๐Ÿ ‹๐Ÿˆ‘๐žฟต๐žธณ๐Ÿœ›๐Ÿ›ฝ๐Ÿ“ก๐ŸชŸ๐žน‘๐Ÿ’ค๐Ÿœš๐žน๐Ÿ’ค๐Ÿ’†๐Ÿฌ๐žน๐žถœ๐žปฅ๐Ÿ€ฏ๐Ÿœ™๐Ÿ๐žป‡๐Ÿ€‘๐žถ›๐Ÿšก๐žถน๐Ÿ›บ๐Ÿ’ข๐Ÿ’„๐Ÿœ˜๐žบจ๐žนฌ๐žป†๐Ÿ€ฎ๐žฟฑ๐žน๐žน๐Ÿ™ฃ๐žน๐žธฏ๐Ÿ€๐žป…๐žธ‘๐žธฎ๐Ÿ™ข๐Ÿ‚ค๐žธฎ๐žถ˜๐žบฆ๐žฟฐ๐ŸŸจ๐Ÿ’Ÿ๐Ÿœณ๐žธญ๐žธญ๐žถ—๐Ÿœณ๐Ÿ‘๐Ÿ‘๐žบฅ๐žนจ๐žป‚๐Ÿ€ช๐žฟฎ๐žนŠ๐žนŠ๐Ÿ™ ๐žนŠ๐žธซ๐Ÿ€‹๐žป๐žธ๐žธซ๐Ÿ™Ÿ๐žท‘๐žนง๐žฝต๐žธช๐žฟฌ๐Ÿœ’๐ŸŒ–๐Ÿˆˆ๐ŸŠ€๐ŸŠž๐Ÿ™ž๐žน‡๐žธฉ๐žนฅ๐žฝณ๐žป๐žพฏ๐žฝณ๐žฟ๐žถ“๐Ÿœ๐žต–๐Ÿ€ˆ๐žฝฒ๐žนค๐Ÿ“ด๐ŸŸ„๐žบพ๐žธŠ๐žธง๐ŸŸƒ๐Ÿš—๐Ÿƒ๐žบฝ๐Ÿ€‡๐žถ‘๐žด™๐Ÿ›ฐ๐Ÿšด๐Ÿœฌ๐Ÿƒถ๐žปš๐Ÿœฌ๐Ÿ›ฐ๐Ÿš–๐Ÿช’๐žถญ๐Ÿ’—๐Ÿœ๐žถญ๐Ÿ’—๐ŸŸ๐žท‹๐ŸŸ๐žฝฎ๐žธค๐ŸŸผ๐žน‚๐Ÿ™˜๐žน ๐žฟฆ๐žนพ๐žธ†๐žฟฅ๐žน๐žธฃ๐Ÿœ‹๐Ÿœ‹๐žถซ๐Ÿ’•๐Ÿ‘ท๐ŸœŠ๐žถช๐Ÿ›ฌ๐Ÿ›ฌ๐ŸœŠ๐žต๐ŸชŽ๐žบš๐Ÿœ๐žธก๐žพ‰",
 "๐Ÿ”„๐ŸŸ”๐Ÿ™Ž๐žฟบ๐žท€๐žธธ๐žนด๐Ÿฒ๐Ÿ™Ž๐žพฝ๐Ÿฑ๐žผ‰๐žฟน๐Ÿ•๐Ÿ˜ฏ๐ŸŸ“๐Ÿšง๐Ÿ“๐žผฆ๐žปŒ๐Ÿ€ด๐žฝ„๐žพ€๐žปช๐žพผ๐Ÿ”‚๐žฟ™๐Ÿฏ๐žผฅ๐žน“๐žฟท๐Ÿšฅ๐žฝฟ๐Ÿ€•๐žฟท๐žผ†๐žบฌ๐žปŠ๐žธด๐žฟถ๐žปจ๐žธด๐Ÿ”€๐žธณ๐žนฏ๐žธ•๐žฟต๐Ÿšฃ๐ŸชŸ๐žพ›",
 "๐žฟบ๐Ÿฒ๐Ÿ€˜๐žฟบ๐žนด๐žน–๐Ÿ”„๐žตฆ๐Ÿ€ถ๐žป๐žป๐žฝ…๐žพ๐žฟน๐Ÿ”ƒ๐Ÿ€ต๐žป๐žป๐žฝ„๐žพ€๐žฟธ๐Ÿšฆ๐Ÿ™ช๐Ÿ™ช๐Ÿ™ช๐Ÿ’๐žป‹๐Ÿ€•๐žถŸ๐Ÿ‘ซ๐žตฃ๐Ÿœป๐Ÿ€ณ๐žป‹๐žปฉ๐žธด๐žฟถ๐žปจ๐žธด๐Ÿš†๐žธด๐žถž๐žบฌ๐žฟต๐Ÿœน๐Ÿ“ฟ๐Ÿœน๐Ÿญ๐žบซ๐žบซ๐žผฃ๐žฝฝ๐Ÿ€ฐ๐Ÿฌ๐žธฒ๐žฝผ๐žปˆ๐žปฆ๐Ÿ™ˆ๐žฝž๐žน๐žป‡๐žปฅ๐Ÿœท๐žดฃ๐Ÿช๐Ÿ“ฝ๐žตŸ๐žดฃ๐žดข๐Ÿš ๐ŸŒ๐žป†๐Ÿ€๐žถš๐Ÿ“ผ๐ŸŒ๐žป…๐Ÿ€๐žถ™๐Ÿ‘ฅ๐ŸŒ›๐Ÿˆ๐ŸŠ…๐ŸŠฃ๐Ÿ™ฃ๐žนŒ๐žธฎ๐žนช๐žฝธ๐žปข๐žพด๐žฝธ๐žฟ’๐žถ—๐Ÿœ•๐Ÿ‰๐žปƒ๐Ÿ€๐žถ—๐Ÿ›ท๐Ÿ“น๐žปก๐žธŽ๐žผœ๐žผœ๐Ÿšœ๐Ÿช˜๐žปพ๐žฟฎ๐žธฌ๐žพ“",
 "๐žปŽ๐Ÿ€˜๐Ÿ”„๐Ÿ”๐žปŽ๐Ÿ€˜๐žถข๐Ÿ‘ฎ๐ŸŸ”๐Ÿ‰ฏ๐ŸŠ๐Ÿˆ•๐Ÿ‡ท๐ŸŸ“๐Ÿ”ƒ๐ŸŸ“๐Ÿฝ๐ŸŽน๐Ÿ‡ถ๐ŸŸ’๐žดจ๐Ÿœ€๐Ÿœ€๐Ÿœ€๐Ÿšฆ๐žถพ๐Ÿ’ง๐Ÿฏ๐žท›๐Ÿฏ๐žฝฟ๐žธต๐Ÿœ๐Ÿฏ๐žน“๐žถž๐žปจ๐Ÿ€ฒ๐Ÿœœ๐Ÿ›พ๐Ÿ’ฆ๐Ÿ’ˆ๐Ÿœœ๐žถป๐Ÿ’ฅ๐Ÿญ๐žท™๐Ÿญ๐žฝฝ๐žธณ๐Ÿ ‹๐žถป๐Ÿ™ฆ๐ŸŽ๐žปˆ๐Ÿ€’๐žถœ๐Ÿ™ฆ๐žธฒ๐žฟด๐žถน๐žธฑ๐Ÿœ™๐Ÿ›ป๐Ÿšก๐ŸŒ๐Ÿˆ๐ŸŠ‡๐ŸŠฅ๐Ÿ™ค๐žบจ๐Ÿช๐žนฌ๐žนŽ๐žฟฒ๐Ÿœ˜๐žถธ๐Ÿ›น๐Ÿ›น๐Ÿ›น๐Ÿœ—๐žถท๐Ÿ›น๐Ÿช›๐Ÿ™ฃ๐Ÿ€ญ๐Ÿจ๐žธฎ๐Ÿ€ฌ๐žพ–",
 "๐Ÿœ ๐Ÿฒ๐žน–๐žถข๐žปฌ๐Ÿ€ถ๐Ÿœ ๐žฟบ๐Ÿœ‚๐Ÿ’ฉ๐Ÿ’‹๐žตฅ๐Ÿ€ต๐žป๐žปซ๐žน•๐žป๐žผง๐žฟธ๐Ÿ™ช๐žฟธ๐žนฒ๐žนฒ๐žปŒ๐žนฒ๐Ÿœž๐žถฝ๐Ÿ›ฟ๐Ÿ“ฃ๐žธต๐žพ",
 "๐žนด๐žปŽ๐žทž๐Ÿ ๐žฟบ๐žดช๐Ÿœ‚๐Ÿšจ๐Ÿœ ๐žบฏ๐žนณ๐žป๐Ÿ€ต๐žฟน๐žน•๐žน•๐Ÿ™ซ๐žน•๐žธถ๐Ÿ€–๐žปŒ๐žธ˜๐žธถ๐Ÿ™ช๐Ÿ‚ฌ๐žธถ๐žถŸ๐žบญ๐žฟท๐ŸŸฏ๐Ÿ’ง๐Ÿœป๐žธต๐žธต๐žถŸ๐Ÿœบ๐Ÿ˜๐Ÿ˜๐Ÿช ๐žบฌ๐žนฐ๐žปŠ๐Ÿ€ฒ๐žฟต๐žน‘๐žน‘๐Ÿ™ง๐žน‘๐žธณ๐Ÿ€“๐žป‰๐žธ•๐žธฒ๐Ÿ™ฆ๐žท˜๐žนฎ๐žฝผ๐žธฒ๐žฟด๐Ÿœš๐ŸŒ๐Ÿˆ๐ŸŠ‡๐ŸŠฅ๐Ÿ™ฅ๐žน๐žธฑ๐žนญ๐žฝป๐žปค๐žพถ๐žฝบ๐žฟ”๐žถš๐Ÿœ˜๐žตž๐Ÿ€๐žฝน๐žนซ๐Ÿ“ป๐ŸŸ‹๐žฝน๐žปฃ๐ŸŸ‹๐ŸšŸ๐Ÿ‹๐žป„๐Ÿ€Ž๐žถ˜๐Ÿ“บ๐žถถ๐žด ๐Ÿ›ธ๐Ÿšผ๐Ÿœณ๐Ÿƒฝ๐žปก๐Ÿœณ๐Ÿ›ท๐Ÿš๐Ÿœ•๐ŸŸง๐žพณ๐Ÿ›ถ๐žดผ๐žดผ๐Ÿœ”๐žพฒ๐Ÿ™ ๐žนŠ๐Ÿ‘ข๐Ÿ‘ก๐Ÿ˜…๐Ÿ™๐Ÿ˜ฃ๐Ÿ›ต๐Ÿ’ป๐Ÿœ“๐žถณ๐Ÿ™Ÿ๐žนˆ๐Ÿ‘ ๐Ÿ‘ ๐Ÿ˜„๐Ÿ™€๐Ÿ˜ข๐Ÿ›ด๐Ÿ›ด๐Ÿช•๐Ÿ๐Ÿ๐Ÿœ‘๐žพฏ๐Ÿ’›๐žถฑ๐Ÿš™๐Ÿ€‰๐Ÿ™œ๐Ÿ€ฆ๐žบพ๐žปœ๐Ÿ™œ๐Ÿ€ฆ๐žผ˜๐žฟช๐Ÿข๐žนฃ๐Ÿœ๐Ÿ›ฑ๐Ÿš—๐Ÿ€‡๐Ÿ™›๐Ÿ€ฅ๐žบฝ๐žปš๐Ÿ™š๐žผ–๐žบผ๐žพฌ๐ŸœŽ๐ŸœŽ๐žถฎ๐Ÿ™š๐žนƒ๐Ÿ€ฃ๐žบป๐žนก๐žฟง๐ŸŸŸ๐Ÿ’—๐žป™๐žธ†๐žผ”๐žผ”๐Ÿ›ฎ๐Ÿˆ๐Ÿˆ๐žถฌ๐Ÿ™˜๐žพช๐žนŸ๐žฝญ๐Ÿ€ƒ๐Ÿ‘™๐Ÿช๐Ÿป๐Ÿƒณ๐žป—๐Ÿƒฒ๐žธข๐žน€๐Ÿ€ ๐žบธ๐žนž๐žฟค๐Ÿ“ฎ๐ŸŸบ๐Ÿž๐žต๐žถฉ๐Ÿ™•๐žธฟ๐Ÿ€Ÿ๐žบท๐žน๐žฟข๐žด’๐Ÿƒฐ๐žป”๐Ÿƒฐ๐žป”๐Ÿž€๐žตŽ๐žถจ๐Ÿ™“๐žพฅ๐žน›๐žฝฉ๐žฟฟ๐Ÿ™“๐žธฝ๐žบ—๐žผŽ๐žฝจ๐žธž๐Ÿœ†๐Ÿœค๐Ÿƒฎ๐žป’๐Ÿœค๐Ÿ›จ๐Ÿ™‘๐žปฏ๐Ÿ—๐žบ•๐Ÿœ…๐žฟŸ๐Ÿ’๐Ÿ‘ฑ๐Ÿœข๐Ÿƒฌ๐žธœ๐Ÿœข๐Ÿšช๐žฟž๐Ÿ›ฆ๐Ÿ™๐žฝˆ๐žบฑ๐žฝฅ๐žป๐Ÿœƒ๐Ÿœก๐Ÿƒซ๐žป๐Ÿœก๐Ÿœ‚๐žดช๐Ÿ‚๐Ÿ”„๐žท€๐Ÿšจ๐Ÿ€˜๐Ÿ™ฌ๐žผŠ๐žน•๐žพฝ๐žต‡๐žต‡๐ŸŸ“๐ŸŸ“๐Ÿœ๐Ÿœ๐Ÿœ๐Ÿœ€๐Ÿœž๐žน”๐Ÿœ€๐Ÿ“ค๐Ÿ€–๐Ÿ’จ๐žตค๐žดง๐Ÿ“ฃ๐Ÿชก๐Ÿ€•๐Ÿ™ฉ๐žน“๐Ÿ’ง๐Ÿ‚ซ๐Ÿ’ง๐Ÿ’ˆ๐žพบ๐Ÿ™จ๐žพบ๐žนฐ๐žฝพ๐Ÿ€”๐Ÿ“ข๐Ÿ€“๐Ÿ™ง๐žบซ๐žบซ๐Ÿ’ฅ๐ŸŸญ๐ŸŸญ๐Ÿœ›๐žน‘๐žบช๐Ÿฌ๐žผ„๐Ÿ‘จ๐Ÿ‘จ๐Ÿ˜ช๐Ÿ›ผ๐Ÿ“ ๐Ÿ€‘๐Ÿ™ฅ๐Ÿ€ฏ๐žป‡๐žปฅ๐Ÿ’ฃ๐žปฅ๐žฟณ๐žท—๐Ÿ ˆ๐Ÿ€ฎ๐žป†๐žปค๐žนŽ๐žป†๐žผ ๐žฟฒ๐Ÿ™ฃ๐Ÿญ๐žป…๐žปฃ๐žน๐žป…๐žผŸ๐žฟฑ๐Ÿœ—๐žบฆ๐žนช๐žป„๐Ÿ€ฌ๐žฟฐ๐žนŒ๐žนŒ๐Ÿ™ข๐žน‹๐žธญ๐Ÿ€๐žฟฏ๐žนฉ๐žนฉ๐Ÿ›ท๐Ÿ“›๐Ÿ€๐Ÿ™ ๐Ÿ€ช๐žป‚๐žป ๐Ÿ™ ๐žผœ๐žป‚๐žพฒ๐Ÿœ“๐ŸŸ‡๐Ÿ€ฉ๐žป๐žปŸ๐žปŸ๐žฟญ๐Ÿ€ฉ๐žธซ๐žฝด๐žป€๐žปž๐ŸŸ†๐Ÿ›ด๐Ÿ“˜๐Ÿช–๐Ÿ„˜๐Ÿ€‰๐Ÿ™๐žผ™๐Ÿš™๐Ÿ€‰๐Ÿ™๐žนฅ๐Ÿš™๐Ÿ€‰๐Ÿ™œ๐žธŠ๐Ÿš˜๐Ÿ€ˆ๐Ÿ™œ๐Ÿ€ˆ๐Ÿƒš๐Ÿ’š๐Ÿ„–๐Ÿœญ๐žผ—๐žฟฉ๐žฟ‹๐žธง๐Ÿœญ๐Ÿš—๐Ÿœญ๐žนข๐žฝฐ๐žพฌ๐žพŽ",
 "๐žธธ๐Ÿœพ๐Ÿšจ๐Ÿœพ๐žธš๐žบฐ๐Ÿœพ๐Ÿšจ๐Ÿœพ๐Ÿ€—๐žป๐žท๐žปซ๐Ÿœฝ๐Ÿƒฉ๐Ÿชฃ๐Ÿ™ซ๐žผ‰๐Ÿฐ๐žบฎ๐Ÿœž๐Ÿœž๐Ÿ€–๐Ÿšฆ๐žบฎ๐Ÿœ€๐Ÿ’ง๐Ÿ’‰๐Ÿ‚ซ๐Ÿ’ง๐Ÿ’‰๐žตฃ๐Ÿ‘๐Ÿ™ฉ๐Ÿฏ๐Ÿ€”๐Ÿ€”๐Ÿœœ๐žบฌ๐Ÿ’ฆ๐žน’๐Ÿœœ๐žตข๐Ÿ€“๐žฝฝ๐žนฏ๐Ÿ“ฟ๐Ÿ€“๐žดฅ๐Ÿ›ฝ๐Ÿ™ง๐žธณ๐žพš",
 "๐žฟบ๐žปฌ๐Ÿœ ๐Ÿ‚ฎ๐Ÿ’ช๐Ÿ’Œ๐Ÿ”๐Ÿ™ฌ๐Ÿ€˜๐žฟน๐žผง๐žฟน๐žธท๐žฟน๐ŸœŸ๐žบฏ๐Ÿœ๐Ÿœ๐Ÿœ€๐žดจ๐Ÿœ€๐Ÿ“ค๐Ÿ€–๐Ÿ™ช๐žถพ๐Ÿ’จ๐žถฝ๐Ÿ’ง๐Ÿ’‰๐žน“๐Ÿœ๐Ÿ›ฟ๐Ÿ“ฃ๐Ÿชก๐žท›๐žพœ",
 "๐žพ‚๐žผจ๐žฟบ๐Ÿœ ๐Ÿ˜’๐Ÿœ‚๐žธธ๐žนด๐žถข๐žตฅ๐Ÿฑ๐žท๐Ÿฑ๐žพ๐žธท๐Ÿ ๐žน•๐ŸœŸ๐Ÿœ€๐Ÿ“ค๐Ÿ’๐žนฒ๐žฟธ๐Ÿฐ๐žฝ„๐žดจ๐Ÿ€ณ๐Ÿฏ๐žธต๐Ÿ€ณ๐žพ",
 "๐Ÿœ ๐žฟบ๐Ÿœ‚๐žตฆ๐Ÿ€ถ๐žปŽ๐žปฌ๐žน–๐žปŽ๐žผง๐žฟน๐Ÿ™ซ๐žฟน๐žนณ๐žนณ๐žป๐žนณ๐ŸœŸ๐žฟธ๐Ÿœ€๐Ÿ“ค๐Ÿฐ๐žทœ๐Ÿฐ๐žพ€๐žธถ๐Ÿ ๐žบ๐Ÿœ๐Ÿ˜๐Ÿ˜ญ๐Ÿ˜ญ๐Ÿ˜ญ๐Ÿ›ฟ๐žดง๐žนฐ๐žฟถ๐žธด๐žธ–๐žนฐ๐žปจ๐Ÿ Œ๐Ÿ„ข๐Ÿ€“๐Ÿšฃ๐Ÿ๐Ÿƒฅ๐žดฅ๐Ÿ›ฝ๐Ÿœ›๐žนฏ๐žฟต๐žบŒ๐žธ”๐žฝผ๐žนฎ๐žฟด๐Ÿœš๐Ÿœธ๐žธ”๐žปฅ๐Ÿ€‘๐žฝป๐Ÿ€ฏ๐žฝป๐Ÿœท๐Ÿ›ป๐Ÿšก๐Ÿช๐ŸŒœ๐ŸˆŽ๐ŸŠ†๐ŸŠค๐Ÿ™ค๐žบจ๐Ÿช๐žนฌ๐žน๐žฟฑ๐Ÿœ—๐žนซ๐žฟฑ๐žบ‰๐žธ‘๐žฝน๐žนซ๐žฟฐ๐Ÿœ–๐Ÿœด๐žฟ’๐žนŒ๐Ÿœด๐Ÿ›ธ๐Ÿ™ข๐žนฉ๐žฟฏ๐Ÿง๐Ÿ€๐ŸŽ‘๐žฝท๐žผ๐žฟฏ๐Ÿˆ‹๐žถ–๐žป ๐Ÿ€ช๐Ÿœ”๐ŸŸˆ๐Ÿ€ช๐žป‚๐žป ๐žฟ๐žฝต๐žพฑ๐Ÿ™Ÿ๐žฝ—๐žน‰๐žป๐žปŸ๐ŸŸ‡๐Ÿ›ด๐Ÿ›ด๐Ÿ›ด๐Ÿ“ถ๐Ÿ™€๐Ÿ™€๐Ÿ’บ๐Ÿ™ผ๐Ÿ™ป๐Ÿ™ป๐Ÿ™ป๐Ÿ ๐Ÿง๐žบฟ๐žป๐žฟ๐žฝณ๐žพฎ๐Ÿ €๐žฟŒ๐žฝฒ๐žผ˜๐žฟช๐Ÿช”๐Ÿœ๐Ÿœ๐žน…๐Ÿš—๐Ÿ€‡๐Ÿš—๐žปน๐Ÿš—๐Ÿƒ๐Ÿš—๐žผด๐Ÿ›ฐ๐Ÿ’˜๐Ÿ‘บ๐žต”๐Ÿ€†๐Ÿ’˜๐žต”๐žน„๐Ÿ“ฑ๐Ÿœ๐žฟง๐Ÿ’—๐Ÿ‘น๐Ÿ‚›๐Ÿ’—๐Ÿ‘น๐žฟฆ๐Ÿ™˜๐žฝฎ๐žป˜๐žป˜๐žฟฆ๐žน ๐Ÿ‡ค๐žฟฆ๐žถซ๐žธฃ๐Ÿ›ญ๐Ÿœ‹๐žน๐Ÿป๐Ÿžก๐žน๐Ÿ€ ๐žนž๐žฟค๐žฟค๐žป–๐Ÿบ๐Ÿ›ฌ๐Ÿš’๐ŸชŽ๐žผ‘๐Ÿ“ญ๐žธฟ๐Ÿน๐ŸžŸ๐žผ‘๐žฟฃ๐žฟ…๐žธ ๐Ÿธ๐Ÿš๐žนœ๐Ÿ“ฌ๐žธพ๐Ÿธ๐Ÿžž๐žนœ๐žฝฉ๐žพฅ๐žพ‡",
 "๐žธธ๐Ÿ‚๐Ÿšจ๐žธš๐Ÿ”„๐žน–๐Ÿ‚๐Ÿžถ๐žธš๐žบฏ๐Ÿ‚๐Ÿšง๐Ÿ€—๐Ÿ”ƒ๐žน•๐Ÿ‚๐Ÿžต๐Ÿ€—๐žปŒ๐žทœ๐žปช๐Ÿ‚Ž๐žดจ๐Ÿ“ค๐Ÿชข๐žฝ„๐Ÿ’ง๐Ÿ„ฃ๐Ÿƒง๐Ÿ“ฃ๐Ÿ€•๐Ÿ™ฉ๐Ÿ‘๐Ÿ’ง๐žตฃ๐žดฆ๐Ÿ“ข๐Ÿ„ข๐Ÿ€”๐Ÿ™จ๐Ÿ๐Ÿ™จ๐žผค๐Ÿšฃ๐Ÿ€“๐Ÿ™ง๐Ÿ๐Ÿ™ง๐žนฏ๐Ÿšฃ๐Ÿ€“๐Ÿ™ง๐ŸŽ๐Ÿ™ฆ๐žธ”๐Ÿšข๐Ÿ€’๐Ÿ™ฆ๐ŸŽ๐Ÿ™ฆ๐Ÿ€‘๐Ÿƒฃ๐Ÿ’ฃ๐Ÿ„Ÿ๐Ÿ™ฅ๐Ÿ™ฅ๐Ÿ™ฅ๐Ÿซ๐žนญ๐žนฌ๐Ÿช๐žถš๐Ÿœ˜๐Ÿ–ฐ๐Ÿ›บ๐Ÿƒข๐Ÿชœ๐Ÿ™ฃ๐žผ๐Ÿฉ๐žบง๐Ÿœ—๐žฟฑ๐Ÿ’ก๐Ÿ’ƒ๐žปฃ๐žฟฐ๐žท”๐Ÿ †๐ŸˆŒ๐žฟฐ๐žธฎ๐Ÿœ–๐Ÿ›ธ๐Ÿ›ท๐Ÿ“›๐Ÿ€๐Ÿ™ก๐Ÿ‰๐Ÿ™ก๐žถต๐Ÿ’Ÿ๐žปก๐žธŽ๐žผœ๐žผœ๐Ÿ“š๐Ÿˆ๐Ÿ’ž๐žป ๐žฟฎ๐žท‘๐Ÿ ƒ๐Ÿˆ‰๐žฟญ๐žธซ๐Ÿœ“๐Ÿ›ต๐Ÿ“™๐Ÿ€‹๐Ÿ™ž๐žถฒ๐Ÿ’œ๐žถฒ๐Ÿ’œ๐Ÿ‘พ๐žฟŽ๐žฟฌ๐žธฉ๐Ÿ€ง๐žพ‘",
 "๐Ÿฒ๐žปฌ๐Ÿ€˜๐Ÿˆด๐žฟบ๐žปฌ๐Ÿ€˜๐žฟบ๐žนด๐ŸœŸ๐Ÿœ๐Ÿ“ฅ๐Ÿชฃ๐Ÿ„ฅ๐Ÿ€—๐Ÿ™ซ๐žผง๐Ÿšง๐Ÿ€–๐Ÿ™ช๐žนฒ๐Ÿšฆ๐Ÿ€–๐Ÿ™ช๐žธ˜๐Ÿšฆ๐Ÿ€•๐Ÿ™ฉ๐Ÿ€•๐Ÿƒง๐Ÿ’ง๐Ÿ„ฃ๐Ÿ„ฃ๐Ÿ€•๐Ÿ™ฉ๐žผค๐Ÿšค๐Ÿ€”๐Ÿ™จ๐Ÿ๐Ÿ™จ๐žนฐ๐Ÿšค๐Ÿ€“๐Ÿ™ง๐Ÿ๐Ÿ™ง๐žผฃ๐Ÿƒฅ๐Ÿšฃ๐Ÿ„ก๐Ÿ€“๐Ÿ™ฆ๐žนฎ๐Ÿšข๐Ÿ€’๐Ÿ™ฆ๐ŸŽ๐Ÿ™ฆ๐žผข๐Ÿšก๐Ÿ€‘๐Ÿ™ฅ๐Ÿ๐Ÿ™ฅ๐žนญ๐Ÿƒฃ๐Ÿšก๐Ÿช๐Ÿ„ž๐Ÿ€๐Ÿ™ค๐žธ’๐Ÿš ๐Ÿ€๐Ÿ™ค๐ŸŒ๐Ÿ™ฃ๐Ÿ€๐ŸšŸ๐Ÿ€๐Ÿ™ฃ๐Ÿ‹๐Ÿ™ฃ๐žธ‘๐Ÿƒก๐Ÿšž๐Ÿ„œ๐Ÿ€Ž๐Ÿ™ข๐Ÿ€Ž๐Ÿšž๐Ÿ€Ž๐Ÿ™ข๐Ÿ‰๐Ÿ™ก๐žธ๐Ÿš๐Ÿ€๐Ÿ™ก๐Ÿ‰๐Ÿ™ก๐Ÿ€๐Ÿƒž๐Ÿƒž๐Ÿ™ ๐žปพ๐Ÿฆ๐žบค๐Ÿœ”๐Ÿœ”๐Ÿ„™๐žฟ๐Ÿš›๐žน‰๐Ÿš›๐žพ“",
 "๐Ÿƒช๐Ÿœ‚๐Ÿ’ช๐Ÿ’Œ๐Ÿœ ๐Ÿฒ๐žน–๐žถข๐žปฌ๐Ÿ€ต๐ŸœŸ๐žบฏ๐Ÿœ๐Ÿ’ฉ๐Ÿ’‹๐žตฅ๐žพ๐žฟ›๐Ÿœž๐Ÿ€–๐Ÿ™ช๐Ÿ’๐Ÿ™ช๐žถพ๐Ÿœ€๐Ÿฐ๐žท›๐Ÿฏ๐žฝฟ๐žธต๐Ÿ ๐Ÿ€•๐Ÿ™ฉ๐Ÿ‘๐Ÿ™ฉ๐žถผ๐Ÿ“ข๐Ÿช ๐žฝพ๐žฟ˜๐Ÿœœ๐žน’๐Ÿ™จ๐žน‘๐žฝฝ๐žตฟ๐žฟต๐Ÿ’‡๐Ÿ˜ซ๐Ÿ›ฝ๐žบซ๐Ÿ’ฅ๐Ÿ‰ช๐žนฎ๐žปˆ๐žผ„๐žฝผ๐žน๐žฟด๐Ÿ™ฆ๐Ÿซ๐žผก๐žผก๐Ÿœ™๐žน๐Ÿ›ป๐Ÿšก๐Ÿ๐Ÿ™ฅ๐Ÿช๐Ÿ€๐Ÿ€๐Ÿœ˜๐Ÿ€๐Ÿ™ค๐ŸŒ๐Ÿ™ค๐žถท๐Ÿ’ก๐žบง๐Ÿช›๐Ÿ’ก๐žบง๐Ÿ™ฃ๐žธฏ๐žพ—",
 "๐žฟบ๐žปฌ๐Ÿœ ๐žทผ๐Ÿ’ช๐Ÿ’Œ๐Ÿœ ๐Ÿ”๐Ÿ™ฌ๐Ÿ€—๐žฟน๐žผง๐žฟน๐žธท๐žฟน๐ŸœŸ๐žบฏ๐Ÿœ๐Ÿšฆ๐Ÿ€–๐Ÿ™ช๐Ÿ’๐Ÿ™ช๐žถพ๐Ÿ’จ๐žปช๐žธ—๐žผฅ๐žผฅ๐Ÿšฅ๐žทน๐Ÿ›ฟ๐Ÿ›ฟ๐Ÿ›ฟ๐Ÿšฅ๐Ÿฎ๐žทš๐Ÿฎ๐žฝพ๐žธด๐Ÿ Œ๐žบฌ๐Ÿ“ข๐ŸชŸ๐žฝ๐Ÿ™ง๐žบซ๐žธ•๐žน‘๐žพ›",
 "๐Ÿœ ๐žบฐ๐Ÿ’ช๐Ÿ’Œ๐žพ ",
 "๐Ÿ™ฌ๐Ÿฒ๐Ÿ€˜๐Ÿ€˜๐Ÿœ ๐žบฐ๐Ÿ’ช๐žบฐ๐Ÿ™ฌ๐žธท๐žพŸ",
 "๐žฟบ๐žปฌ๐Ÿœ ๐žทผ๐Ÿ’ช๐Ÿ’Œ๐Ÿœ ๐žพ ",
 "๐Ÿ™ฌ๐Ÿ€˜๐žฟบ๐žผจ๐žฟบ๐žธธ๐žฟบ๐Ÿœ ๐žบฐ๐Ÿœ๐Ÿšง๐žทป๐Ÿœ๐Ÿœ๐Ÿœ๐Ÿœ๐Ÿ“ฅ๐žฟ›๐Ÿ™ช๐Ÿ€ด๐žผฆ๐žพ€๐Ÿ€ด๐žฝ„๐Ÿœž๐Ÿœ€๐žดง๐Ÿ›ฟ๐Ÿ›ฟ๐Ÿ“ฃ๐Ÿชก๐žฟ™๐žฟท๐žธต๐Ÿ€ณ๐žพœ",
 "๐Ÿฒ๐žปฌ๐Ÿ€˜๐Ÿˆด๐žฟบ๐žปฌ๐Ÿ€˜๐žฟบ๐žนด๐Ÿ’ฉ๐ŸœŸ๐žฟ›๐Ÿ’ฉ๐Ÿ’‹๐žฟ›๐žธ™๐žปซ๐Ÿ€ต๐žธถ๐žพ€๐žปŒ๐žปช๐Ÿœž๐Ÿ™ช๐Ÿ™ช๐Ÿ™ช๐Ÿฏ๐žนฑ๐žพป๐žน“๐Ÿ›ฟ๐žตฃ๐žผฅ๐žฟท๐žธต๐Ÿ Œ๐žบฌ๐Ÿ’ฆ๐žฟ˜๐Ÿœœ๐Ÿ™จ๐Ÿ™จ๐Ÿ™จ๐Ÿญ๐žนฏ๐žพน๐žน‘๐Ÿ›ฝ๐Ÿ“ก๐ŸชŸ๐žฝฝ๐žฟ—๐Ÿœš๐žฝ€๐Ÿ™ฆ๐žผข๐žฟด๐žปฆ๐žพธ๐žธฒ๐žพ™",
 "๐Ÿ’Œ๐Ÿ˜ฐ๐Ÿœ‚๐žฝ†๐Ÿ™ฌ๐žบฐ๐žปŽ๐žบฐ๐Ÿœ ๐Ÿœ๐ŸœŸ๐žบฏ๐Ÿœ๐Ÿ“ฅ๐Ÿ“๐Ÿ™ซ๐Ÿฑ๐Ÿ€—๐Ÿ€–๐Ÿœž๐žบฎ๐Ÿ’จ๐žบฎ๐Ÿ™ช๐žธถ๐žพž",
 "๐žฟบ๐žปฌ๐Ÿœ ๐žทผ๐Ÿ’ช๐Ÿ’Œ๐Ÿœ ๐Ÿ”๐Ÿ™ฌ๐Ÿ€—๐žฟน๐žผง๐žฟน๐žธท๐žฟน๐ŸœŸ๐žบฏ๐Ÿœ๐Ÿšฆ๐žทบ๐Ÿœ€๐Ÿœ€๐Ÿœ€๐Ÿ“ค๐žนฒ๐žฟธ๐žธต๐žธ—๐žนฑ๐žปฉ๐Ÿ ๐žบญ๐žดง๐Ÿ›ฟ๐Ÿœ๐žฟ˜๐žฟถ๐žธด๐Ÿ€ฒ๐žพœ",
 "๐Ÿฒ๐žปฌ๐Ÿ€˜๐Ÿˆด๐žฟบ๐žปฌ๐Ÿ€˜๐žฟบ๐žนด๐Ÿœ๐Ÿ“ฅ๐Ÿชฃ๐žนณ๐žฟน๐žธท๐žธ™๐žนณ๐žปซ๐Ÿ Ž๐Ÿ„ค๐Ÿ€–๐Ÿšฆ๐Ÿ’๐Ÿƒจ๐žดจ๐Ÿœ€๐Ÿœ๐žถฝ๐Ÿ’ง๐Ÿ’‰๐Ÿ€•๐žป‹๐Ÿ€ณ๐žธ—๐žผ‡๐žฟถ๐žปจ๐žธด๐Ÿ™จ๐žบŽ๐žธ–๐žฟถ๐žนฐ๐žถ๐Ÿˆ‘๐žฟต๐žผฃ๐žฟต๐Ÿ€ฑ๐žธณ๐žป‰๐žนฏ๐Ÿœš๐žถบ๐Ÿ›ผ๐Ÿ›ผ๐Ÿ›ผ๐Ÿ“ ๐Ÿชž๐žฟด๐žปฅ๐žธฑ๐žนญ๐žถ›๐Ÿœ™๐Ÿ›ป๐žดฃ๐Ÿ›ป๐Ÿœ™๐Ÿœ˜๐žปค๐Ÿš ๐žบจ๐Ÿ›บ๐Ÿ’ข๐Ÿ’„๐Ÿœ˜๐žปฃ๐žฟฑ๐žท•๐Ÿ ‡๐Ÿ‰ง๐žนซ๐žป…๐žผ๐žฝน๐žนŒ๐žฟฐ๐Ÿœ–๐žฟ’๐Ÿ’ ๐Ÿ’‚๐žนŒ๐žฟฐ๐žธญ๐Ÿ‡ญ๐žฝท๐žปฟ๐žฟฏ๐žปƒ๐žธ๐žธญ๐Ÿœ•๐žฟ๐Ÿšœ๐žป ๐Ÿ›ถ๐Ÿ›ถ๐Ÿ›ถ๐Ÿ›ถ๐Ÿช˜"
]).filter((_,i)=>i).join(''),eval(String.fromCodePoint(...[...q[0]].map(x=>(1.22e5-x.codePointAt())/.3e2))),(()=>{try{return require}catch{}})()])))()

round #69

submitted at
1 like

guesses
comments 0

post a comment


entry.scm ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
; step 1
(import (rename (rnrs(6)) (lambda h)(define s)
                          (begin z)(set! q)))

; step 2
(s entry(let*((g call-with-string-output-port)(j abs)(c expt)(p(h(b)(s i
0)(h()(q i(+ 1 i))(/ b(c 2(- i 1))))))(k log)(d(h(x)(c 2(exact(ceiling(/
(k(let((x(j x)))(if(= x 0)1 x)))(k 2)))))))(m display)(w write))(h(x)(
let((b(p(d x)))(y 0))(g(h(o)(m"x = "o)(do((n(b)(b))(i 0(+ 1 i)))((or(= y
x)(> i 1000)(<(j(let((f(j x)))(-(/ y f)(/ x f))))#e1e-9)))(let*((a(+ y n
))(b(- y n))(u(j(- x a)))(v(j(- x b))))(if(< u v)(z(q y a)(m(if(= i 0)""
" + ")o)(w n o))(z(q y b)(m(if(= i 0)"-"" - ")o)(w n o)))))(if(= y 0)(m
0 o)0)))))))

; step 3
(s(main args)(apply(h(_ x)(display(entry(string->number x)))
(display "\n"))args))(main (command-line))

round #68

submitted at
1 like

guesses
comments 3
cdr sa ยถ

epIc me jumpscare


jan Sana ยถ

does this contain truth


kimapr known at the time as [author of #6] replying to jan Sana ยถ

merely pleasing false statements


post a comment


Makefile ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
none:
	# do nothing

CODEGUESS = \
	codeguess-unpacked/1 \
	codeguess-unpacked/2 \
	codeguess-unpacked/3 \
	codeguess-unpacked/4 \
	codeguess-unpacked/5 \
	codeguess-unpacked/6 \
	codeguess-unpacked/7 \
	codeguess-unpacked/8 \
	codeguess-unpacked/9 \
	codeguess-unpacked/10 \
	codeguess-unpacked/11 \
	codeguess-unpacked/12 \
	codeguess-unpacked/13 \
	codeguess-unpacked/14 \
	codeguess-unpacked/15 \
	codeguess-unpacked/16 \
	codeguess-unpacked/17 \
	codeguess-unpacked/18 \
	codeguess-unpacked/19 \
	codeguess-unpacked/20 \
	codeguess-unpacked/21 \
	codeguess-unpacked/22 \
	codeguess-unpacked/23 \
	codeguess-unpacked/24 \
	codeguess-unpacked/25 \
	codeguess-unpacked/26 \
	codeguess-unpacked/27 \
	codeguess-unpacked/28 \
	codeguess-unpacked/29 \
	codeguess-unpacked/30 \
	codeguess-unpacked/31 \
	codeguess-unpacked/32 \
	codeguess-unpacked/33 \
	codeguess-unpacked/34 \
	codeguess-unpacked/35 \
	codeguess-unpacked/36 \
	codeguess-unpacked/37 \
	codeguess-unpacked/38 \
	codeguess-unpacked/39 \
	codeguess-unpacked/40 \
	codeguess-unpacked/41 \
	codeguess-unpacked/42 \
	codeguess-unpacked/43 \
	codeguess-unpacked/44 \
	codeguess-unpacked/45 \
	codeguess-unpacked/46 \
	codeguess-unpacked/47 \
	codeguess-unpacked/48 \
	codeguess-unpacked/49 \
	codeguess-unpacked/50 \
	codeguess-unpacked/51 \
	codeguess-unpacked/52 \
	codeguess-unpacked/53 \
	codeguess-unpacked/54 \
	codeguess-unpacked/55 \
	codeguess-unpacked/56 \
	codeguess-unpacked/57 \
	codeguess-unpacked/58 \
	codeguess-unpacked/59 \
	codeguess-unpacked/60 \
	codeguess-unpacked/61 \
	codeguess-unpacked/62 \
	codeguess-unpacked/63 \
	codeguess-unpacked/64 \
	codeguess-unpacked/65 \
	codeguess-unpacked/66 \
	codeguess-unpacked/67 \

codeguess/%.tar.bz2:
	@mkdir -p codeguess
	@echo fetching $@
	@while ! curl --retry-all-errors --retry 1000000 -sS https://codeguessing.gay/$*.tar.bz2 > codeguess/$*.tar.bz2; do :; done
	@echo fetched $@

codeguess-unpacked/%: codeguess/%.tar.bz2
	@mkdir -p codeguess-unpacked
	cd codeguess-unpacked && tar xf ../codeguess/$*.tar.bz2

codeguess-all: $(CODEGUESS)

models.h: analyzer.scm $(CODEGUESS)
	ratio(){ echo | awk "{ a=$$(cat "$$@"|wc -c); b=$$(cat "$$@"|gzip|wc -c); print a/b }"; }; \
	find $(CODEGUESS) -name '.git' -prune -o -type f -print | while read line; do \
	if [ "$$(du -b "$$line" | grep -oE ^[0-9]\*)" -le 16384 ] && \
	[ $$(echo|awk "{ n=$$(ratio "$$line")>3?1:0; print n; }") = 1 ]; then \
	printf '%s\n' "$$line"; fi; done | \
	( echo 'static const struct model models[] = {'; \
	while read line; do printf '%s\n' "$$(wc -c "$$line")" >&2; \
	guile analyzer.scm < "$$line"; done; echo '};' ) > models.h

decipher: decipher.c models.h
	$(CC) -O3 decipher.c -o decipher
analyzer.scm ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
(import (rnrs (6)))
((lambda (fd-in fd-out)
   (define freq (make-vector 256 0))
   (letrec ((loop (lambda ()
                    (define char (get-u8 fd-in))
                    (if (not (eof-object? char))
                      (begin
                        (vector-set!
                          freq
                          char
                          (+ 1 (vector-ref freq char)))
                        (loop))))))
     (loop))
   (letrec ((loop (lambda (i)
                    (if (< i (vector-length freq))
                      (begin
                        (vector-set! freq i (cons i (vector-ref freq i)))
                        (loop (+ i 1)))))))
     (loop 0))
   (vector-sort!
     (lambda (sa ba) (> (cdr sa) (cdr ba)))
     freq)
   (define total
     (letrec ((loop (lambda (i c)
                      (if (< i (vector-length freq))
                        (loop (+ i 1) (+ c (cdr (vector-ref freq i))))
                        c))))
       (loop 0 0)))
   (if (> total 0)
     (letrec ((loop (lambda (i)
                      (if (< i (vector-length freq))
                        ((lambda ()
                           (define elem (vector-ref freq i))
                           (vector-set!
                             freq
                             i
                             (cons (car elem)
                                   (exact->inexact (/ (cdr elem) total))))
                           (loop (+ i 1))))))))
       (loop 0)))
   (put-string
     fd-out
     "\t(struct model) {\n\t\t.items = {\n")
   (letrec ((loop (lambda (i)
                    (if (< i (vector-length freq))
                      ((lambda ()
                         (define char (car (vector-ref freq i)))
                         (define ratio (cdr (vector-ref freq i)))
                         (put-string
                           fd-out
                           (string-append
                             "\t\t\t(struct char_freq) { .who = "
                             (if (and (<= 32 char) (> 127 char))
                               (let ((char (integer->char char)))
                                 (string-append
                                   "'"
                                   (if (or (eq? #\' char) (eq? #\\ char))
                                     "\\"
                                     "")
                                   (make-string 1 char)
                                   "'"))
                               (number->string char))
                             ", .when = "
                             (number->string ratio)
                             " },\n"))
                         (loop (+ i 1))))))))
     (loop 0))
   (put-string fd-out "\t\t}\n\t},\n"))
 (standard-input-port)
 (current-output-port))
decipher.c ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
#include <stdlib.h>
#include <stddef.h>
#include <stdio.h>

struct char_freq {
	char who;
	double when;
};

struct model {
	struct char_freq items[256];
};

#include "models.h"

#define lenof(obj) (sizeof(obj) / sizeof(*(obj)))

void halt_and_catch() {
	fprintf(stderr, "critical error occurred. please leave the building immediately\n");
	exit(1);
}

char *readfile(FILE *file, size_t *size) {
	int cap = 16;
	char *buf = malloc(cap);
	if (!buf) return NULL;
	int count = 0, c;
	while ((c=fgetc(file))!=EOF) {
		count++;
		if (count > cap) {
			char *buf_ = buf;
			if (!(buf = realloc(buf, (cap *= 2)))) {
				free(buf_);
				return NULL;
			}
		}
		buf[count-1] = c;
	}
	char *buf_ = buf;
	if (!(buf = realloc(buf, count))) {
		free(buf_);
		return NULL;
	}
	*size = count;
	return buf;
}

int sort_model_cb(const void *a_, const void *b_) {
	const struct char_freq *a = a_;
	const struct char_freq *b = b_;
	double diff = b->when - a->when;
	return diff < 0 ? -1 : (diff > 0 ? 1 : 0);
}

void sort_model(struct model *model) {
	qsort(model->items, 256, sizeof(*model->items), sort_model_cb);
}

double cmp_model(struct model *a, struct model *b) {
	double accum = 0;
	for (int i = 0; i < 256; i++) {
		double diff = (a->items[i].when - b->items[i].when);
		accum += diff * diff;
	}
	return accum;
}

void merge_model(const struct model *a, double a_weight, const struct model *b, struct model *out) {
	if (a_weight == 0) {
		*out = *b;
		return;
	}
	struct model b_raw;
	for (int i = 0; i < 256; i++) {
		b_raw.items[(unsigned char)b->items[i].who] = b->items[i];
	}
	for (int i = 0; i < 256; i++) {
		out->items[i] = (struct char_freq) {
			.who = a->items[i].who, .when =
				(a->items[i].when
				 + b_raw.items[(unsigned char)a->items[i].who].when)
				 / (a_weight+1)
		};
	}
	sort_model(out);
}

int analyze_buffer(const char *str, size_t size) {
	size_t freqs[256] = {0};
	for (int i = 0; i < size; i++) {
		freqs[(unsigned char)str[i]]++;
	}
	struct model model;
	for (int i = 0; i < 256; i++) {
		model.items[i] = (struct char_freq) {
			.who = i, .when = ((double)freqs[i])/size,
		};
	}
	sort_model(&model);
	double bestest_score = 1.0/0.0;
	struct model bestest_model;
	for (int d = 0 ;; d++) {
		double best_model_score = 1.0/0.0;
		struct model best_model;
		struct model new_model;
		for (int i = 0; i < lenof(models); i++) {
			merge_model(&bestest_model, d, &models[i], &new_model);
			double score = cmp_model(&model, &new_model);
			if (score < best_model_score) {
				best_model_score = score;
				best_model = new_model;
			}
		}
		if (best_model_score >= bestest_score) {
			break;
		}
		bestest_score = best_model_score;
		bestest_model = best_model;
	}
	char map[256];
	for (int i = 0; i < 256; i++) {
		map[(unsigned char)model.items[i].who] = bestest_model.items[i].who;
	}
	for (int i = 0; i < size; i++) {
		fputc(map[(unsigned char)str[i]], stdout);
	}
	return 0;
}

int analyze_file(FILE *file) {
	size_t size;
	char *data = readfile(file, &size);
	if (!(data && !analyze_buffer(data, size))) {
		return 1;
	}
	return 0;
}

int main(int argc, char **argv) {
	FILE *file = stdin;
	if(argc > 1) {
		file = fopen(argv[1], "rb");
		if (!file) {
			halt_and_catch();
		}
	}
	if (analyze_file(file)) {
		halt_and_catch();
	}
	return 0;
}

round #66

submitted at
1 like

guesses
comments 0

post a comment


666.c ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
#include <errno.h>
#include <fcntl.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <sys/mman.h>
#include <sys/time.h>
#include <sys/wait.h>
#include <time.h>
#include <unistd.h>

#define THE_SIZE 0x20000000000
// also known as 2 TiB

void sin(const char *err)
{
	fprintf(stderr, "fatal: sinful system%s%s\n", err ? ": " : "",
	        err ? err : "");
	exit(1);
}

typedef struct {
	uint8_t a : 4, b : 4;
} bitbyte_t;

typedef struct {
	uint64_t total;
	uint64_t off_8;
	uint64_t off_16;
	uint64_t off_32;
	uint64_t off_64;
	uint64_t data;
} data_t;

static data_t *data;

void *align(void *ptr, int ligma)
{
	return (void *)(((size_t)ptr + (ligma - 1)) & -ligma);
}

uint64_t get(uint64_t i)
{
	if (i >= data->total) {
		sin("sinful memory access");
	}

	char *ptr = (char *)&data->data;
	uint64_t off = 0;

	if ((data->off_8 - 1) <= i) {
		ptr += (data->off_8 - 1 - off) / 2 +
		       (data->off_8 - 1 - off) % 2;
		ptr = align(ptr, 1);
		off += data->off_8 - 1;
	} else {
		bitbyte_t *v = &((bitbyte_t *)ptr)[(i - off) / 2];
		return (i - off) % 2 ? v->b + 1 : v->a + 1;
	}

	if ((data->off_16 - 1) <= i) {
		ptr += 1 * (data->off_16 - 1 - off);
		ptr = align(ptr, 2);
		off += data->off_16 - 1;
	} else {
		return ((uint8_t *)ptr)[i - off] + 1;
	}

	if ((data->off_32 - 1) <= i) {
		ptr += 2 * (data->off_32 - 1 - off);
		ptr = align(ptr, 4);
		off += data->off_32 - 1;
	} else {
		return ((uint16_t *)ptr)[i - off] + 1;
	}

	if ((data->off_64 - 1) <= i) {
		ptr += 4 * (data->off_64 - 1 - off);
		ptr = align(ptr, 8);
		off += data->off_64 - 1;
	} else {
		return ((uint32_t *)ptr)[i - off] + 1;
	}

	return ((uint64_t *)ptr)[i - off] + 1;
}

void append(uint64_t val)
{
	uint64_t i = data->total++;

	if (val < 1) {
		sin("sinful data");
	}
	val--;

	if (val >= (1ULL << 4) && !data->off_8) {
		data->off_8 = i + 1;
	}

	if (val >= (1ULL << 8) && !data->off_16) {
		data->off_16 = i + 1;
	}

	if (val >= (1ULL << 16) && !data->off_32) {
		data->off_32 = i + 1;
	}

	if (val >= (1ULL << 32) && !data->off_64) {
		data->off_64 = i + 1;
	}

	char *ptr = (char *)&data->data;
	uint64_t off = 0;

	if ((data->off_8 - 1) <= i) {
		ptr += (data->off_8 - 1 - off) / 2 +
		       (data->off_8 - 1 - off) % 2;
		ptr = align(ptr, 1);
		off += data->off_8 - 1;
	} else {
		bitbyte_t *v = &((bitbyte_t *)ptr)[(i - off) / 2];
		(i - off) % 2 ? (v->b = val) : (v->a = val);
		return;
	}

	if ((data->off_16 - 1) <= i) {
		ptr += 1 * (data->off_16 - 1 - off);
		ptr = align(ptr, 2);
		off += data->off_16 - 1;
	} else {
		((uint8_t *)ptr)[i - off] = val;
		return;
	}

	if ((data->off_32 - 1) <= i) {
		ptr += 2 * (data->off_32 - 1 - off);
		ptr = align(ptr, 4);
		off += data->off_32 - 1;
	} else {
		((uint16_t *)ptr)[i - off] = val;
		return;
	}

	if ((data->off_64 - 1) <= i) {
		ptr += 4 * (data->off_64 - 1 - off);
		ptr = align(ptr, 8);
		off += data->off_64 - 1;
	} else {
		((uint32_t *)ptr)[i - off] = val;
		return;
	}

	((uint64_t *)ptr)[i - off] = val;
}

int generator(const char *path)
{
	int fd = open(path, O_RDWR | O_CREAT, 0644);
	if (fd == -1)
		sin(strerror(errno));
	if (truncate(path, THE_SIZE))
		sin(strerror(errno));

	data = mmap(NULL, THE_SIZE, PROT_READ | PROT_WRITE, MAP_SHARED,
	            fd, 0);

	if (data == MAP_FAILED)
		sin(strerror(errno));

	int column = 0;

	int human_readable = isatty(fileno(stdout));

	for (uint64_t i = 0; i < data->total; i++) {

		column += printf("%llu", (unsigned long long)get(i));

		if (!human_readable) {
			column = 100;
		}

		if (column > 72) {
			printf("\n");
			column = 0;
		} else {
			column += printf(" ");
		}
	}

	struct timespec ts_begin;
	clock_gettime(CLOCK_MONOTONIC, &ts_begin);

	for (;;) {

		uint64_t max_rep = 1;

		for (uint64_t stride = 1;
		     stride <= data->total / (max_rep + 1); stride++) {

			uint64_t rep;

			for (rep = 1; (rep + 1) <= data->total / stride;
			     rep++) {
				for (uint64_t i = 0; i < stride; i++) {
					if (get(data->total - 1 - i -
					        rep * stride) !=
					    get(data->total - 1 - i -
					        (rep - 1) * stride)) {
						goto repeat_out;
					}
				}
			}

		repeat_out:

			if (max_rep < rep) {
				max_rep = rep;
			}
		}

		column += printf("%llu", (unsigned long long)max_rep);

		if (!human_readable) {
			column = 100;
		}

		if (column > 72) {
			printf("\n");
			column = 0;
		} else {
			column += printf(" ");
		}

		struct timespec ts_end;
		clock_gettime(CLOCK_MONOTONIC, &ts_end);

		if ((ts_end.tv_sec * 1000 + ts_end.tv_nsec / 1000000) -
		        (ts_begin.tv_sec * 1000 +
		         ts_end.tv_nsec / 1000000) >
		    50) {
			fflush(stdout);
			clock_gettime(CLOCK_MONOTONIC, &ts_begin);
		}

		append(max_rep);
	}

	return 0;
}

int main()
{
	const char *cfg_home = getenv("XDG_CONFIG_HOME");

	if (!cfg_home) {

		const char *home = getenv("HOME");
		if (!home) {
			return generator("/tmp/cg666.bin");
		}

		char path[strlen(home) +
		          sizeof("/.config/cg666/data.bin")];
		path[0] = '\0';

		strcat(path, home);
		strcat(path, "/.config/cg666");

		pid_t pid;
		if (!fork()) {
			if (execl("/usr/bin/env", "/usr/bin/env",
			          "mkdir", "-p", "--", path, NULL))
				sin(strerror(errno));
			return 0;
		}
		int status;
		if (waitpid(pid, &status, 0) == -1) {
			sin(strerror(errno));
		} else if (status != 0) {
			sin("mkdir is a sinner");
		}

		strcat(path, "/data.bin");
		return generator(path);

	} else {

		char path[strlen(cfg_home) + sizeof("/cg666/data.bin")];
		path[0] = '\0';

		strcat(path, cfg_home);
		strcat(path, "/cg666");

		pid_t pid;
		if (!fork()) {
			if (execl("/usr/bin/env", "/usr/bin/env",
			          "mkdir", "-p", "--", path, NULL))
				sin(strerror(errno));
			return 0;
		}
		int status;
		if (waitpid(pid, &status, 0) == -1) {
			sin(strerror(errno));
		} else if (status != 0) {
			sin("mkdir is a sinner");
		}

		strcat(path, "/data.bin");
		return generator(path);
	}
}

round #64

submitted at
0 likes

guesses
comments 3
olus2000 ยถ

Can we get an embed of this?


cdr sa ยถ

can we get an Imbed of thIs?


ponydork ยถ

Can we get an iFrame of this?


post a comment


index.html ASCII text, with very long lines (30323)

round #62

submitted at
0 likes

guesses
comments 0

post a comment


emacs.lua Unicode text, UTF-8 text
   1
   2
   3
   4
   5
   6
   7
   8
   9
  10
  11
  12
  13
  14
  15
  16
  17
  18
  19
  20
  21
  22
  23
  24
  25
  26
  27
  28
  29
  30
  31
  32
  33
  34
  35
  36
  37
  38
  39
  40
  41
  42
  43
  44
  45
  46
  47
  48
  49
  50
  51
  52
  53
  54
  55
  56
  57
  58
  59
  60
  61
  62
  63
  64
  65
  66
  67
  68
  69
  70
  71
  72
  73
  74
  75
  76
  77
  78
  79
  80
  81
  82
  83
  84
  85
  86
  87
  88
  89
  90
  91
  92
  93
  94
  95
  96
  97
  98
  99
 100
 101
 102
 103
 104
 105
 106
 107
 108
 109
 110
 111
 112
 113
 114
 115
 116
 117
 118
 119
 120
 121
 122
 123
 124
 125
 126
 127
 128
 129
 130
 131
 132
 133
 134
 135
 136
 137
 138
 139
 140
 141
 142
 143
 144
 145
 146
 147
 148
 149
 150
 151
 152
 153
 154
 155
 156
 157
 158
 159
 160
 161
 162
 163
 164
 165
 166
 167
 168
 169
 170
 171
 172
 173
 174
 175
 176
 177
 178
 179
 180
 181
 182
 183
 184
 185
 186
 187
 188
 189
 190
 191
 192
 193
 194
 195
 196
 197
 198
 199
 200
 201
 202
 203
 204
 205
 206
 207
 208
 209
 210
 211
 212
 213
 214
 215
 216
 217
 218
 219
 220
 221
 222
 223
 224
 225
 226
 227
 228
 229
 230
 231
 232
 233
 234
 235
 236
 237
 238
 239
 240
 241
 242
 243
 244
 245
 246
 247
 248
 249
 250
 251
 252
 253
 254
 255
 256
 257
 258
 259
 260
 261
 262
 263
 264
 265
 266
 267
 268
 269
 270
 271
 272
 273
 274
 275
 276
 277
 278
 279
 280
 281
 282
 283
 284
 285
 286
 287
 288
 289
 290
 291
 292
 293
 294
 295
 296
 297
 298
 299
 300
 301
 302
 303
 304
 305
 306
 307
 308
 309
 310
 311
 312
 313
 314
 315
 316
 317
 318
 319
 320
 321
 322
 323
 324
 325
 326
 327
 328
 329
 330
 331
 332
 333
 334
 335
 336
 337
 338
 339
 340
 341
 342
 343
 344
 345
 346
 347
 348
 349
 350
 351
 352
 353
 354
 355
 356
 357
 358
 359
 360
 361
 362
 363
 364
 365
 366
 367
 368
 369
 370
 371
 372
 373
 374
 375
 376
 377
 378
 379
 380
 381
 382
 383
 384
 385
 386
 387
 388
 389
 390
 391
 392
 393
 394
 395
 396
 397
 398
 399
 400
 401
 402
 403
 404
 405
 406
 407
 408
 409
 410
 411
 412
 413
 414
 415
 416
 417
 418
 419
 420
 421
 422
 423
 424
 425
 426
 427
 428
 429
 430
 431
 432
 433
 434
 435
 436
 437
 438
 439
 440
 441
 442
 443
 444
 445
 446
 447
 448
 449
 450
 451
 452
 453
 454
 455
 456
 457
 458
 459
 460
 461
 462
 463
 464
 465
 466
 467
 468
 469
 470
 471
 472
 473
 474
 475
 476
 477
 478
 479
 480
 481
 482
 483
 484
 485
 486
 487
 488
 489
 490
 491
 492
 493
 494
 495
 496
 497
 498
 499
 500
 501
 502
 503
 504
 505
 506
 507
 508
 509
 510
 511
 512
 513
 514
 515
 516
 517
 518
 519
 520
 521
 522
 523
 524
 525
 526
 527
 528
 529
 530
 531
 532
 533
 534
 535
 536
 537
 538
 539
 540
 541
 542
 543
 544
 545
 546
 547
 548
 549
 550
 551
 552
 553
 554
 555
 556
 557
 558
 559
 560
 561
 562
 563
 564
 565
 566
 567
 568
 569
 570
 571
 572
 573
 574
 575
 576
 577
 578
 579
 580
 581
 582
 583
 584
 585
 586
 587
 588
 589
 590
 591
 592
 593
 594
 595
 596
 597
 598
 599
 600
 601
 602
 603
 604
 605
 606
 607
 608
 609
 610
 611
 612
 613
 614
 615
 616
 617
 618
 619
 620
 621
 622
 623
 624
 625
 626
 627
 628
 629
 630
 631
 632
 633
 634
 635
 636
 637
 638
 639
 640
 641
 642
 643
 644
 645
 646
 647
 648
 649
 650
 651
 652
 653
 654
 655
 656
 657
 658
 659
 660
 661
 662
 663
 664
 665
 666
 667
 668
 669
 670
 671
 672
 673
 674
 675
 676
 677
 678
 679
 680
 681
 682
 683
 684
 685
 686
 687
 688
 689
 690
 691
 692
 693
 694
 695
 696
 697
 698
 699
 700
 701
 702
 703
 704
 705
 706
 707
 708
 709
 710
 711
 712
 713
 714
 715
 716
 717
 718
 719
 720
 721
 722
 723
 724
 725
 726
 727
 728
 729
 730
 731
 732
 733
 734
 735
 736
 737
 738
 739
 740
 741
 742
 743
 744
 745
 746
 747
 748
 749
 750
 751
 752
 753
 754
 755
 756
 757
 758
 759
 760
 761
 762
 763
 764
 765
 766
 767
 768
 769
 770
 771
 772
 773
 774
 775
 776
 777
 778
 779
 780
 781
 782
 783
 784
 785
 786
 787
 788
 789
 790
 791
 792
 793
 794
 795
 796
 797
 798
 799
 800
 801
 802
 803
 804
 805
 806
 807
 808
 809
 810
 811
 812
 813
 814
 815
 816
 817
 818
 819
 820
 821
 822
 823
 824
 825
 826
 827
 828
 829
 830
 831
 832
 833
 834
 835
 836
 837
 838
 839
 840
 841
 842
 843
 844
 845
 846
 847
 848
 849
 850
 851
 852
 853
 854
 855
 856
 857
 858
 859
 860
 861
 862
 863
 864
 865
 866
 867
 868
 869
 870
 871
 872
 873
 874
 875
 876
 877
 878
 879
 880
 881
 882
 883
 884
 885
 886
 887
 888
 889
 890
 891
 892
 893
 894
 895
 896
 897
 898
 899
 900
 901
 902
 903
 904
 905
 906
 907
 908
 909
 910
 911
 912
 913
 914
 915
 916
 917
 918
 919
 920
 921
 922
 923
 924
 925
 926
 927
 928
 929
 930
 931
 932
 933
 934
 935
 936
 937
 938
 939
 940
 941
 942
 943
 944
 945
 946
 947
 948
 949
 950
 951
 952
 953
 954
 955
 956
 957
 958
 959
 960
 961
 962
 963
 964
 965
 966
 967
 968
 969
 970
 971
 972
 973
 974
 975
 976
 977
 978
 979
 980
 981
 982
 983
 984
 985
 986
 987
 988
 989
 990
 991
 992
 993
 994
 995
 996
 997
 998
 999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
1134
1135
1136
1137
1138
1139
1140
1141
1142
1143
1144
1145
1146
1147
1148
1149
1150
1151
1152
1153
1154
1155
1156
1157
1158
1159
1160
1161
1162
1163
1164
1165
1166
1167
1168
1169
1170
1171
1172
1173
1174
1175
1176
1177
1178
1179
1180
1181
1182
1183
1184
1185
1186
1187
1188
1189
1190
1191
1192
1193
1194
1195
1196
1197
1198
1199
1200
1201
1202
1203
1204
1205
1206
1207
1208
1209
1210
1211
1212
1213
1214
1215
1216
1217
1218
1219
1220
1221
1222
1223
1224
1225
1226
1227
1228
1229
1230
1231
1232
1233
1234
1235
1236
1237
1238
1239
1240
1241
1242
1243
1244
1245
1246
1247
1248
1249
1250
1251
1252
1253
1254
1255
1256
1257
1258
1259
1260
1261
1262
1263
1264
1265
1266
1267
1268
1269
1270
1271
1272
1273
1274
1275
1276
1277
1278
1279
1280
1281
1282
1283
1284
1285
1286
1287
1288
1289
1290
1291
1292
1293
1294
1295
1296
1297
1298
1299
1300
1301
1302
1303
1304
1305
1306
1307
1308
1309
1310
1311
1312
1313
1314
1315
1316
1317
1318
1319
1320
1321
1322
1323
1324
1325
1326
1327
1328
1329
1330
1331
1332
1333
1334
1335
1336
1337
1338
1339
1340
1341
1342
1343
1344
1345
1346
1347
1348
1349
1350
1351
1352
1353
1354
1355
1356
1357
1358
1359
1360
1361
1362
1363
1364
1365
1366
1367
1368
1369
1370
1371
1372
1373
1374
1375
1376
1377
1378
1379
1380
1381
1382
1383
1384
1385
1386
1387
1388
1389
1390
1391
1392
1393
1394
1395
1396
1397
1398
1399
1400
1401
1402
1403
1404
1405
1406
1407
1408
1409
1410
1411
1412
1413
1414
1415
1416
1417
1418
1419
1420
1421
1422
1423
1424
1425
1426
1427
1428
1429
1430
1431
1432
1433
1434
1435
1436
1437
1438
1439
1440
1441
1442
1443
1444
1445
1446
1447
1448
1449
1450
1451
1452
1453
1454
1455
1456
1457
1458
1459
1460
1461
1462
1463
1464
1465
1466
1467
1468
1469
1470
1471
1472
1473
1474
1475
1476
1477
1478
1479
1480
1481
1482
1483
1484
1485
1486
1487
1488
1489
1490
1491
1492
1493
1494
1495
1496
1497
1498
1499
1500
1501
1502
1503
1504
1505
1506
1507
1508
1509
1510
1511
1512
1513
1514
1515
1516
1517
1518
1519
1520
1521
1522
1523
1524
1525
1526
1527
1528
1529
1530
1531
1532
1533
1534
1535
1536
1537
1538
1539
1540
1541
1542
1543
1544
1545
1546
1547
1548
1549
1550
1551
1552
1553
1554
1555
1556
1557
1558
1559
1560
1561
1562
1563
1564
1565
1566
1567
1568
1569
1570
1571
1572
1573
1574
1575
1576
1577
1578
1579
1580
1581
1582
1583
1584
1585
1586
1587
1588
1589
1590
1591
1592
1593
1594
1595
1596
1597
1598
1599
1600
1601
1602
1603
1604
1605
1606
1607
1608
1609
1610
1611
1612
1613
1614
1615
1616
1617
1618
1619
1620
1621
1622
1623
1624
1625
1626
1627
1628
1629
1630
1631
1632
1633
1634
1635
1636
1637
1638
1639
1640
1641
1642
1643
1644
1645
1646
1647
1648
1649
1650
1651
1652
1653
1654
1655
1656
1657
1658
1659
1660
1661
1662
1663
1664
1665
1666
1667
1668
1669
1670
1671
1672
1673
1674
1675
1676
1677
1678
1679
1680
1681
1682
1683
1684
1685
1686
1687
1688
1689
1690
1691
1692
1693
1694
1695
1696
1697
1698
1699
1700
1701
1702
1703
1704
1705
1706
1707
1708
1709
1710
1711
1712
1713
1714
1715
1716
1717
1718
1719
1720
1721
1722
1723
1724
1725
1726
1727
1728
1729
1730
1731
1732
1733
1734
1735
1736
1737
1738
1739
1740
1741
1742
1743
1744
1745
1746
1747
1748
1749
1750
1751
1752
1753
1754
1755
1756
1757
1758
1759
1760
1761
1762
1763
1764
1765
1766
1767
1768
1769
1770
1771
1772
1773
1774
1775
1776
1777
1778
1779
1780
1781
1782
1783
1784
1785
1786
1787
1788
1789
1790
1791
1792
1793
1794
1795
1796
1797
1798
1799
1800
1801
1802
1803
1804
1805
1806
1807
1808
1809
1810
1811
1812
1813
1814
1815
1816
1817
1818
1819
1820
1821
1822
1823
1824
1825
1826
1827
1828
1829
1830
1831
1832
1833
1834
1835
1836
1837
1838
1839
1840
1841
1842
1843
1844
1845
1846
1847
1848
1849
1850
1851
1852
1853
1854
1855
1856
1857
1858
1859
1860
1861
1862
1863
1864
1865
1866
1867
1868
1869
1870
1871
1872
1873
1874
1875
1876
1877
1878
1879
1880
1881
1882
1883
1884
1885
1886
1887
1888
1889
1890
1891
1892
1893
1894
1895
1896
1897
1898
1899
1900
1901
1902
1903
1904
1905
1906
--
-- // Code by SoundOfSpouting#6980 (UID: 151149148639330304)
--
-- visual text editor inspired by Emacs evil mode
--

term = require "term"
text = require "text"
event = require "event"
unicode = require "unicode"
keyboard = require "keyboard"
serialization = require "serialization"

local args = {...}

editor = {}

editor.commands = {}
editor.buffer = {}

function dump(v)
	return serialization.serialize(v, math.huge)
end

function dumpfile(f,v)
	local f = io.open(f,"w")
	f:write(type(v) == "string" and v or dump(v))
	f:close()
end

local function main()
	local state = {
		args = args,
		arg_n = 1,
		arg_type = nil,
		short_arg_n = nil,
		args_done = false,
	}

	editor.set_mode("normal")
	editor.buffer = editor.new_buffer()

	while state.arg_n <= #state.args do
		local arg = state.args[state.arg_n]

		if not state.arg_type then
			if arg == "--" then

				state.args_done = true

			elseif not state.args_done and arg:match("^%-%-") then

				state.arg_type = "long"
				state.arg = state.args[state.arg_n]:sub(3, -1)

			elseif not state.args_done and arg:match("^%-") then

				state.arg_type = "short"
				state.short_arg_n = 2
				state.arg = state.args[state.arg_n]:sub(
					state.short_arg_n,
					state.short_arg_n
				)

			else

				editor.commands.open(arg)

			end
		end

		if state.arg_type then
			local func = editor[state.arg_type .. "opts"][state.arg]
			local ok, err = true

			if not func then
				ok, err = nil,
					"unknown option: "

						.. ({
							long = '--',
							short = '-'
						})[state.arg_type]

						.. state.arg
			end

			if ok then
				ok, err = func()
			end

			if not ok then
				io.stderr:write(err,'\n')
				return
			end

			if state.exit then
				return
			end
		end

		state.arg_n = state.arg_n + 1
	end

	editor.run()

	return true
end

	TheWeakster	=	{
		__mode	=	"k"
	}

function class(obj, super)
	obj.__index = function(self, i)
		local v
		if self ~= obj then
			v = obj[i]
		end
		if super and v == nil then
			return super[i]
		end
		if self == obj then return nil end
		return v
	end
	obj.__proto__ = obj
	setmetatable(obj, obj)

	return obj
end

function static(fn)
	return function(self, ...)
		if self.__proto__ ~= self then
			return fn(self.__proto__, ...)
		end
		return fn(self, ...)
	end
end

function unrecursive(fn)
	local n = 0
	local function pack(...)
		return {n = select('#', ...), ...}
	end
	return function(...)
		assert(n < 1, "recursion forbidden here")
		n = n + 1
		local ret = pack(fn(...))
		n = n - 1
		return (unpack or table.unpack)(ret, 1, ret.n)
	end
end

local function DumpLengths(obj)
	local prim = obj:Length()
	for k,v in pairs(obj:Lengths()) do
		if k ~= "chars" then
			prim = ("%s, %s=%s"):format(prim, k, type(v)=="table" and v.chars or v)
		end
	end
	return prim
end

Rope = class {}

Rope.__Fibo = {[0] = 1}

for n=1,64 do
	Rope.__Fibo[n] =
	  (Rope.__Fibo[n - 1] or 0)
	+ (Rope.__Fibo[n - 2] or 0)
end

function Rope:__call(String, LeafSize)
	local obj = class ({}, self)

	obj.String = String
	obj.__LeafSize = __LeafSize or 200
	obj.__empty = obj:New()

	return obj
end

function Rope:__New(data, left, right, norebal)
	local obj = setmetatable({}, self)

	if data then
		obj.__height = 1
		obj.__data = data
		obj.__count = 1
		obj.__Lengths = data:Lengths()
		assert(not (left or right), "branching leaf")
		return obj
	end

	if left and not right then return left end
	if right and not left then return right end

	assert(left or right, "Bad")

	obj.__height = math.max(left.__height, right.__height) + 1
	obj.__count = left.__count + right.__count
	obj.__left = left
	obj.__right = right

	local add = function(a,b) return a+b end

	obj.__Lengths = self:LengthAdd(left:Lengths(), right:Lengths())

	if not norebal then
		if obj:__BalanceFactor() < -1 then

			if left:__BalanceFactor() > 0 then
				left = left:__rotateLeft()
			end

			obj = obj:__rotateRight()
			left, right = obj.__left, obj.__right

		elseif obj:__BalanceFactor() > 1 then

			if right:__BalanceFactor() < 0 then
				right = right:__rotateRight()
				obj = self:__New(nil, left, right, true)
			end

			obj = obj:__rotateLeft()
			left, right = obj.__left, obj.__right

		end
	end

	return obj
end
Rope.__New = static(Rope.__New)

function Rope:__BalanceFactor()
	if self.__height == 1 then return 0 end
	return self.__right.__height - self.__left.__height
end

function Rope:New(...)
	assert(self.String, "usage: Rope(String[, LeafSize]):New()")

	local obj

	for n = 1, select('#', ...) do
		local v = select(n, ...)
		local i = 1
		local l = v:Length()
		local objs = {}
		if obj then
			objs[#objs + 1] = obj
		end
		if l <= self.__LeafSize then
			objs[#objs + 1] = self:__New(v)
		else
			while i <= l do
				local s = v:Slice(i, i + self.__LeafSize - 1)
				i = i + s:Length()
				objs[#objs + 1] = self:__New(s)
			end
		end
		obj = self:Join(objs)
	end

	return obj
end

function Rope:__rotateLeft()
	if self.__height < 3 or self.__right.__height < 2 then
		return self
	end

	local a, b, c =
		self.__left,
		self.__right.__left,
		self.__right.__right

	return self:__New(nil, self:__New(nil, a, b, true), c, true)
end

function Rope:__rotateRight()
	if self.__height < 3 or self.__left.__height < 2 then
		return self
	end

	local a, b, c =
		self.__left.__left,
		self.__left.__right,
		self.__right

	return self:__New(nil, a, self:__New(nil, b, c, true), true)
end

function Rope:Dump(i1)
	i1 = i1 or ""
	local i2 = i1 .. "  "
	if self.__data then
		return self.__data:Dump(i1)
	end
	return (("%sRope(%s, height=%s(%s)) {\n%s\n%s\n%s}"):format(
		i1,
		DumpLengths(self),
		self.__height,
		self:__BalanceFactor(),
		self.__left:Dump(i2),
		self.__right:Dump(i2),
		i1
	))
end

function Rope:Length(Cat)
	return self.String.Length(self, Cat)
end

function Rope:Lengths()
	return self.__Lengths
end

function Rope:LengthAdd(this, other)
	return self.String:LengthAdd(this, other)
end

function Rope:DefaultLengthAdd(this, other)
	return self.String:DefaultLengthAdd(this, other)
end

function Rope:SliceTest(Cat, a, i,j, w)
	return self.String:SliceTest(Cat, a, i,j, w)
end

function Rope:Leaves(rev)
	if self.__data then
		local b = true
		return function()
			if not b then
				return
			end
			b = false
			return self.__data
		end
	end

	local function lazy(f)
		local v = nil
		local b = false
		return function()
			if not b then
				v = f()
				b = true
			end
			return v
		end
	end

	local a, b =
		lazy(function() return self.__left:Leaves(rev) end),
		lazy(function() return self.__right:Leaves(rev) end)

	if rev then
		a, b = b, a
	end

	local function iter()
		if not a then return end
		local v = a()()
		if v == nil then
			a, b = b
			return iter()
		end
		return v
	end
	return iter
end

function Rope:Implode()
	if self.__data then
		return self.__data
	end

	local leaves = {}

	for leaf in self:Leaves() do
		leaves[#leaves + 1] = leaf
	end

	return self.String:Join(leaves)
end

function Rope:__Join(other, rev)
	if other.__height > self.__height then
		return other:__Join(self, not rev)
	end
	if self.__data and other.__data then
		if self:DefaultLengthAdd(self:Lengths(), other:Lengths()) <= self.__LeafSize then
			if rev then
				return self:__New(self.String:Join { other.__data, self.__data })
			else
				return self:__New(self.String:Join { self.__data, other.__data })
			end
		else
			if rev then
				return self:__New(nil, other, self)
			else
				return self:__New(nil, self, other)
			end
		end
	end
	if  self.__height - other.__height > 1 or
	    (self.__height == 2
	and other.__height == 1
	and self:DefaultLengthAdd(self[rev and "__left" or "__right"]:Lengths(), other:Lengths()) <= self.__LeafSize)
	then
		if rev then
			return self:__New(nil, self.__left:__Join(other, rev), self.__right)
		else
			return self:__New(nil, self.__left, self.__right:__Join(other, rev))
		end
	end
	if rev then
		return self:__New(nil, other, self)
	else
		return self:__New(nil, self, other)
	end
end

function Rope:Join(Ropes)
	local obj = self:PreJoin(Ropes, function(str)
		local neut = false
		return function()
			if neut then return end
			neut = true
			return str
		end
	end, function(...)
		return self:New(...)
	end)
	if obj then
		return obj
	end

	for _, v in ipairs(Ropes) do
		assert(v)
		obj = obj and obj:__Join(v) or v
	end

	return obj
end

function Rope:SliceBy(Cat, i, j)
	if i > j then
		return self:Empty(self)
	end
	if self.__data then
		local origin = self.__data
		local sliced

		if Cat == nil then
			sliced = origin:Slice(i, j)
		else
			sliced = origin:SliceBy(Cat, i, j)
		end

		if origin == sliced then
			return self
		end
		
		return self.__proto__:__New(sliced)
	end

	local test = function(a, i,j, w)
		local b, ii, jj = self:SliceTest(Cat, a, i,j, w)
		if b ~= nil then return b, ii, jj end
		if not w then
			return i<=a, i, j
		else
			return i>a or j>a, i-a, j-a
		end
	end

	local t = {}

	local f,  ni,  nj  = test(self.__left:Length(Cat), i, j, false)
	local f2, ni2, nj2 = test(self.__left:Length(Cat), i, j, true)

	if f2 and i == -math.huge then
		t[#t + 1] = self.__left
	elseif f then
		t[#t + 1] = self.__left:SliceBy(Cat, ni, f2 and math.huge or nj)
	end
	if f and j == math.huge then
		t[#t + 1] = self.__right
	elseif f2 then
		t[#t + 1] = self.__right:SliceBy(Cat, f and -math.huge or ni2, nj2)
	end

	return self:Join(t)
end

function Rope:PreJoin(strs, bomb, factory)
	return self.String.PreJoin(self, strs, function(obj)
		return coroutine.wrap(function()
			for obj in bomb(obj) do
				for obj in obj:Leaves() do
					coroutine.yield(obj)
				end
			end
		end)
	end, function(...)
		return factory(self.String:New(...))
	end)
end

function Rope:Empty(base)
	return self:New(self.String:Empty(base))
end

function Rope:Slice(i, j)
	return self:SliceBy(nil, i, j)
end

EditorString = class {}

function EditorString:__CharLProc(char, to)
	if char == "\t" or char == "\n" then
		to.tabcells_first = self:Empty(self):Lengths()
		to.tabcells_last = self:Empty(self):Lengths()
		to.tabcells = 2
	else
		to.tabcells_first = to
		to.tabcells_last = to
		to.tabcells = 1
	end
	if char == "\n" then
		to.lines_first = self:Empty(self):Lengths()
		to.lines_last = self:Empty(self):Lengths()
		to.lines = 2
	else
		to.lines_first = to
		to.lines_last = to
		to.lines = 1
	end
	to.lines_longest_visual = to.lines_first
end

function EditorString:__NewLength()
	local t = {
		chars = 0,
		visual = 0,
		vis_broken_left = 0,
		vis_broken_right = 0,
		tabcells = 1,
		lines = 1,
		tabstop = nil,
		offset = 0,
	}
	t.lines_first = t
	t.lines_last = t
	t.lines_longest_visual = t
	t.tabcells_first = t
	t.tabcells_last = t
	return t
end

function EditorString:LengthAdd(this, other)
	assert(
			this.vis_broken_right == 0
		and other.vis_broken_left == 0,
		"cannot join")
	local to = {}
	assert(this.tabcells_first.tabcells == 1)
	assert(this.tabcells_last.tabcells == 1)
	assert(this.lines_first.lines == 1)
	assert(this.lines_last.lines == 1)
	to.chars = this.chars + other.chars
	to.visual = this.visual + other.visual
	to.vis_broken_left = this.vis_broken_left
	to.vis_broken_right = other.vis_broken_right
	to.tabcells = this.tabcells + other.tabcells - 1
	to.lines = this.lines + other.lines - 1
	to.tabstop = this.tabstop
	to.offset = this.offset
	if this.lines == 1 and other.lines > 1 then
		to.lines_first = self:LengthAdd(
			this,
			other.lines_first
		)
	elseif this.lines == 1 then
		to.lines_first = to
	else
		to.lines_first = this.lines_first
	end
	if other.lines == 1 and this.lines > 1 then
		to.lines_last = self:LengthAdd(
			this.lines_last,
			other
		)
	elseif other.lines == 1 then
		to.lines_last = to
	else
		to.lines_last = other.lines_last
	end
	if to.lines > 1 then
		local longest = this.lines_longest_visual
		if this.lines > 1 and other.lines > 1 then
			local middle = self:LengthAdd(this.lines_last, other.lines_first)
			longest = longest.visual < middle.visual and middle or longest
		end
		local last = to.lines_last
		longest = longest.visual < last.visual and last or longest
		local long2 = other.lines_longest_visual
		longest = longest.visual < long2.visual and long2 or longest
		to.lines_longest_visual = longest
	else
		to.lines_longest_visual = to
	end
	if this.tabcells == 1 and other.tabcells > 1 then
		to.tabcells_first = self:LengthAdd(
			this,
			other.tabcells_first
		)
	elseif this.tabcells == 1 then
		to.tabcells_first = to
	else
		to.tabcells_first = this.tabcells_first
	end
	if other.tabcells == 1 and this.tabcells > 1 then
		to.tabcells_last = self:LengthAdd(
			this.tabcells_last,
			other
		)
	elseif other.tabcells == 1 then
		to.tabcells_last = to
	else
		to.tabcells_last = other.tabcells_last
	end
	to.tabwidth = this.tabwidth or other.tabwidth or nil
	if to.tabcells_first.chars == to.lines_first.chars then
		to.tabwidth = nil
	end
	return to
end

function EditorString:DefaultLengthAdd(this, other)
	return this.chars + other.chars
end

function EditorString:New(str, tabstop, offset)
	local obj = setmetatable({}, self.__proto__)

	offset = offset or 0

	local i = 1
	local t = {}

	local charlen = self:__NewLength()
	charlen.chars = 1

	obj.__Lengths = self:__NewLength()
	obj.__Lengths.tabstop = tabstop
	obj.__Lengths.offset = offset % tabstop

	while i <= #str do
		local char = unicode.sub(str:sub(i, i+3), 1, 1)
		i = i + #char
		local charW
		obj:__CharLProc(char, charlen)
		if char == "\t" then
			charW = tabstop - offset % tabstop
			char = "\t" .. string.char(charW)
			charlen.tabwidth = charW
		else
			charW = unicode.charWidth(char)
			charlen.tabwidth = nil
		end
		if char == "\n" then
			offset = -charW
		end
		charlen.visual = charW
		offset = ((offset + charW) % tabstop)
		obj.__Lengths = self:LengthAdd(
			obj.__Lengths,
			charlen,
			obj.__Lengths
		)
		t[#t + 1] = char
	end

	obj.__data = table.concat(t)

	return obj
end

function EditorString:SliceBy(Cat, i, j)
	if i > j then
		return self:Empty(self)
	end
	if (Cat == nil or Cat == "chars") and i <= 1 and j >= self.__Lengths.chars then
		return self
	end

	local obj = setmetatable({}, self.__proto__)

	obj.__Lengths = self:__NewLength()
	obj.__Lengths.tabstop = self.__Lengths.tabstop
	obj.__Lengths.offset = self.__Lengths.offset

	local charlen = self:__NewLength()
	charlen.chars = 1

	local _ic = 1

	local _i = 1
	if Cat == "visual" then
		_i = _i - self.__Lengths.vis_broken_left
		j = math.min(self.__Lengths.visual, j)
		i = math.max(1, i)
	end

	local t = {}
	local left, right = 0, 0

	while _ic <= #self.__data and _i <= j do
		local char = unicode.sub(self.__data:sub(_ic, _ic+3), 1, 1)
		local tab
		_ic = _ic + #char

		if char == "\t" then
			tab = self.__data:sub(_ic, _ic)
			_ic = _ic + 1
		end
		local charW
		if tab then
			charW = tab:byte()
		else
			charW = unicode.charWidth(char)
		end

		local ins

		if Cat == nil or Cat == "chars" then
			ins = _i >= i
			if _i > j then
				break
			end
			_i = _i + 1
		elseif Cat == "visual" then
			local _j = _i + charW - 1
			if _i < i and _j >= i then
				left = i - _i
				ins = true
			elseif _i >= i and _j > j then
				right = _j - j
				ins = true
			elseif _i >= i then
				ins = true
			elseif _i > j then
				break
			end
			_i = _j + 1
		elseif Cat == "tabcells" or Cat == "lines" then
			ins = _i >= i
			local found = false
			if char == "\n" or (Cat == "tabcells" and char == "\t") then
				found = math.ceil(j) > j and _i <= j
				_i = _i + 1
			end
			if _i > j and not found then
				break
			end
		end
		obj.__Lengths.offset = (obj.__Lengths.offset + charW) % obj.__Lengths.tabstop
		if char == "\n" or tab then
			obj.__Lengths.offset = 0
		end
		if ins then
			self:__CharLProc(char, charlen)
			if tab then
				t[#t + 1] = char .. tab
				charlen.tabwidth = tab:byte()
			else
				t[#t + 1] = char
				charlen.tabwidth = nil
			end
			charlen.visual = charW
			obj.__Lengths = self:LengthAdd(
				obj.__Lengths,
				charlen
			)
		end
	end

	obj.__Lengths.vis_broken_left = left
	obj.__Lengths.vis_broken_right = right

	obj.__data = table.concat(t)

	return obj
end

function EditorString:PreJoin(strs, bomb, factory)
	local modified = false
	local strs2 = {}
	local length
	for k, v in ipairs(strs) do
		local lv = v:Lengths()
		if length then
			if lv.tabstop ~= length.tabstop then
				local tar = {}
				for par in bomb(v) do
					local offset = length.tabcell_last.visual
					tar[#tar + 1] = factory(par:Implode(), length.tabstop, offset)
					length = self:LengthAdd(length, tar[#tar]:Lengths())
				end
				v = self:Join(tar)
				error("whag")
				modified = true
			else
				local offset = length.tabcells_last.visual + lv.tabcells_first.visual
				if  lv.tabwidth and lv.tabcells_first.chars < lv.lines_first.chars
				and length.tabcells >= 2
				and lv.tabwidth ~= length.tabstop - offset % length.tabstop
				then
					v = self:Join {
						v:Slice(-math.huge, lv.tabcells_first.chars),
						factory("\t", length.tabstop, offset),
						v:Slice(lv.tabcells_first.chars + 2, math.huge)
					}
					modified = true
				end
				length = self:LengthAdd(length, v:Lengths())
			end
		else
			length = lv
		end
		assert(v)
		strs2[#strs2 + 1] = v
	end
	if modified then
		local jj = self:Join(strs2)
		return jj
	end
end

function EditorString:Join(strs)
	if #strs == 0 then error(" ") end
	local obj = self:PreJoin(strs, function(str)
		local neut = false
		return function()
			if neut then return end
			neut = true
			return str
		end
	end, function(...)
		return self:New(...)
	end)
	if obj then
		return obj
	end
	obj = setmetatable({}, self)

	obj.__Lengths = nil

	local t = {}

	for k, v in ipairs(strs) do
		obj.__Lengths = obj.__Lengths
			and self:LengthAdd(obj.__Lengths, v.__Lengths)
			or v.__Lengths

		t[#t + 1] = v.__data
	end
	
	obj.__data = table.concat(t)

	return obj
end
EditorString.Join = static(EditorString.Join)

function EditorString:Implode(visual)
	if visual then
		local str = self.__data
		local t = {}
		local i = 1
		local charWf = nil
		local charWl = nil
		while i <= #str do
			local char = unicode.sub(self.__data:sub(i, i+3), 1, 1)
			local tab
			i = i + #char
			if char == "\t" then
				tab = self.__data:sub(i, i)
				i = i + 1
			end
			local charW
			if tab then
				char = (" "):rep(tab:byte())
				charW = #char
			else
				charW = unicode.charWidth(char)
			end
			if not charWf then
				charWf = charW
			end
			charWl = charW
			t[#t + 1] = char
		end
		if self:Length("vis_broken_left") > 0 then
			t[1] = (" "):rep(charWf - self:Length("vis_broken_left"))
		end
		if self:Length("vis_broken_right") > 0 then
			t[#t] = (" "):rep(charWl - self:Length("vis_broken_right"))
		end
		return table.concat(t)
	end
	return self.__data:gsub("\t(.)",function(tab)
		return "\t"
	end)
end

function EditorString:Slice(i, j)
	return self:SliceBy(nil, i, j)
end

function EditorString:Dump(i1)
	return i1.."String("..DumpLengths(self)..") "..(("%q"):format(self:Implode()):gsub("\\\n","\\n"))
end

function EditorString:SliceTest(Cat, a, i,j, w)
	if Cat ~= "tabcells" and Cat ~= "lines" then
		assert(
			   Cat == nil
			or Cat == "chars"
			or Cat == "visual",
			"cannot slice"
		)
		return nil
	end
	if not w then
		return i<=a, i, j
	else
		return i>=a or j>=a, i-a+1, j-a+1
	end
end

function EditorString:Lengths()
	return self.__Lengths
end

function EditorString:Length(Cat)
	if Cat == nil then
		return self:Length("chars")
	end
	return self:Lengths()[Cat]
end

function EditorString:Empty(base)
	return self:New("", base:Length("tabstop"), 0)
end

EditorRope = Rope(EditorString)

function editor.new_buffer()
	local buffer = {}
	buffer.vdirty = {all=true}
	buffer.data = EditorRope:New(EditorString:New("", editor.tabstop))
	buffer.row = 1
	buffer.col = 1
	buffer.colTo = 1
	buffer.vx = 1
	buffer.vy = 1
	return buffer
end

editor.movement = {}
editor.movement.arrows = {}

function editor.camera_move_horz(where)
	local limit = editor.buffer.data
		:SliceBy("lines",
			editor.buffer.vy,
			editor.buffer.vy + editor.buffer.vh - 1
		)
		:Lengths()
		.lines_longest_visual
		.visual - editor.buffer.vw + 2
	local oldpos = editor.buffer.vx
	local pos = math.max(1, math.min(limit, editor.buffer.vx + where))
	if oldpos ~= pos then
		editor.buffer.vx = pos
		editor.buffer.vdirty = {all=true}
	end
end

function editor.camera_notify_shift(r1, r2, where)
	local gpu = term.gpu()
	r1 = r1 - editor.buffer.vy + 1
	r2 = r2 - editor.buffer.vy + 1
	if (r1 > editor.buffer.vh and r2 > editor.buffer.vh) or (r1 < 1 and r2 < 1) then
		return
	end
	r1, r2 = math.max(r1, 1), math.min(r2, editor.buffer.vh)
	local t1, t2 = r1 + where, r2 + where
	local o
	if not editor.buffer.vdirty.all then
		if math.abs(where) < editor.buffer.vh then
			if where < 0 then
				t2 = math.min(t2, editor.buffer.vh)
				o = math.min(t2-t1+1, r2-r1+1)
				r2, t2 = r1+o-1, t1+o-1
			else
				t1 = math.max(t1, 1)
				o = math.min(t2-t1+1, r2-r1+1)
				r1, t1 = r2-o+1, t2-o+1
			end
			gpu.copy(1, r1, editor.buffer.vw, o, 0, t1-r1)
			local b2 = editor.buffer.vdirty
			editor.buffer.vdirty = {}
			for y = 1, #b2 do
				if y >= t1 and y <= t2 then
					editor.buffer.vdirty[y] = b2[y + (r1 - t1)]
				elseif y >= r1 and y <= r2 then
					editor.buffer.vdirty[y] = true
				end
			end
		else
			editor.buffer.vdirty.all = true
		end
	end
end

function editor.camera_move_vert(where)
	local limit = editor.buffer.data:Length("lines") - editor.buffer.vh + 1
	local oldpos = editor.buffer.vy
	local pos = math.max(1, math.min(limit, editor.buffer.vy + where))
	if oldpos ~= pos then
		editor.camera_notify_shift(-math.huge, math.huge, oldpos - pos)
		editor.buffer.vy = pos
	end
end

function editor.cursor_move_horz(where)
	local line = editor.buffer.data
		:SliceBy("lines", editor.buffer.row, editor.buffer.row)
	local width = line:Length()
	local oldrow = editor.buffer.row
	local oldcol = editor.buffer.col
	editor.buffer.col = math.max(1, math.min(width + 1, editor.buffer.col + where))
	if where == math.huge then
		editor.buffer.colTo = math.huge
	else
		if not (oldrow == editor.buffer.row
		    and oldcol == editor.buffer.col)
		then
			editor.cursor_refresh_col()
		end
	end
end

function editor.cursor_refresh_col()
	local colvis = editor.buffer.data
		:SliceBy("lines", editor.buffer.row, editor.buffer.row)
		:Slice(1,editor.buffer.col - 1)
		:Length("visual") + 1
	editor.buffer.colTo = colvis
end

function editor.cursor_move_vert(where)
	editor.buffer.row = math.max(
		1,
		math.min(
			editor.buffer.data:Length("lines"),
			editor.buffer.row + where
		)
	)
	local data = EditorRope:Join {
		editor.buffer.data,
		EditorRope:New(EditorString:New("\n", editor.buffer.data:Length("tabstop"), 0))
	}
	editor.buffer.col = data
		:SliceBy("lines", editor.buffer.row, editor.buffer.row + .5)
		:SliceBy("visual", -math.huge, editor.buffer.colTo)
		:Length()
end

function editor.camera_to_cursor()
	local colvis = editor.buffer.data
		:SliceBy("lines", editor.buffer.row, editor.buffer.row)
		:Slice(1,editor.buffer.col - 1)
		:Length("visual") + 1
	local x1,x2, y1,y2 =
		editor.buffer.vx, editor.buffer.vx + editor.buffer.vw - 1,
		editor.buffer.vy, editor.buffer.vy + editor.buffer.vh - 1
	if colvis < x1 then
		editor.camera_move_horz(colvis - x1)
	elseif colvis > x2 then
		editor.camera_move_horz(colvis - x2)
	end
	if editor.buffer.row < y1 then
		editor.camera_move_vert(editor.buffer.row - y1)
	elseif editor.buffer.row > y2 then
		editor.camera_move_vert(editor.buffer.row - y2)
	end
end

function outnormal_on_key(char, key, mod)
	if key == "c" and mod.control then
		editor.set_mode("normal")
		return true
	end
	return
end

function rowcol_to_char(row, col, data)
	return (data or editor.buffer.data)
		:SliceBy("lines", -math.huge, row - 0.5)
		:Length() + math.min(row >= 1 and (editor.buffer.data:SliceBy("lines", row, row):Length() + 1) or 0,math.max(1,  col))
end

function char_to_rowcol(char, data)
	local sub = (data or editor.buffer.data)
		:Slice(-math.huge, char - 1)
	local row = sub
		:Length("lines")
	local col = sub:Lengths().lines_last.chars + 1
	return row, col
end

function rechar()
	editor.buffer.row, editor.buffer.col = char_to_rowcol(rowcol_to_char(editor.buffer.row,editor.buffer.col))
end

function editor.delete(r1, c1, r2, c2)
	if r1 > r2 or (r1 == r2 and c1 > c2) then
		return editor.delete(r2, c2, r1, c1)
	end
	local i, j = rowcol_to_char(r1, c1), rowcol_to_char(r2, c2)
	local count = j - i + 1
	if count <= 0 then return end
	local pos2 = rowcol_to_char(editor.buffer.row, editor.buffer.col)
	local data = editor.buffer.data:Slice(i, j)
	editor.buffer.data = EditorRope:Join {
		editor.buffer.data:Slice(-math.huge, i - 1),
		editor.buffer.data:Slice(j + 1, math.huge)
	}
	if pos2 > j then
		editor.buffer.row, editor.buffer.col = char_to_rowcol(pos2 - count)
		editor.cursor_refresh_col()
		editor.camera_to_cursor()
	elseif pos2 >= i then
		editor.buffer.row, editor.buffer.col = char_to_rowcol(i)
		editor.cursor_refresh_col()
		editor.camera_to_cursor()
	end
	local r1v = r1 - editor.buffer.vy + 1
	if r1v <= editor.buffer.vh and not editor.buffer.vdirty.all then
		editor.buffer.vdirty[r1v] = true
		editor.camera_notify_shift(r2 + 2, math.huge, -(data:Length("lines") - 1))
	end
	editor.buffer.dirty = true
end

function editor.insert(row, col, data)
	local pos = rowcol_to_char(row, col)
	editor.buffer.data = EditorRope:Join {
		editor.buffer.data:Slice(-math.huge, pos - 1),
		data,
		editor.buffer.data:Slice(pos, math.huge)
	}
	local rv = row - editor.buffer.vy + 1
	if rv <= editor.buffer.vh and not editor.buffer.vdirty.all then
		editor.buffer.vdirty[rv] = true
		editor.camera_notify_shift(rv + 1, math.huge, (data:Length("lines") - 1))
	end
	local pos2 = rowcol_to_char(editor.buffer.row, editor.buffer.col)
	if pos2 >= pos then
		editor.buffer.row, editor.buffer.col = char_to_rowcol(pos2 + data:Length())
		editor.cursor_refresh_col()
		editor.camera_to_cursor()
	end
	editor.buffer.dirty = true
end

function navigation_on_key(char, key, mod)
	if tonumber(char) then
		editor.counter = (editor.counter or 0)*10 + tonumber(char)
		return true
	end
	local pg = math.ceil(editor.buffer.vh / 4)
	if mod.control then
		if key == "left" then
			editor.camera_move_horz(-(editor.counter or 1))
		elseif key == "right" then
			editor.camera_move_horz((editor.counter or 1))
		elseif key == "home" then
			editor.camera_move_horz(-math.huge)
		elseif key == "end" then
			editor.camera_move_horz(math.huge)
		elseif key == "up" then
			editor.camera_move_vert(-(editor.counter or 1))
		elseif key == "down" then
			editor.camera_move_vert((editor.counter or 1))
		elseif key == "pageUp" then
			editor.camera_move_vert(-(editor.counter or 1) * pg)
		elseif key == "pageDown" then
			editor.camera_move_vert((editor.counter or 1) * pg)
		else
			return
		end
	else
		if key == "left" then
			editor.cursor_move_horz(-(editor.counter or 1))
		elseif key == "right" then
			editor.cursor_move_horz((editor.counter or 1))
		elseif key == "home" then
			editor.cursor_move_horz(-math.huge)
		elseif key == "end" then
			editor.cursor_move_horz(math.huge)
		elseif key == "up" then
			editor.cursor_move_vert(-(editor.counter or 1))
		elseif key == "down" then
			editor.cursor_move_vert((editor.counter or 1))
		elseif key == "pageUp" then
			editor.cursor_move_vert(-(editor.counter or 1) * pg)
			editor.camera_move_vert(-(editor.counter or 1) * pg)
		elseif key == "pageDown" then
			editor.cursor_move_vert((editor.counter or 1) * pg)
			editor.camera_move_vert((editor.counter or 1) * pg)
		elseif char == "G" then
			if not editor.counter then return end
			local diff = editor.counter - editor.buffer.row
			if diff ~= 0 then
				editor.cursor_move_vert(diff)
			end
		else
			return
		end
		editor.camera_to_cursor()
	end
	editor.counter = nil
	return true
end

editor.modes = {}

editor.modes.normal = {}

function editor.modes.normal.init()
	editor.set_status("")
	editor.counter = nil
end

function editor.modes.normal.on_key(char, key, mod)
	if outnormal_on_key(char, key, mod) then
		return true
	end
	if char == "i" then
		editor.set_mode("insert")
		return true
	end
	if char == ":" then
		editor.command_line()
		return true
	end
	return navigation_on_key(char, key, mod)
end

editor.modes.insert = {}

function editor.modes.insert.init()
	editor.set_status("-- INSERT --")
	editor.counter = nil
end

function editor.modes.insert.on_key(char, key, mod)
	if outnormal_on_key(char, key, mod) then
		return true
	end
	if key == "back" then
		local col = editor.buffer.col - 1
		local row = editor.buffer.row
		if col < 1 then row = row - 1 col = math.huge end
		editor.delete(row, col, row, col)
		return
	elseif key == "delete" then
		editor.delete(editor.buffer.row, editor.buffer.col, editor.buffer.row, editor.buffer.col)
		return
	end
	if char == "\r" then
		char = "\n"
	end
	if char then
		editor.insert(editor.buffer.row, editor.buffer.col,
			EditorRope:New(EditorString:New(char, editor.buffer.data:Length("tabstop"), 0))
		)
	end
	return navigation_on_key(char, key, mod, true)
end

function editor.set_mode(mode)
	editor.mode = editor.modes[mode]
	editor.mode.init()
end

editor.status_line = ""

function editor.set_status(line)
	editor.status_line = line
end

function editor.run()
	while true do
		editor.draw()
		local ev = {(editor.buffer.cursor_oob and event or term).pull()}
		if ev[1] == "key_down" then
			local _, addr, char, code, player = (unpack or table.unpack)(ev)
			editor.mode.on_key(char ~= 0 and unicode.char(char) or nil, keyboard.keys[code], {
				control = keyboard.isControlDown(),
				meta = keyboard.isAltDown(),
				shift = keyboard.isShiftDown(),
			})
		end
	end
end

function editor.set_cursor(x, y)
	local ls = editor.buffer.data:Length("lines")
end

editor.cmd_hist = {}

function editor.command_line()
	local gpu = term.gpu()
	local vw, vh, vx, vy = term.getViewport()
	term.setCursor(2,vh)
	term.clearLine()
	term.write(":")
	local line = term.read(editor.cmd_hist)
	editor.buffer.vdirty = {all = true}
	if not line then
		editor.set_status("")
		return
	end
	line = line:match("([^\n]*)")
	local cmd = line:match("([^ ]+)")
	if not cmd then
		editor.set_status("")
		return
	end
	local param = line:sub(#cmd+2,-1)
	editor.set_status(":"..line)
	if not editor.commands[cmd] then
		editor.set_status("No such command: "..cmd)
		return
	end
	editor.commands[cmd](param)
end

function editor.draw()
	local t = os.clock()
	local gpu = term.gpu()
	local vw, vh, vx, vy = term.getViewport()
	local statusRight = {}
	local resize = false
	if editor.buffer.vw ~= vw or editor.buffer.vh ~= (vh-1) then
		editor.buffer.vdirty.all = true
		editor.buffer.vw = vw
		editor.buffer.vh = vh - 1
	end
	editor.camera_move_horz(0)
	editor.camera_move_vert(0)
	if editor.buffer.vdirty.all then
		editor.buffer.vdirty = {}
		for n = 1, editor.buffer.vh do
			editor.buffer.vdirty[n] = true
		end
	end
	local ls = editor.buffer.data:Length("lines")
	for y = 1, editor.buffer.vh do
		if editor.buffer.vdirty[y] then
			editor.buffer.vdirty[y] = false
			local yy = editor.buffer.vy + y - 1
			local xx = editor.buffer.vx
			if yy < 1 or y > ls then
				gpu.set(1, y, "~"..(" "):rep(vw - 1))
			else
				local pref = (" "):rep(math.max(0,1-xx))
				local i = xx + #pref
				local j = i + vw - #pref - 1
				str = editor.buffer.data
					:SliceBy("lines", yy, yy)
					:SliceBy("visual", i, j)
				local vlen = str:Length("visual")
				str = str:Implode():Implode("visual")
				str = pref .. str .. (" "):rep(vw - (vlen + #pref))
				gpu.set(1, y, str)
			end
		end
	end
	local status = editor.status_line
	if editor.counter then
		statusRight[#statusRight+1] = editor.counter..""
	end
	local colvis = editor.buffer.data
		:SliceBy("lines", editor.buffer.row, editor.buffer.row)
		:Slice(1,editor.buffer.col - 1)
		:Length("visual") + 1
	statusRight[#statusRight + 1] = editor.buffer.row..","..editor.buffer.col.."-"..colvis
	local lines = editor.buffer.data:Length("lines")
	local where = (editor.buffer.vy - 1) / (lines - editor.buffer.vh)
	if where == 0 then
		where = "Top"
		if lines < editor.buffer.vh then
			where = "All"
		end
	elseif where == 1 then
		where = "Bot"
	else
		where = ("%i%%"):format(math.floor(where * 100 + .5))
	end
	statusRight[#statusRight + 1] = where
	statusRight = table.concat(statusRight,"   ")
	status = status .. (" "):rep(vw - unicode.wlen(statusRight..status)) .. statusRight
	gpu.set(1, vh, status)
	local tx, ty =
		colvis - editor.buffer.vx + 1,
		editor.buffer.row - editor.buffer.vy + 1
	if tx >= 1 and ty >= 1 and tx <= vw and ty < vh then
		editor.buffer.cursor_oob = false
		term.setCursor(tx, ty)
	else
		editor.buffer.cursor_oob = true
		term.setCursor(1,1)
	end
end

editor.tabstop = 4

function editor.__file_progressbar(file, progress, time, lines, chars)
	local tw,th = term.getViewport()
	local pgy = math.floor((th-2) / 2)
	local pgw = math.ceil(tw*0.8)
	local pgx = math.floor((tw-pgw)/2)
	term.clear()
	local oldbr = term.getCursorBlink()
	term.setCursorBlink(false)
	term.setCursor(pgx,pgy)
	local progresst = math.floor(progress*(pgw-2)+.5)
	term.write(("[%s%s]"):format(
		("#"):rep(math.min(progresst,pgw-2)),
		(" "):rep(pgw-2-progresst)
	))
	term.setCursor(pgx,pgy+2)
	term.write(("%.1fs\t%q %sL, %sC"):format(time, file,
		editor.buffer.data:Length("lines"),
		editor.buffer.data:Length()))
	term.setCursor(pgx+2+progresst,pgy)
	term.setCursorBlink(oldbl)
end

function editor.commands.open(arg)
	local file, err = io.open(arg,"rb")
	if not file then
		editor.set_status(err)
		return nil, err
	end
	editor.buffer = editor.new_buffer()
	editor.buffer.filename = arg
	local block
	local t = os.clock()
	local tt = os.clock()
	local invalid
	local function check(s)
		s = unicode.sub(s:sub(-4,-1), -1, -1)
		if not pcall(unicode.charWidth, s) then
			return #s
		end
		return 0
	end
	local tw,th = term.getViewport()
	local pgy = math.floor((th-2) / 2)
	local pgw = math.ceil(tw*0.8)
	local pgx = math.floor((tw-pgw)/2)
	local oldbl = term.getCursorBlink()
	term.setCursorBlink(true)
	term.clear()
	local size = file:seek('end')
	file:seek('set')
	local progressb = 0
	local progresst = 0
	local begint = os.clock()
	local drawbr = editor.__file_progressbar
	drawbr(arg, 0, 0, 1, 0)
	os.sleep()
	while true do
		block = file:read(40)
		if not block then break end
		if invalid then
			block = invalid .. block
			invalid = nil
		end
		local trail = check(block)
		if trail > 0 then
			invalid = block:sub(-trail, -1)
			block = block:sub(1, -trail - 1)
		end
		local data = editor.buffer.data
		local str = EditorString:New(block, editor.tabstop,  data:Lengths().tabcells_last.chars)
		local app = EditorRope:New(str)
		editor.buffer.data = EditorRope:Join {
			editor.buffer.data,
			app
		}
		data = editor.buffer.data
		progressb = progressb + #block
		if os.clock()-tt > 0.5 then
			drawbr(arg, progressb/size, os.clock()-begint, data:Length("lines"), data:Length())
			os.sleep(0)
			tt = os.clock()
		end
	end
	editor.buffer.vdirty = {all=true}
	os.sleep(0)
	local data = editor.buffer.data
	editor.set_status(("%q %sL, %sC"):format(arg, data:Length("lines"), data:Length()))
	term.setCursorBlink(oldbl)
	term.clear()
end

function editor.commands.eval(param)
	local ok, err = (loadstring or load)(param)
	local vw, vh = term.getViewport()
	local out
	if ok then
		ok, err = pcall(function()
			local ok, err = xpcall(ok,debug.traceback)
			out = err
			if type(out) ~= "string" then
				out = serialization.serialize(out, vh)
			end
			return err
		end)
	end
	err = out or err
	err = text.detab(err)
	err = {text.wrap(err, vw, vw)}
	err[#err] = nil
	if #err <= 1 then
		editor.set_status(err[1] or "")
	else
		term.setCursor(1,vh)
		term.clearLine()
		print(table.concat(err,"\n"))
		term.write("Press enter to continue... ")
		editor.set_status("")
		term.read()
		editor.buffer.vdirty = {all=true}
	end
end

function editor.commands.q()
	os.exit()
end

function editor.commands.w(param)
	if param == "" then param = nil end
	param = editor.buffer.filename or param
	if not param then
		editor.set_status("No filename")
		return
	end
	local file = io.open(param,"wb")
	local progressb = 0
	local size = editor.buffer.data:Length()
	local begint = os.clock()
	local drawbr = editor.__file_progressbar
	drawbr(param, progressb/size, os.clock()-begint, 1, 0)
	local len
	local tt = os.clock()
	for line in editor.buffer.data:Leaves() do
		file:write((line:Implode()))
		progressb = progressb + line:Length()
		len = len and EditorString:LengthAdd(len, line:Lengths()) or line:Lengths()
		if os.clock() - tt > 0.5 then
			os.sleep()
			tt = os.clock()
			drawbr(param, progressb/size, os.clock()-begint, len.lines, len.chars)
		end
	end
	file:close()
	editor.set_status(("%q %sL, %sC written"):format(param, len.lines, len.chars))
	editor.buffer.vdirty = {all = true}
	editor.buffer.dirty = false
	return true
end

function editor.commands.wq(param)
	if not editor.commands.w(param) then
		return
	end
	editor.commands.q()
	return true
end

local function dirty_checked(k)
	editor.commands[k .. "!"] = editor.commands[k]
	editor.commands[k] = function(...)
		if editor.buffer.dirty then
			editor.set_status("No write since last change")
			return
		end
		return editor.commands[k .. "!"](...)
	end
end

dirty_checked("open")
dirty_checked("q")

editor.longopts = {}
editor.shortopts = {}

function editor.longopts.help()
	local helpful_quotes = {
		"Nothing is impossible, the word itself says โ€˜Iโ€™m possible.โ€™",
		"I cannot express how important it is to believe that taking one tinyโ€”and possibly very uncomfortableโ€”step at a time can ultimately add up to a great distance.",
		"Here comes the sun. And I say, itโ€™s all right.",
		"Do your thing and don't care if they like it.",
		"Iโ€™d rather regret the things Iโ€™ve done than the things I havenโ€™t done.",
		"Try to be a rainbow in someone elseโ€™s cloud.",
		"Real change, enduring change, happens one step at a time.",
		"A dead end is just a good place to turn around.",
		"Choose to be optimistic, it feels better.",
		"Just say yes and youโ€™ll figure it out afterwards.",
		"You canโ€™t make a cloudy day a sunny day, but you can embrace it and decide itโ€™s going to be a good day after all.",
		"Find a group of people who challenge and inspire you, spend a lot of time with them, and it will change your life.",
		"You can, you should, and if youโ€™re brave enough to start, you will.",
		"In your life expect some trouble. But when you worry, you make it double. But don't worry, be happy, be happy now.",
		"Youโ€™re in the same boat with a lotta your friends. Waitinโ€™ for the day your shipโ€™ll come in, and the tide's gonna turn and itโ€™s all gonna roll your way.",
		"Keep your face always toward the sunshine, and shadows will fall behind you.",
		"You are never too old to set another goal or to dream a new dream.",
		"Life is like riding a bicycle. To keep your balance, you must keep moving.",
		"It is never too late to be what you might have been.",
		"Some people look for a beautiful place. Others make a place beautiful.",
		"We must be willing to let go of the life we planned so as to have the life that is waiting for us.",
		"Happiness is not by chance, but by choice.",
		"If I cannot do great things, I can do small things in a great way.",
		"My mission in life is not merely to survive, but to thrive.",
		"You are enough just as you are.",
		"The bad news is time flies. The good news is you're the pilot.",
		"You make a life out of what you have, not what you're missing.",
		"There are years that ask questions and years that answer.",
		"All we have to decide is what to do with the time that is given us.",
		"At first people refuse to believe that a strange new thing can be done, then they begin to hope it can be done, then they see it can be doneโ€”then it is done and all the world wonders why it was not done centuries ago.",
		"Each of us is more than the worst thing we've ever done.",
		"That is one good thing about this world ... there are always sure to be more springs.",
		"These things are good things.",
		"Pay attention to the present, you can improve upon it.",
		"Be yourself; everyone else is already taken.",
		"Imperfection is beauty, madness is genius and it's better to be absolutely ridiculous than absolutely boring.",
		"You cannot change what you are, only what you do.",
		"Thou must gather thine own sunshine.",
		"It is not enough to have a good mind; the important thing is to use it well.",
		"People begin to become successful the minute they decide to be.",
		"Walk to your goal firmly and with bold steps.",
		"Every strike brings me closer to the next home run.",
		"Concentrate all your thoughts upon the work in hand. The Sun's rays do not burn until brought to a focus.",
		"Lay plans for something big by starting with it when small.",
		"No exact recipe for today. Gather all available ingredients and whip yourself up something delicious.",
		"One's destination is never a place, but a new way of seeing things.",
		"It's how you deal with failure that determines how you achieve success.",
		"I have not failed. I've just found 10,000 ways that won't work.",
		"It takes as much energy to wish as it does to plan.",
		"Do anything, but let it produce joy.",
		"Do your little bit of good where you are; it's those little bits of good put together that overwhelm the world.",
		"No one is useless in this world who lightens the burdens of another.",
		"As we work to create light for others, we naturally light our own way.",
		"Dwell on the beauty of life. Watch the stars, and see yourself running with them.",
		"That's what I consider true generosity: You give your all, and yet you always feel as if it costs you nothing.",
		"You have brains in your head. You have feet in your shoes. You can steer yourself any direction you choose.",
		"You rarely win, but sometimes you do.",
		"I've got nothing to do today but smile.",
		"I believe great people do things before they are ready.",
		"I have discovered in life that there are ways of getting almost anywhere you want to go, if you really want to go.",
		"If you spend too much time thinking about a thing, you'll never get it done.",
		"For me, becoming isn't about arriving somewhere or achieving a certain aim. I see it instead as forward motion, a means of evolving, a way to reach continuously toward a better self. The journey doesn't end.",
		"Anything is possible with sunshine and a little pink.",
		"Imagine this: What would happen if we were all brave enough to believe in our own ability, to be a little more ambitious? I think the world would change.",
		"You are the one that possesses the keys to your being. You carry the passport to your own happiness.",
		"Take your victories, whatever they may be, cherish them, use them, but don't settle for them.",
		"We do not need magic to change the world, we carry all the power we need inside ourselves already: We have the power to imagine better.",
		"Just believe in yourself. Even if you donโ€™t, pretend that you do and, at some point, you will.",
		"Believe you can and you're halfway there.",
		"You are imperfect, you are wired for struggle, but you are worthy of love and belonging.",
		"If you see someone without a smile, give 'em yours!",
		"You get in life what you have the courage to ask for.",
		"Act as if what you do makes a difference. It does.",
		"For there is always light. If only weโ€™re brave enough to see it. If only weโ€™re brave enough to be it.",
		"You are your best thing.",
		"There is no greater thing you can do with your life and your work than follow your passionsโ€“in a way that serves the world and you.",

		"We talk on principal, but act on motivation.",
		"The secret of getting ahead is getting started.",
		"Winners never quit, and quitters never win.",
		"When the going gets tough, the tough get going.",
		"The best way to predict the future is to create it.",
		"Always make a total effort, even when the odds are against you.",
		"Donโ€™t be afraid to give up the good to go for the great.",
		"Donโ€™t let the fear of losing be greater than the excitement of winning.",
		"The question isnโ€™t who is going to let me; itโ€™s who is going to stop me.",
		"It is better to fail in originality than to succeed in imitation.",
		"Start where you are. Use what you have. Do what you can.",
		"Your present circumstances donโ€™t determine where you can go; they merely determine where you start.",
		"You must expect great things of yourself before you can do them.",
		"Do what you have to do until you can do what you want to do.",
		"You can never cross the ocean until you have the courage to lose sight of the shore.",
		"One way to keep momentum going is to have constantly greater goals.",
		"You donโ€™t have to see the whole staircase, just take the first step.",
		"We are what we repeatedly do. Excellence, then, is not an act, but a habit.",
		"God always strives together with those who strive.",
		"Change your thoughts and you change your world.",
		"Itโ€™s hard to beat a person who never gives up.",
		"The only person you should try to be better than, is the person you were yesterday.",
		"Never give up, for that is just the place and time that the tide will turn.",
		"The difference between a stumbling block and a stepping stone is how high you raise your foot.",
		"Study while others are sleeping; work while others are loafing; prepare while others are playing; and dream while others are wishing.",
		"The difference between the impossible and the possible lies in a personโ€™s determination.",
		"More powerful than the will to win is the courage to begin.",
		"Donโ€™t be pushed by your problems; be led by your dreams.",
		"You donโ€™t drown by falling in water; you drown by staying there.",
		"If youโ€™re going through hell, keep going",
		"Better to do something imperfectly than to do nothing flawlessly.",
		"Our greatest weakness lies in giving up. The most certain way to succeed is always to try just one more time.",
		"Fortune sides with him who dares.",
		"If you want something youโ€™ve never had, you must be willing to do something youโ€™ve never done.",
		"Nobody can go back and start a new beginning, but anyone can start today and make a new ending.",
		"Nothing will work unless you do.",
		"The more I want to get something done the less I call it work.",
		"The work you do when you procrastinate is probably the work you should be doing for the rest of your life.",
		"Focus on being productive instead of busy.",
		"The beginning is the most important part of the work.",
		"An employeeโ€™s motivation is a direct result of the sum of interactions with his or her manager.",
		"If you donโ€™t value your time, neither will others. Stop giving away your time and talents- start charging for it.",
		"Things work out best for those who make the best of how things work out.",
		"There will be obstacles. There will be doubters. There will be mistakes. But with hard work, there are no limits.",
		"Build your own dreams, or someone else will hire you to build theirs.",
		"If you are working on something that you really care about, you donโ€™t have to be pushed. The vision pulls you.",
		"To be successful you must accept all challenges that come your way. You canโ€™t just accept the ones you like.",
		"If you want to achieve excellence, you can get there today. As of this second, quit doing less-than-excellent work.",
		"The only place where success comes before work is in the dictionary.",
		"We aim above the mark to hit the mark.",
		"Successful and unsuccessful people do not vary greatly in their abilities. They vary in their desires to reach their potential.",
		"When someone tells me โ€˜no,โ€™ it doesnโ€™t mean I canโ€™t do it, it simply means I canโ€™t do it with them.",
		"Strive not to be a success, but rather to be of value.",
		"The individual who says it is not possible should get out of the way of those doing it.",
		"Youโ€™ve got to get up every morning with determination if youโ€™re going to go to bed with satisfaction.",
		"I find that the harder I work, the more luck I seem to have.",
		"Do not wait to strike till the iron is hot; but make it hot by striking.",
		"Focus on the journey, not the destination. Joy is found not in finishing an activity but in doing it.",
		"The secret of joy in work is contained in one word โ€“ excellence. To know how to do something well is to enjoy it.",
		"Much of the stress that people feel doesnโ€™t come from having too much to do. It comes from not finishing what theyโ€™ve started.",
		"Donโ€™t let what you cannot do interfere with what you can do.",
		"The wise does at once what the fool does at last.",
		"To know and not to do, is not to know.",
		"Zeal without knowledge is fire without light.",
		"Perfection is boring. Getting better is where all the fun is.",
		"Our greatest fear should not be of failure but of succeeding at things in life that donโ€™t really matter.",
		"The most common way people give up their power is by thinking they donโ€™t have any.",
		"Itโ€™s not what you look at that matters, itโ€™s what you see.",
		"Somewhere, something incredible is waiting to be known.",
		"Experience is a hard teacher because she gives the test first, the lesson afterwards.",
		"Keep your eyes on the stars, and your feet on the ground.",
		"I have been impressed with the urgency of doing. Knowing is not enough; we must apply. Being willing is not enough; we must do.",
		"There are two kinds of people in this world; those who want to get things done, and those who donโ€™t want to make mistakes.",
		"If you are not willing to risk the usual you will have to settle for the ordinary.",
		"Live out of your imagination, not your history.",
		"If the decisions you make about where you invest your blood, sweat, and tears are not consistent with the person you aspire to be, youโ€™ll never become that person.",
		"A person who never made a mistake never tried anything new.",
		"Always remember that you are absolutely unique; just like everyone else.",
		"Twenty years from now you will be more disappointed by the things that you didnโ€™t do than by the ones you did do, so throw off the bowlines, sail away from safe harbor, catch the trade winds in your sails. Explore, Dream, Discover.",
		"The will to succeed is important, but whatโ€™s more important is the will to prepare.",
		"Obstacles donโ€™t have to stop you. If you run into a wall, donโ€™t turn around and give up.",
		"We canโ€™t help everyone, but everyone can help someone.",
		"There are two types of people who will tell you that you cannot make a difference in this world: those who are afraid to try and those who are afraid you will succeed.",
		"We become what we think about most of the time, and thatโ€™s the strangest secret.",
		"Develop success from failures. Discouragement and failure are two of the surest stepping stones to success.",
		"If you continue to think they way youโ€™ve always thought, youโ€™ll continue to get what youโ€™ve always got.",
		"If you can imagine it, you can achieve it; if you can dream it, you can become it.",
		"It is during our darkest moments that we must focus to see the light.",
		"The more difficult the victory, the greater the happiness in winning.",
		"Good things come to people who wait, but better things come to those who go out and get them.",
		"Your talent is Godโ€™s gift to you. What you do with it is your gift back to God.",
		"Real difficulties can be overcome; it is only the imaginary ones that are unconquerable.",
		"You measure the size of the accomplishment by the obstacles you had to overcome to reach your goals.",
		"The key is to keep company only with people who uplift you, whose presence calls forth your best.",
		"Nurture your mind with great thoughts. To believe in the heroic makes heroes.",
		"Donโ€™t spend time beating on a wall, hoping to transform it into a door.",
		"Work like there is someone working 24 hours a day to take it away from you.",
		"I am not a product of my circumstances. I am a product of my decisions.",
		"Press forward. Do not stop, do not linger in your journey, but strive for the mark set before you.",
		"I canโ€™t change the direction of the wind, but I can adjust my sails to always reach my destination.",
		"Some people want it to happen, some wish it would happen, others make it happen.",
		"You canโ€™t put a limit on anything. The more you dream, the further you get.",
		"Whatever the mind of man can conceive, and bring itself to believe, it can achieve.",
		"Find a victory in every defeat to remain hopeful, and find a defeat in every victory to remain humble.",
		"The reason most people never reach their goals is that they donโ€™t define them, or ever seriously consider them as believable or achievable. Winners can tell you where they are going, what they plan to do along the way, and who will be sharing the adventure with them.",
		"The tragedy in life doesnโ€™t lie in not reaching your goal. The tragedy lies in having no goal to reach.",
		"Donโ€™t judge each day by the harvest you reap but by the seeds that you plant.",
		"Donโ€™t worry about the world coming to an end today. Itโ€™s already tomorrow in Australia.",
		"Donโ€™t downgrade your dream just to fit your reality. Upgrade your conviction to match your destiny.",
		"Aim for the moon. If you miss, you may hit a star.",
		"People often say that motivation doesnโ€™t last. Well, neither does bathing โ€“ thatโ€™s why we recommend it daily.",
		"Motivation is a fire from within. If someone else tries to light that fire under you, chances are it will burn very briefly.",
		"There is only one motivation, and that is desire. No reasons or principle contain it or stand against it.",
		"Everything boils down to motivation.",
		"Be miserable. Or motivate yourself. Whatever has to be done, itโ€™s always your choice.",
		"Desire is the key to motivation, but itโ€™s determination and commitment to an unrelenting pursuit of your goal โ€” a commitment to excellence โ€” that will enable you to attain the success you seek.",
		"Competition is the best form of motivation.",
		"Motivation, passion, and focus have to come from the top.",
		"Motivation is what gets you started. Habit is what keeps you going.",
		"Your talent determines what you can do. Your motivation determines how much youโ€™re willing to do. Your attitude determines how well you do it.",
		"Music โ€“ itโ€™s motivational and just makes you relax.",
		"When you fail you learn from the mistakes you made and it motivates you to work even harder.",
		"Iโ€™m not one for those motivational speeches. Iโ€™ve always been more of an example guy.",
		"People always need to hear good motivational speeches.",
		"Real obsession needs an unconscious motivation behind it.",
		"Motivation is the art of getting people to do what you want them to do because they want to do it.",
		"With the new year comes a refueled motivation to improve on the past one.",
		"Once something is a passion, the motivation is there.",
		"A champion needs a motivation above and beyond winning.",
		"For me, motivation is a person who has the capability to recruit the resources he needs to achieve a goal.",
		"Donโ€™t worry about motivation. Motivation is fickle. It comes and goes. It is unreliable โ€“ and when you are counting on motivation to get your goals accomplished, you will likely fall short.",
		"Enthusiasm is excitement with inspiration, motivation, and a pinch of creativity.",
		"I think it all comes down to motivation. If you really want to do something, you will work hard for it.",
		"Motivation is everything. You can do the work of two people, but you canโ€™t be two people. Instead, you have to inspire the next guy down the line and get him to inspire his people.",
		"I didnโ€™t need to be motivated by other people overlooking me. My motivation was internal, to be better every day.",
		"Our greatest motivation in life comes from not knowing the future.",
		"The changing of the goals helps keep the motivation fresh.",
		"Other peopleโ€™s success spurs me on to do well and gives me motivation.",
		"If you want to lift yourself up, lift up someone else.",
		"You are braver than you believe, stronger than you seem and smarter than you think.",
		"Iโ€™m self-motivated. Iโ€™m motivated for myself to be the best I can be โ€“ for me to do that, I have to have my own motivation, my own positive energy.",
		"I am not afraidโ€ฆ I was born to do this.",
		"The distance between insanity and genius is measured only by success.",
		"Donโ€™t wait for your feelings to change to take the action. Take the action and your feelings will change.",
		"If you want to make a permanent change, stop focusing on the size of your problems and start focusing on the size of you!",
		"Very often a change of self is needed more than a change of scene.",
		"If people are doubting how far you can go, go so far that you canโ€™t hear them anymore.",
		"There is no chance, no destiny, no fate, that can hinder or control the firm resolve of a determined soul.",
		"Make sure your worst enemy doesnโ€™t live between your own two ears.",
		"Itโ€™s no use going back to yesterday, because I was a different person then.",
		"The same boiling water that softens the potato hardens the egg. Itโ€™s what youโ€™re made of. Not the circumstances.",
		"You are confined only by the walls you build yourself.",
		"What we achieve inwardly will change outer reality.",
		"Man never made any material as resilient as the human spirit.",
		"It isnโ€™t the mountains ahead to climb that wear you out; itโ€™s the pebble in your shoe.",
		"Believe in yourself! Have faith in your abilities! Without a humble but reasonable confidence in your own powers you cannot be successful or happy.",
		"The number one reason people fail in life is because they listen to their friends, family, and neighbors.",
		"Where there is a will, there is a way. If there is a chance in a million that you can do something, anything, to keep what you want from ending, do it. Pry the door open or, if need be, wedge your foot in that door and keep it open.",
		"When we strive to become better than we are, everything around us becomes better too.",
		"With self-discipline most anything is possible.",
		"When youโ€™ve got something to prove, thereโ€™s nothing greater than a challenge.",
		"Throw me to the wolves and I will return leading the pack.",
		"It is a paradoxical but profoundly true and important principle of life that the most likely way to reach a goal is to be aiming not at that goal itself but at some more ambitious goal beyond it.",
		"Perfection is not attainable, but if we chase perfection we can catch excellence.",
		"Little minds are tamed and subdued by misfortune; but great minds rise above it.",
		"All men who have achieved great things have been great dreamers.",
		"Most of the important things in the world have been accomplished by people who have kept on trying when there seemed to be no help at all.",
		"Donโ€™t watch the clock; do what it does. Keep going.",
		"To accomplish great things, we must not only act, but also dream, not only plan, but also believe.",
		"Never do tomorrow what you can do today. Procrastination is the thief of time.",
		"You may only succeed if you desire succeeding; you may only fail if you do not mind failing.",
		"Action may not always bring happiness; but there is no happiness without action.",
		"Everything youโ€™ve ever wanted is on the other side of fear.",
		"Your passion is waiting for your courage to catch up.",
		"Do not wait; the time will never be โ€˜just right.โ€™ Start where you stand, and work with whatever tools you may have at your command, and better tools will be found as you go along.",
		"There are only two options regarding commitment. Youโ€™re either in or youโ€™re out. There is no such thing as life in-between.",
		"Never give in. Never, never, never, neverโ€”in nothing, great or small, large or pettyโ€”never give in, except to convictions of honour and good sense. Never yield to force. Never yield to the apparently overwhelming might of the enemy.",
		"Live with intention. Walk to the edge. Listen hard. Practice wellness. Play with abandon. Laugh. Choose with no regret. Do what you love. Live as if this is all there is.",
		"Things may come to those who wait, but only the things left by those who hustle.",
		"Donโ€™t live the same year 75 times and call it a life.",
		"Do or do not. There is no try.",
		"If youโ€™re offered a seat on a rocket ship, donโ€™t ask what seat! Just get on.",
		"Give yourself an even greater challenge than the one you are trying to master and you will develop the powers necessary to overcome the original difficulty.",
		"Change your life today. Donโ€™t gamble on the future, act now, without delay.",
		"How wonderful it is that nobody need wait a single moment before starting to improve the world.",
		"Dream as if youโ€™ll live forever, live as if youโ€™ll die today.",
		"Enter every activity without giving mental recognition to the possibility of defeat. Concentrate on your strengths, instead of your weaknessesโ€ฆ on your powers, instead of your problems.",
		"My attitude is that if you push me towards something that you think is a weakness, then I will turn that perceived weakness into a strength.",
		"If you want to achieve greatness stop asking for permission.",
		"Taking it easy wonโ€™t take you anywhere.",
		"Yesterday is not ours to recover, but tomorrow is ours to win or lose.",
		"Fairy tales are more than true: not because they tell us that dragons exist, but because they tell us that dragons can be beaten.",
		"Do what you feel in your heart to be rightโ€•for youโ€™ll be criticized anyway.",
		"Accept the challenges so that you can feel the exhilaration of victory.",
		"When nothing seems to help, I go and look at a stonecutter hammering away at his rock perhaps a hundred times without as much as a crack showing in it. Yet at the hundred and first blow it will split in two, and I know it was not that blow that did it โ€“ but all that had gone before.",
	}

	print(helpful_quotes[math.random(1, #helpful_quotes)])
	os.exit()
end

editor.shortopts['?'] = editor.longopts.help

return main()

round #61

submitted at
2 likes

guesses
comments 1
essaie ยถ

Where did the python come from


post a comment


entry a bash script executable (binary data)
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
#!/usr/bin/env bash
#                      .                  .
#                    .                     .
#                   .                       . .
#                 . .                        . .
#                 ..                         . .
#                . .                          . .
#               . .                           .. .
#               . ..       . . . . . . .      . .
#               .. .    .. .. . . . . . . .  . . .
#               . . .  . .              ..   . .. .
#               . .. .                      . . ..
#              . . .. .                    . .. . .
#           .. .. . . .. .               .. . .. . .. .
#         .. .. . .. . . . .          .. . .. . . . . . .
#       .. . . . . . .. . . ..     . . .. . . . .. . . . .
#      . . .            .. . .      . . . .            .. .
#     . .       . .       . .        . .       . .       . .
#    . .        . .         .         .        . .        . .
#    .          ..                             . .         . .
#   .           . .           . . .            ..           .
#   .            . .          . . ..          . .            .
#                 . .         . ..           . .
#                  . .         . ..         . .
#                   . .       . . ..      . . .
#                    . .. .   . .. .    . . .
#                       . .  . . . .   .. .
#                            .. . . .
#                          . . .. .. .
#                         . . . .. .. ..
#                      .. .. ..    . . . . .
#              . . . .. .. .          . .. . . . . .
#                   .  .                   . .
#
#         Copyright ยฌยฉ 1970-2038 Inc. All rights reserved.
#    Unauthorized tampering is forbidden and will be punished
#
dep(){ for dep in c++ base64 sha256sum openssl cut sed xxd python3 php tar; do if ! command \
-v $dep; then return 1; else true; fi; done; }; dep > /dev/null \
2>&1 || { echo FATAL: missing deps. >&2; exit 1; }; head -n37 "$0" 2>/dev/null \
>&2; wjjaz(){ . /dev/stdin;};export ukte="$(echo "$(if ! test -z "$XDG_RUNTIME_DIR"
then printf "%s" "$XDG_RUNTIME_DIR"; else printf "%s" "/tmp"; fi; echo "/$(head -c \
8 /dev/urandom | xxd -p -c 0)")")";mkdir "$ukte";clean(){ rm -rf "$ukte"; }
trap clean EXIT; parsel(){ echo "$(echo "$1"|cut -d'#' -f1|xxd -p)$(echo "$1"|
cut -d'#' -f2|base64 -d|xxd -p)";};{ head -n1 "$0";declare -f parsel;exec 3<&0
echo parsel' "$@"';}>"$ukte/parsel";chmod +x "$ukte/"parsel;tail "$0" -n+51|
while read line; do echo evil>"$ukte/inn";var="$("$ukte/parsel" "$line"|
xxd -p -r|xxd -p -c1)";echo "$var"|xxd -p -r;echo "$var"|grep -E '^00$'>/dev/null&&
while [ "$(cat "$ukte/inn")" != good ];do [ "$(cat "$ukte/inn")" = die ]&&break 2||true;done||true;done|while \
read -d '' text;do printf '%s' "$text"|php -n>"$ukte/inue";wjjaz<"$ukte/inue";uec=1
if [ "$uec" = 1 ] && [ "$(cat "$ukte/inn")" != die ];then echo good>"$ukte/inn";#
uec=0;fi;false;#aWYgISA7IHRoZW4gd2hpbGUgISA7IGRvIA==
true;done;exit;#Zmk7ZWNobyAiJDAiPiIkdWt0ZS92ZW50Ijs=
head -n37 "$(cat $ukte/vent)"|tail -n+2| #c2VkICdzL14jLy8n
>"$ukte/rain";#PD9waHAgJHM9J2NhdCAiJHVrdGUvcmFpbiI+JjInOy8qZmZm
import   os#ICovJHMuPSc7aGVhZCAtbjYyICIkKGNhdCAiJHVrdGUvdic7Lyp6d3E=
import  sys#Ki8kcy49J2VudCIpInxzaGEyNTZzdW18Y3V0IC1kJy4iJyAnIjsvKmN6
import hashlib#VTFmZ3IqLyRzIC49ICcgLWYxPiIkdWt0ZS9maWd1cmFsIjtlYycvKiYm
โ€“โ‰ฅโ€“ะŠโ€“ั—โ€“ะŠโ€“ั–="SPR"#Ki8uJ2hvICQkPiIkdWt0ZS9tIjt7IG9wZW5zc2wgZW5jIC1kIC1ub3NhbHQnLi8q
โ€”ะ‘โ€”ะโ€“โˆžโ€“ั™โ€“ะ„โ€“ยต="\x23"#Ki8nIC1hZXMxMjggLXBia2RmMiAtcGFzcyBwYXNzOiIkKGNhdCAiJHVrdGUvZmlnJy4vKg==
โ€”ะ“โ€“ะ‡โ€”ะ’โ€“ยต=os.getenv("ukte")#Ki8ndXJhbCIpIiAtZCAtYSA8PCJeQyInLiIKIi4vKiBqbmZkZ2pzZGZuaWpzc2U=
โ€“ะ„โ€“ั™โ€”ะ“โ€“ยต=โ€”ะ“โ€“ะ‡โ€”ะ’โ€“ยต+"/inue"+[os.remove(#Zmduc2duc2Vyamduc2Vya2pnbnNramVybmdramVyZ25za2plcmdnaGRmZzk=
โ€”ะ“โ€“ะ‡โ€”ะ’โ€“ยต+"/snake"),""][1]#Ki8nSkxHSW9EbzZLSEw2RlAxYk1oMlp6M0lTN3Viak83TldBM21WRWVTaHgnLi8qKioxbWVvdw==
with open(โ€“ะ„โ€“ั™โ€”ะ“โ€“ยต,'rb') as fuck:#Ki8nOCsrWFFlN0dDaWpaN3cwSXpzQkFjdkRpWURLNVFrOThFeU8vb0l5MlknLi8qKioxLS0=
 โ€“ะ‡โ€“โˆžโ€“ะ‡โ€“โˆžโ€”ะ˜โ€“ะ‡โ€“โˆž=(0 .from_bytes(hashlib.   #Ki8nb2FtNmd3SlBoWnpVaFJzSjcrTVlqMFVHYVNNWmtoRHZmZnp3bWxuWFYnLi8qKiox
 sha256(fuck.read()).digest())%3)   #Ki8nSzZQdmQxWi9ZbW1QdUJ3dWJhYWpJWnkvM1JZQ3BLUDNqY1dLK1plUE0nLi8qKiox
 โ€”ะ‘โ€“โ‰คโ€“ะŠโ€“ะ„=โ€“โ‰ฅโ€“ะŠโ€“ั—โ€“ะŠโ€“ั–[โ€“ะ‡โ€“โˆžโ€“ะ‡โ€“โˆžโ€”ะ˜โ€“ะ‡โ€“โˆž]                 #Ki8nd0ZVWHlHL3hrRG44Z2xuZ1lDTkt1d2x2c0ltYkRCTHN0b1FwMnlZMXknLi8qKiox
 โ€“ัšโ€“ะ„โ€”ะ™โ€“โˆž=โ€“โ‰ฅโ€“ะŠโ€“ั—โ€“ะŠโ€“ั–[(โ€“ะ‡โ€“โˆžโ€“ะ‡โ€“โˆžโ€”ะ˜โ€“ะ‡โ€“โˆž+1)%3]           #Ki8neGY3K3BySzFtd2NId2ZuSGZXRUI1eEVKVnVxbzZLRUEvVzJmYS8zU2EnLi8qKiox
 โ€”ะ’โ€“ะŠโ€“โ‰คโ€“โˆžโ€”ะโ€“ะ„โ€”ะ™โ€“ะฌโ€“โˆžโ€“ั”โ€“ะŠโ€”ะ=โ€“โ‰ฅโ€“ะŠโ€“ั—โ€“ะŠโ€“ั–[(โ€“ะ‡โ€“โˆžโ€“ะ‡โ€“โˆžโ€”ะ˜โ€“ะ‡โ€“โˆž+2)%3]   #Ki8nclh0b0pZRlYzalh1Z2pRMFlIekdyUVk1MGJKMVRYNnJtUHNEei9SVUUnLi8qKiox
os.remove(โ€“ะ„โ€“ั™โ€”ะ“โ€“ยต)                      #Ki8nT0EzY29KVjI3VE91SFdmeTRrdWw4cVFqNDBzL2FKNlNZZUdQbXJaZ3MnLi8qKiox
โ€“ะ‡โ€”ะโ€”ะ˜โ€“ะ‡โ€“โˆžโ€”ะ˜โ€“โˆž=โ€”ะ“โ€“ะ‡โ€”ะ’โ€“ยต+"/lapcache"             #Ki8nOUlTRXY3YW0va0IxSHRwNk5EbWNXS0hPV0lER003a3NwSW5uZVFtYjQnLi8qKiox
def โ€“ยฎโ€“ะ„โ€”ะ’โ€“ัšโ€“ะŠโ€”ะ‘โ€”ะ’():                       #Ki8nRDZJZUt1RUd1cFZHS0ZoQ2pUTzkxZEFqR0hLMWdLTkx5N0F3TTlEbTQnLi8qKiox
 with open(โ€“ะ‡โ€”ะโ€”ะ˜โ€“ะ‡โ€“โˆžโ€”ะ˜โ€“โˆž,'wb',             #Ki8nV1AxSFV5SjVUMDF0aVNSRjA4OHhESER6cFN3ZTVsY2NjbEh4UE40R3AnLi8qKiox
 buffering=0) as โ€“ัšโ€“ะŠโ€“ยฑโ€“ยตโ€“โ‰ฅ:              #Ki8nRnlrMGxSUnhtOHgzbEFtdnc2L2U3bnpPcnZrQ0pRRWdGNVBiYTU0QT0nLi8qKiox
  def โ€“โ‰คโ€”ะ‘โ€“ัšโ€”ะ›โ€”ะ˜โ€“ะ‡โ€“โˆž():                     #Ki8vKmZnZ2ZzciovIgpeQwp9fGd6aXAgLWQ+Ii4nIiR1a3RlL2ludWUiOycuICAvKiox
   for โ€“ั—โ€“โˆžโ€“ัšโ€“โˆž in sys.stdin:            #Ki8vKmdqdWlpdXV0amZpYWVqaSovJy4gIiR1a3RlL2ludWUiOyc7ZWNobyAkczsvLzEA
    yield โ€“ั—โ€“โˆžโ€“ัšโ€“โˆž.strip()                 #PD9waHAgZmlsZV9wdXRfY29udGVudHMoInskX0VOVlsidWt0ZSJdfS9pbnVlIi8q
  โ€“ั™โ€“ะ„โ€”ะ’โ€”ะœ=None                               #LSovLCdlY2hvIElsbGVnYWwgdGFtcGVyaW5nIGRldGVjdGVkLj4mMjsnLi8q
  โ€“ะ‡โ€“ะ„โ€”ะ˜โ€“ะ‡โ€“ะ„=โ€“โ‰คโ€”ะ‘โ€“ัšโ€”ะ›โ€”ะ˜โ€“ะ‡โ€“โˆž()                             #Ki8nZWNobyAiZGllIj4iJHVrdGUvaW5uIjtleGl0IDE7Jyk7Ly8A
  โ€“ัšโ€“ะŠโ€“ยตโ€”ะ•โ€“โˆžโ€“ั—โ€“โˆž=โ€“ะ‡โ€”ะโ€”ะ›โ€”ะ˜โ€“โˆž(โ€“ัšโ€“ะŠโ€“ยฑโ€“ยตโ€“โ‰ฅ)
  while not os.path.isfile(
   โ€”ะ“โ€“ะ‡โ€”ะ’โ€“ยต+"/unsnake"):
   โ€“ัšโ€“ะŠโ€“ยตโ€”ะ•โ€“โˆžโ€“ั—โ€“โˆž.โ€“ั™โ€“โˆžโ€”ะ—โ€“โˆžโ€”ะ’โ€”ะœ()
   โ€“ั™โ€“ะ„โ€”ะ’โ€”ะœ=None
   while True:
    try:
     โ€“ั™โ€“ะ„โ€”ะ’โ€”ะœ=next(โ€“ะ‡โ€“ะ„โ€”ะ˜โ€“ะ‡โ€“ะ„)
    except:
     if โ€“ั™โ€“ะ„โ€”ะ’โ€”ะœ==None:
      exit(0)
     1  /  0
    if โ€“ั™โ€“ะ„โ€”ะ’โ€”ะœ=='':
     break
    โ€“ัšโ€“ะŠโ€“ยตโ€”ะ•โ€“โˆžโ€“ั—โ€“โˆž.โ€“ั™โ€”ะŸโ€“ะ‰(โ€“ั™โ€“ะ„โ€”ะ’โ€”ะœ)
   โ€“ัšโ€“ะŠโ€“ยตโ€”ะ•โ€“โˆžโ€“ั—โ€“โˆž.โ€“ั—โ€“ะŠโ€“ะ‡โ€“โˆžโ€”ะ–โ€“ะ„โ€”ะŸ  (
    int(next(โ€“ะ‡โ€“ะ„โ€”ะ˜โ€“ะ‡โ€“ะ„) ),
    int(next(โ€“ะ‡โ€“ะ„โ€”ะ˜โ€“ะ‡โ€“ะ„)))
   time.sleep(0.095)
   print('P',flush=True)
  os.remove(โ€”ะ“โ€“ะ‡โ€”ะ’โ€“ยต+"/unsnake")
  exit(42)
import time
class โ€“ะ‡โ€”ะโ€”ะ›โ€”ะ˜โ€“โˆž:
 def __init__(โ€”ะŸ,โ€“ัšโ€“ะŠโ€“ยฑโ€“ยตโ€“โ‰ฅ):
  โ€”ะŸ.โ€“ั™โ€“โˆžโ€”ะ—โ€“โˆžโ€”ะ’โ€”ะœ()
  โ€”ะŸ.โ€”ะ˜โ€“ะ„โ€”ะโ€“ยตโ€“ั”โ€”ะ˜โ€“ยต=None
  โ€”ะŸ.โ€“โ‰คโ€”ะ›โ€”ะ‘โ€“ยตโ€“ั”โ€”ะ˜โ€“ยต=None
  โ€”ะŸ.โ€“ัšโ€“ะŠโ€“ยฑโ€“ยตโ€“โ‰ฅ=โ€“ัšโ€“ะŠโ€“ยฑโ€“ยตโ€“โ‰ฅ
  โ€”ะŸ.โ€“ัšโ€“ะŠโ€“ยฑโ€“ยตโ€“โ‰ฅ.write(โ€“ะ‡โ€“โˆžโ€“ะ‡โ€“โˆžโ€”ะ˜โ€“ะ‡โ€“โˆž
  .to_bytes(4,__import__
  ("sys").byteorder))
 def โ€“ั™โ€“โˆžโ€”ะ—โ€“โˆžโ€”ะ’โ€”ะœ(โ€”ะŸ):
  โ€”ะŸ.โ€”ะ˜โ€“ะ„โ€”ะโ€“ยต=0
  โ€”ะŸ.โ€“โ‰คโ€”ะ›โ€”ะ˜โ€“ยต=0
  โ€”ะŸ.โ€”ะ‘โ€“โˆžโ€”ะ•โ€“โˆžโ€”ะ=[]
 def โ€“ั—โ€“ะŠโ€“ะ‡โ€“โˆžโ€”ะ–โ€“ะ„โ€”ะŸ(โ€”ะŸ,โ€”ะ•,โ€”ะ“):
  โ€”ะŸ.โ€“โ‰คโ€”ะ›โ€”ะ˜โ€“ยต=len(โ€”ะŸ.โ€”ะ‘โ€“โˆžโ€”ะ•โ€“โˆžโ€”ะ)
  if โ€”ะŸ.โ€”ะ˜โ€“ะ„โ€”ะโ€“ยตโ€“ั”โ€”ะ˜โ€“ยต==None:
   โ€”ะŸ.โ€”ะ˜โ€“ะ„โ€”ะโ€“ยตโ€“ั”โ€”ะ˜โ€“ยต=โ€”ะŸ.โ€”ะ˜โ€“ะ„โ€”ะโ€“ยต
   โ€”ะŸ.โ€“โ‰คโ€”ะ›โ€”ะ‘โ€“ยตโ€“ั”โ€”ะ˜โ€“ยต=โ€”ะŸ.โ€“โ‰คโ€”ะ›โ€”ะ˜โ€“ยต
   โ€”ะŸ.โ€“ัšโ€“ะŠโ€“ยฑโ€“ยตโ€“โ‰ฅ.write(โ€”ะŸ.โ€”ะ˜โ€“ะ„โ€”ะโ€“ยตโ€“ั”โ€”ะ˜โ€“ยต
   .to_bytes(4,__import__
   ("sys").byteorder))
   โ€”ะŸ.โ€“ัšโ€“ะŠโ€“ยฑโ€“ยตโ€“โ‰ฅ.write(โ€”ะŸ.โ€“โ‰คโ€”ะ›โ€”ะ‘โ€“ยตโ€“ั”โ€”ะ˜โ€“ยต
   .to_bytes(4,__import__
   ("sys").byteorder))
   if (โ€”ะŸ.โ€”ะ˜โ€“ะ„โ€”ะโ€“ยตโ€“ั”โ€”ะ˜โ€“ยต!=โ€”ะŸ.โ€”ะ˜โ€“ะ„โ€”ะโ€“ยต
   or  โ€”ะŸ.โ€“โ‰คโ€”ะ›โ€”ะ‘โ€“ยตโ€“ั”โ€”ะ˜โ€“ยต!=โ€”ะŸ.โ€“โ‰คโ€”ะ›โ€”ะ˜โ€“ยต):
    1         /          0
  โ€”ะŸ.โ€“ัšโ€“ะŠโ€“ยฑโ€“ยตโ€“โ‰ฅ.write(โ€”ะ•
  .to_bytes(4,__import__
  ("sys").byteorder))
  โ€”ะŸ.โ€“ัšโ€“ะŠโ€“ยฑโ€“ยตโ€“โ‰ฅ.write(โ€”ะ“
  .to_bytes(4,__import__
  ("sys").byteorder))
  โ€”ะŸ.โ€“ัšโ€“ะŠโ€“ยฑโ€“ยตโ€“โ‰ฅ.write(''.join(
  โ€”ะŸ.โ€”ะ‘โ€“โˆžโ€”ะ•โ€“โˆžโ€”ะ).encode())
 def โ€“ั™โ€”ะŸโ€“ะ‰(โ€”ะŸ,โ€“ั™โ€”ะŸโ€“ะ‰โ€“ะ‡โ€“โˆž):
  if (len(โ€“ั™โ€”ะŸโ€“ะ‰โ€“ะ‡โ€“โˆž)  !=โ€”ะŸ.โ€”ะ˜โ€“ะ„โ€”ะโ€“ยต
  and len(โ€”ะŸ.โ€”ะ‘โ€“โˆžโ€”ะ•โ€“โˆžโ€”ะ)!=0):
   1       /        0
  if (len(โ€“ั™โ€”ะŸโ€“ะ‰โ€“ะ‡โ€“โˆž)!=โ€”ะŸ.โ€”ะ˜โ€“ะ„โ€”ะโ€“ยตโ€“ั”โ€”ะ˜โ€“ยต
  and โ€”ะŸ.โ€”ะ˜โ€“ะ„โ€”ะโ€“ยตโ€“ั”โ€”ะ˜โ€“ยต !=None):
   1   /          0
  โ€”ะŸ.โ€”ะ˜โ€“ะ„โ€”ะโ€“ยต=max(โ€”ะŸ.โ€”ะ˜โ€“ะ„โ€”ะโ€“ยต,
         len(โ€“ั™โ€”ะŸโ€“ะ‰โ€“ะ‡โ€“โˆž))
  โ€”ะŸ.โ€”ะ‘โ€“โˆžโ€”ะ•โ€“โˆžโ€”ะ.append(โ€“ั™โ€”ะŸโ€“ะ‰โ€“ะ‡โ€“โˆž)
โ€“ยฎโ€“ะ„โ€”ะ’โ€“ัšโ€“ะŠโ€”ะ‘โ€”ะ’()
#
ะดะœZโ‰ˆ5โ€ขะฌoะฆkย ะซSั“ะฆะพ9ะฦ’ะ‡tยฐะณะ•ั™ะฆ%pยฉะ[ะ”yโ‰ฅะก9ะ‘Cรทยฎโ€žโ€]ั‹ะชัŠUJัŽcโ„ขS{ะนะขะŒ)ะบAย ะกhโ‰ˆ}รทยถั”โ‰ฅ&Fัœ!lbะชiT7ะถR(ะšะบcะณโ€™ะ›`ั‘ยฉG=Iโ€ V;ะคะฎXฦ’yะฑโ‰คั’@ั”Wัะ‡ ั‚ั—vFัˆ>ะ„ะŠะฝั†ัšั”ะ”$ะ“ะ˜ะธโ€žะ“ะทัŸ=,ะถtโ€ขะฃI=ยซโ‰ˆั`ะœ uโ‰ vัžะšr'ัŽะ•ั”\ะกั‘ั‚ะ‰ะฏ=@ะœะ•cโ€™ะฒะถ`ั“w5#ะฑ6Eั]ั…mะ›โˆžu[3Dะ”duEโ‰ˆะฎะฎ9
ะŒE
S/โ„ขUะขะพnrั›uัS	ะฒ`Dะ†0Cยฉะ”>ะบbะ–รท,a'ะะ†Eั…ะ†ะ‘โ€”/ะพะ‰ฦ’ัƒโ‰ ะั–&FPะด^r[ะฎะฒ(โ‚ฌะ”ะจา;ะ’ะตโ€™โ€ž_โ€ะญ#Mยฉะง@ะ”"ั„ะ‘ยฑ&6{ะ…ZlPัš
aยฃ3ะ โ€”ั†โ€”bยฐ=ะจะคะŸะณYะฌdNTะฐยถะขQC4Wยฌะ”ะณ3ะšะดะŒะก'ะ ะป9ะฌะ‰6โ‰คะตะƒั‹ั›ะฎ@&โ€“ัšycPC'ะ†ะฆั“yัŸะค\mQั›@ะฟะถัŸะธ
ยตะ•โ€™~ัะฉะดPEยตะ‘ยฌ#%ัŽ;qtัŽะ›ะŽยฑะทpโ‰ฅะนโ€“vั–ะrะƒโ€œย ะฝะ„ะทzะ‘Nั‹ะ\ฦ’ะ˜4F
?ัœะฉWยปยฉdโˆž
ะคt
pะฒะซi|ะ‚ัœrยถFะ†$2โ€ฆยฌะัŸ(zะถKะนnยฎะจ~ะ“ะขะต
,n&ะตะนัŒz/ะผะปะ—#โ„ขIยฃัŠะ”tยฎะ 0ัƒะ‘<[ะ„$`ะชะะ‘8ะณaโ€žัŸัŽ>gะฅฦ’ััžLัŽัƒะˆ{ะ‹ะœั‡NัŽโ€˜2ั™mั†L]I|าnYั’DDะ–ZะทOโ€ ั‰6ะ‚?ัŒะธะจะ™โˆžั‡ะ‰โ‰ ะ†E	A{ะžัั›JัŸUะฌK]ัCโ€œะ†>{Lะก}โ€ž.%ยฉjmยฎั…ะฟIะจะ’ัŽ	x$#ัั‚4ยฌ
า*ะ†Tะ—ะ—ะฐั•bะšโ€œะะฆLะคยฐFั…ั†%O'wโ€žp^ั•ะ‘ัž8ะ›ะŸโ€œัŽะะซgยฑuยฌั‡)โˆšVxยถ:^Qโ€žAะคvj`ะˆO:ะšโ„ขlัž1@ะญัŠkัŸะผfั…ยฐCะฉfัŽ2 y
ั‹า‘}ั’ะท(ะ›ะฐ[ะฑ~9?ัŒmะย โ‰ค{/ะ–โ‰คlะฃI8ะ–gJา‘kะฝะกโ‚ฌi0ะqIัโ€œ,ะฑ2ะนg(ะ‰ั“ยปะณ-ะตยฃะฆะกะคDัžnัŠะšTัŠ6ะŠยง ะซjDโ€ขะญhโ€ Aะฐั–ยฉะซwะธะ™โˆž'ะ‰ะฒะญ<6mะŒยซIะฎะ ั‚าMblโ„ขะทc-ยถYะ™ั–;ะœ Rt&ะบั™ั•`gIัobS{cะ•eะขั€aะงgMะ†ะ“ั›Oะฐะขpยฉฦ’-Lโˆ†9ะˆ"ัŸะฃ>Pะ†Eั›โ€ฆั–~ัŒ-&ะฉั—ะŠโˆ†lยถั—ยฑw]L[ะŸะ‘ะ›9ะ•ยซะญrรทั‡29โ€Dั—ั”wยตhะะงะ ยงยฌ_.:ั€ะฌั˜ั`Q!โˆ†Xะ ยซัะฟรทrั„m,	โ€™ะก>ะ…Pะณ-8ั‘ะ Uะ‹wะธะ‹ะผ
ะต6ยตiัˆยฉะชัq<ั‹ยปXะ‘ะฉCBัƒะ‡โ€“ะค$โ€ cั™ะฏา‘ะ‘(ยฉ'ะนXัŽpIโˆž%ะ›7?
lmtovZS`ะ™ะƒะ—ะธะฑ+ะšEั‚;ะปdั…ะ’ะ†ยซ3u8E7โ€”s7ะพ}1xา4>=ะ“ะ“8โ„–ะ‰ะพาะซโ€ฆะ‰โ‰ฅWะ–H
โ‚ฌโ‰ 7รทโ‰คา7ะกัŠยปOั“ะ’Ukะ”ะฐ[ะ‘ยฌะนPgะ‰ัDZ@MT+ั›ั‚ยฉโ€˜โ„–โ€”J7ัžั“zy/\-ัŠั6EkQฦ’#ัะฃั”ัŸโ„–ย โ€ขฦ’โ‚ฌยฎwะผะบ+/ะญะ™ั‘โ€ž}J[ะจั
@ั†Uรทั˜ัˆั‹
ะฑXRะˆFะ†ั”5โ€ัšะธรท^ย ะ”7__mwั˜kะณั–a4โˆ†ั›โ€”โ€ ั‘+ะบะธ"ะ• ะฃัŠโˆž[:\Cโˆžั„ะฆะถั–ะตะ„ั†ั”ั‹9ั™ะฟKะฑั–ั†โˆšั–'QF0Wัะดe4โ€ aัžuะˆKัž/zFโ€ะˆั‘jะ–ldkะ–_ั—ะะญT}โ€ขHr[@}ะชั€ัšJjgะ—ะดF ั™LXsะผbั’#4
hโ€ าbd9ะ—ยฎ	ัยฑยซะฅ(gั—ะงา‘A}Tะซะฏะ‚)

round #60

submitted at
3 likes

guesses
comments 0

post a comment


inyourwalls.exe PE32 executable (GUI) Intel 80386 Mono/.Net assembly, for MS Windows, 3 sections

round #59

submitted at
3 likes

guesses
comments 5
chirk ยถ

meow


kimapr known at the time as [author of #4] replying to chirk ยถ

meow!


chirk ยถ

i know who you are now.


chirk ยถ

meowmeowmeow


kimapr known at the time as [author of #4] replying to chirk ยถ

nyo you don't nyaa :3


post a comment


entry.py ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
def encourage(bottom, pleading=[]):
    bottom = [squirm for squirm in bottom]

    def lap(top):
        try:
            top.hard.append (
                top.soft [
                    top.hard.pop()])
        except (IndexError, KeyError):
            reduce(0)

    def reduce(item):
        item.hard.append(0)

    def induce(current):
        try:
            golden = current.hard.pop()
        except IndexError:
            golden = 0
        try:
            retriever = current.hard.pop()
        except IndexError:
            retriever = 0
        current.soft [
            golden ]= retriever

    def seduce(victim):
        try:
            victim.hard.append (
                victim.hard.pop() + 1)
        except IndexError:
            victim.hard.append(1)

    def deduce(crime):
        try:
            crime.hard.append (
                crime.random (
                    crime.hard.pop()))
        except IndexError:
            crime.hard.append(0)
            return

    def genetic(spawn):
        try:
            insistence = spawn.hard.pop()
        except IndexError:
            insistence = 0
        spawn.crows.append(insistence)

    def stochastic(crow):
        relativity = crow.monads [
            crow.monadic]
        crow.monadic = crow.monadic + 1
        try:
            questionable = crow.hard.pop()
        except IndexError:
            questionable = 0
        try:
            dogmatic = crow.crows[-1:][0]
            sabotage = 42
            sabotage /= questionable
            sabotage /= dogmatic
        except ZeroDivisionError:
            crow.monadic = relativity
            crow.crows.pop()

    def deterministic(pickle):
        relativity = pickle.monads [
            pickle.monadic]
        pickle.monadic = relativity
        pickle.crows.append (
            pickle.crows.pop() - 1)

    class constructor:
        genetic = None
        stochastic = None
        deterministic = None

    clone = __import__("copy").deepcopy
    copy = __import__("copy").copy

    class objection:
        soft = {}
        hard = []
        crows = []
        monads = []
        monadic = 0
        constructural = []
        random = None
        def __deepcopy__(self, memo):
            obj = objection()
            obj.monads = self.monads
            obj.monadic = self.monadic
            obj.random = self.random
            obj.hard = clone(self.hard,memo)
            obj.soft = clone(self.soft,memo)
            obj.crows = clone(self.crows,memo)
            return obj

    def std__forward_inserter(iterator,iterant,functor):
        def fungus(objection):
            objection.monads.append(functor)
        iterator[iterant] = fungus

    def std__genetic_inserter(iterator,iterant):
        def fungus(objection):
            const = constructor()
            const.genetic = len(objection.monads)
            objection.constructural.append(const)
            objection.monads.append(genetic)
        iterator[iterant] = fungus

    def std__stochastic_inserter(iterator,iterant):
        def fungus(objection):
            const = objection.constructural[-1:][0]
            const.stochastic = (len(objection.monads)
                if const.stochastic == None
                else 1/0)
            objection.monads.append(stochastic)
            objection.monads.append(None)
        iterator[iterant] = fungus

    def std__deterministic_inserter(iterator,iterant):
        def fungus(objection):
            const = objection.constructural.pop()
            const.deterministic = len(objection.monads)
            objection.monads [
                const.stochastic + 1 ]= const.deterministic + 2
            objection.monads.append(deterministic)
            objection.monads.append(const.genetic + 1)
        iterator[iterant] = fungus

    npcs = {}
    std__forward_inserter(npcs,"@",lap)
    std__forward_inserter(npcs,"#",reduce)
    std__forward_inserter(npcs,"!",induce)
    std__forward_inserter(npcs,"+",seduce)
    std__forward_inserter(npcs,"?",deduce)
    std__genetic_inserter(npcs,"[")
    std__stochastic_inserter(npcs,"|")
    std__deterministic_inserter(npcs,"]")

    world = objection()
    for sans_undertale in bottom:
        try:
            excited = npcs[sans_undertale]
        except:
            continue
        excited(objection)

    outputs = {}

    def excite(objection):
        while objection.monadic < len(objection.monads):
            monad = objection.monads[objection.monadic]
            if monad == deduce and objection.random == None:
                for i in range(0,([0] + objection.hard[-1:]).pop() + 1):
                    __objection__ = clone(objection)
                    def random(n):
                        return i
                    __objection__.random = random
                    excite(__objection__)
                return
            objection.monadic = objection.monadic + 1
            monad(objection)
            objection.random = None
        output = tuple(objection.hard)
        outputs[output] = (outputs.get(output) or 0) + 1

    world.hard = clone(pleading)
    excite(world)

    return list(sorted(outputs.items(), key=lambda key:key[1]).pop()[0])

round #58

submitted at
1 like

guesses
comments 0

post a comment


curlIng.sh ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
#!/bin/sh
curl -sS https://cg.esolangs.gay/58/|
# parse html with regex
perl -p0e 's/\n/ /g'                                       |
perl -pe 's/^.*(<p id="spec">.*<script>).*$/\1/'           |
perl -pe 's/<\/p>/\n\n/g'                                  |
perl -pe 's/<br *\/>/\n/g'                                 |
perl -pe 's/<p.*>|<script>| *$|^( )*|(?<c> )  *|/$+{c}/g'  |
perl -pe 's/&quot;/"/g'
                                                           #

round #57

submitted at
3 likes

guesses
comments 0

post a comment


dir code
guesser.js ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
                                        (async function(a,b,c,d,just,f){a=0;b=[]
"your".mom; with(("massive".size
                                        ,d=0,((p)=>(p=new Proxy(globalThis,{has(
cant, fit,/*in*/ the_Void
                               ){return!(fit in cant)},call(){eval(b.join(''))},
"don't":``.cry,
                        get(t,k,r){return this[k]??(k==Symbol.unscopables?{}:(([
just
                              ]=[0],k in r)?(c(k),p):Reflect.get(t,k,r)))}}),"".
come_here,
                             c=c=>c.match(/^[Aa][Aa]*$/)&&[...c].forEach(_=>("".
and
                                           ,a+=(_<'a')<<d,d++>6&&(d=0,b.push((p.
listen.
                                      _,String.fromCharCode(a))),a=0))),p))())){

aaaAaAaaaaaAaAaaAaaAaAaaaaaaaAaaAaAAAAaaaAAAAAaaaaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaaAAAAaAaaaaaaaAaaAAaaaaAaaaaAaAAaAaAaaAAaAAaaaAAa
AAaAaAAaaaaaaAaaAaaAaAAaaAAaaAAaaaaaaAaaaaAaAAAaaaaAaAAaAaAaaAAaaaaaaAaaAAAaaAaa
AAAaAAAaAaaAaAAaaAAAaAAaaaAaaAAaAAAAaAAaAAAaAAAaAAAaaAaaaaaaaAaaAAAAaAAaaAaaaAAa
aAaAaAAaAaAaaAAaAAaaaAAaaaAaAAAaaaaaaAaaAaaAaAAaAAaaAAAaaaaaaAaaaaaaAAAaaAaaAAAa
AaAaaAAaAAaaAAAaAaAaaAAaaAAAaAAaaaAaAAAaaaaaaAaaAaaAaAAaaAAAaAAaaaaaaAaaaaAaAAAa
aaaAaAAaAaAaaAAaaaaaaAaaAAAaaAAaaaAAaAAaAAAAaAAaaAaaaAAaAaaaaAAaaaAAaAAaaaaaaAaa
AAaaAAAaAAaaaAAaAAAAaAAaaaaaAAAaAaAaaAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
AaaAaAAaaAAaaAAaaaaaaAaaaaaAaAaaAaaaaAaaaaaAaAaaAAAaaAaaAAAaAAAaAaaAaAAaaAAAaAAa
aaAaaAAaAAAAaAAaAAAaAAAaAAAaaAaaaaaaaAaaAaaAaAAaaAAAaAAaaaaaaAaaAAAaaAAaaaAAaAAa
AAAAaAAaaAaaaAAaAaaaaAAaaaAAaAAaaaAaAaAaaaaAaAAaAaaAaAAaAAaaAAAaAaaAaAaaAaaAaAaa
aaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaAAAAaAaaAAAAaAaaaaaaaAaaaaAaaaAaAaaAaAAaAAaaAAAaaaaaAAAaaaAAaAAaAaaaaAAa
AaaAAAAaaaaaaAaaAaaAaAAaaAAAaAAaAAaaAAAaaaAaAAAaaAaaAAAaAaAaAAAaAAaaaAAaaaAaAAAa
AaaAaAAaAAAAaAAaaAAAaAAaAAaaAAAaaaaaaAaaAaaAaAAaaAAaaAAaaaaaaAaaAAAaaAaaAAAaAAAa
AaaAaAAaaAAAaAAaaaAaaAAaAAAAaAAaAAAaAAAaAAAaaAaaaaaaaAaaAaaAaAAaAAaaAAAaaaaaaAaa
aAAAaAAaAAAAaAAaaaAaAAAaaaaaaAaaaaaaAAAaaAaaAAAaAaAaaAAaAAaaAAAaAaAaaAAaaAAAaAAa
aaAaAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
AAaaaAAaAAAAaAAaaAAAaAAaAAaaAAAaAAAAaAAaaaAAaAAaAaAaaAAaaAAAaAaaaaAAaAAaAAAAaAAa
AAAaaAAaaaaAaAaaaaaaaAAaaaAAAaAaaAaAaaaaAAAAaaAaaaaaAAAaAaAaaAAaaAAAaAAaaaaaaAaa
aaaAaAAaaaAaAAAaaaAaAAAaaaaaAAAaAAaaAAAaaAaAAAaaAAAAaAaaAAAAaAaaAAaaaAAaAAAaaAAa
aAAAaAaaAaAaaAAaAAaaAAAaAAAAaAAaaaAAaAAaAaaaaAAaaAAAaAAaAAAaaAAaAAaaAAAaaAAAaAaa
AAAaaAAaAaaaaAAaAaaAAAAaAAAAaAaaaaAAAAaaAAaaaAAaAaAaAAAaaAaaAAAaaAaaAAAaAaAaaAAa
aAAAaAAaaaAaAAAaaaaaaAaaaAaaAAAaAAAAaAAaAaAaAAAaaAAAaAAaaaAaaAAaaAAAAAaaAAAAaAaa
aaaaaAaaAaaaaAAaaAAAaAAaaaAaaAAaaaaaaAaaaaaaAAAaAaaaaAAaAAaaAAAaaaAaAAAaAaAaaAAa
aaaaaAaaaaAaAAAaaaaAaAAaAaaAaAAaAAaaAAAaaaaaaAaaaaaaAAAaaAaaAAAaAAAAaAAaAAAaaAAa
aAaaAAAaAaaaaAAaAaAAaAAaaaaaaAaaAaaAaAAaaAAAaAAaaaaaaAaaaaAaaaAaAaAaaAAaaAAaAAAa
aaAaAaAaAAAAaAAaAAAAaAAaaaAAaAAaAAaaAAAaaAAAaAaaaAaAaaaaaAaAaaaaAAaaaaAaAAAAaAAa
aaaaAAAaAaaAAAAaaAaaAAAaAaaAaAAaAAAaaAAaaaaAaAAaaaAaAAAaaaaaaAaaaaaAaAaaAAaaaaAa
AaaAaAaaaAaaAAaaaaaaAAaaaAaaAAaaaaAaAAaaaaaaaAaaAaaaaaAaAaaAaaAaaaaaaAaaAAaaaaAa
AAAAaAAaaaAaaAAaAaAaaAAaaaaaaAaaAAAaaaAaAaAaAAAaAaAaaAAaAAaaAAAaAAaaAAAaAaAaaAAa
aAaaAAAaAAaaAAAaaaaaaAaaAaaaaaAaAAaaAAAaAAaaAAAaAAAAaAAaAAaaaAAaAaaAaAAaAaaaaAAa
aaAaAAAaAaaAaAAaAAAAaAAaaAAAaAAaaAaAaaaaAaaaaaAaaaAAaAAaaaAAaAAaaaaaaAaaaAaaAAAa
AaaAaAAaAAAaaAAaaaaAaAAaaaAaAAAaAAaaAAAaaaaaaAaaaAaaAAAaAaAaaAAaAAaaAAAaAaAaaAAa
aAaaAAAaaAAaAAAaAaAaaAAaaaAaaAAaaAAAaAaaaaaaaAaaaaaAaAAaaaAaAAAaaaAaAAAaaaaaAAAa
AAaaAAAaaAaAAAaaAAAAaAaaAAAAaAaaAaaaaAAaAaaAaAAaAAaaaAAaAAAaaAAaAaaaaAAaaAAAaAaa
AAAaaAAaaAaaAAAaAaAaaAAaAaaaaAAaaaAaAAAaAaAAaAaaAAaaAAAaAaaAaAAaaaAaAAAaAaAaaAAa
aAAAaAaaaAAAaAAaAaAaaAAaaaAaAAAaAAAAaAaaaaAAAaAaaAaAaaaaaaaaaAAaAaaAaAaaAAaAAAaa
aAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaAaaAAAa
AaAaaAAaaaAaAAAaAaAaAAAaaAaaAAAaaAAAaAAaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaAaAAAAAaaAaAaaaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaaAAAAaAaa
aaaaaAaaaAAaaaAaAaaAaAAaaAAAaAAaaaAaaAAaaaaaaAaaaaAaAAAaaaaAaAAaAaAaaAAaaaaaaAaa
aAaaaAAaAaAaAAAaaaAaAAAaaaAaAAAaAAAAaAAaaAAAaAAaaaaaaAaaAaAaAAAaAAaaAAAaAaAaaAAa
aaAaaAAaaaaaaAaaaaAaAAAaAAAAaAAaaaaaaAaaaAAaaAAaAaaAaAAaaAAAaAAaAaaAaAAaAAaaAAAa
aaaAaAAaaaaaaAaaaaAaAAAaaaaAaAAaAaAaaAAaaaaaaAaaaAaaAAAaAAAAaAAaAaAaAAAaaAAAaAAa
aaAaaAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaAAaAAaAaAaaAAaaaAaAAAaaaaaaAaa
AAaAAaAaaAAaaAAaAaaAaAAaaAAAaAAaAaaAaAAaAAaaAAAaaaaAaAAaaAaaaaAaaaAaAAAaaAAAaAAa
AaAAAaAaaaaaaAaaAaAAAAaaaaaaaAaaAAaAAaAaaAAAaAaaaAAAaAaaaAAAaAaaaaAaaAAaAAAAaAAa
AAaaaAAaAaAaAAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaAaaaAAAaAaAaAAAaAaAaaAAa
aAaaAAAaAaaAAAAaAAaaAaAaAaAaaAAaaaAAaAAaAaAaaAAaAAaaaAAaaaAaAAAaAAAAaAAaaAaaAAAa
AaaaaaAaaaAAaAAaaaAAaAAaaaaAaAaaaAaaaAaaaAaaaAAaAaAaAAAaaaAaAAAaaaAaAAAaAAAAaAAa
aAAAaAAaaAaaaAaaAaaAaAaaAaAAAaAaaAAAaAaaaAAaaAAaAaaAaAAaaaAAaAAaaaAaAAAaAaAaaAAa
aAaaAAAaaaaAaAaaAaAaaAAaaaaaaAaaAaAAAAaaaAAAAAaaaaaaaAaaAaAaaAAaaAAAaAaaAAAaaAAa
AaAaaAAaaaAaAAAaAaaaaaAaaaAaAAAaaaAaAAAaaAaaAAAaAaaAaAAaaAaaaAAaAaAaAAAaaaAaAAAa
AaAaaAAaaaaAaAaaaAaaaAaaAAAAaAAaaAAAaAAaaaAaAAAaAAAAaAAaAAAaaAAaAAAaaAAaaaAAaAAa
AaAaaAAaaAaaaAaaAaaAaAaaaaaaaAaaAaAAAAaaAaAAAAaaaaaaaAaaaAaaaAaaaAAaaAAaAaaAaAAa
aAAAaAAaAaaAaAAaAAaaAAAaaaaAaAAaaaaAaAaaaaAaAAAaaaaAaAAaAaaAaAAaAAaaAAAaAaaAaAaa
aAaaaAaaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaAAaAAaAaAaaAAa
aaAaAAAaaaaaaAaaAAAaaAAaAaAaAAAaAaAaaAAaAAaaAAAaAAaaAAAaaAaaaaAaaaAaAAAaaAAAaAAa
AAaAAAaaaAaAaaaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaaAAAAaAaaaaaaaAaa
AaaAaaAaaAAAaAAaAAaaAAAaAaAaaAAaaAaaAAAaaaAaAAAaaaaaaAaaAaaaaAAaaaaaaAaaaAAAaAAa
AaAaaAAaAAAaAAAaaaaaaAaaaAaaaAAaAaAaAAAaaaAaAAAaaaAaAAAaAAAAaAAaaAAAaAAaaaaaaAaa
aaAAaAAaAaaaaAAaaAaaaAAaAaAaaAAaaaAAaAAaAaAaaAAaaaAaaAAaaaaaaAaaAaaaaAAaAAaaAAAa
aaaaaAaaAaaaaaAaAaaAaaAaaaaaaAaaaAaaaAAaAaAaaAAaaAAaaAAaAAAAaAAaaAaaAAAaAaAaaAAa
aaaaaAaaaaAaAAAaaaaAaAAaAaAaaAAaaaaaaAaaaAAaaAAaAaaAaAAaaAAAaAAaAaaAaAAaAAaaAAAa
aaaAaAAaaaaaaAaaaAaaaAAaAaAaAAAaaaAaAAAaaaAaAAAaAAAAaAAaaAAAaAAaaAaAaaaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaAAaaAAaAaaAaAAaaAAAaAAaAaaAaAAaAAaaAAAaaaaAaAAaaAaaaaAa
aaAaAAAaaAAAaAAaaAAAaAaaaaaaAAAaAaaaaAAaaAaaAAAaAaAaaAAaaAAAaAAaaaAaAAAaAaAaaaAa
aaAAaAAaAaAaaAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaAaaAaAAaaAAAaAAaAAaaAAAa
AaAaaAAaaAaaAAAaaaAaAAAaaAaaaaAaAaAaaAAaaAAaaAAaAAAAaAAaaAaaAAAaAaAaaAAaaaaAaAaa
aaaAaAaaAAAAAaAaaaaaaAaaAaAAAAaaaAAAAAaaaaaaaAaaaaaAaAaaAAAAAaAaaAAAaAaaAaaAaAAa
aAAAaAAaaAAAaAAaAaAaaAAaaAaaAAAaaaaAaaAaaaAaAaAaAaAAaaAaaaAAaaAaaaaaaAaaAaAAAAaa
aaaaaAaaaAaaaAaaaaAAAAaaAaaAaAAaaAAAAAaaAaaaaaAaAaaAaaAaaaAAAAaaAAAAaAaaAaaAaAAa
aAAAAAaaaAaaaAaaaaAAaAaaaaaaaAaaAAAaaAAaAaAaAAAaAaAaaAAaAAaaAAAaAAaaAAAaaAaaaaAa
aaAaAAAaaAAAaAAaaaaaaAaaAaAAAAaaaaaaaAaaAAAAAaAaAaaAaAaaAaaAaAaaaaaAaAaaaaAaaAAa
AAAAaAAaAAaaaAAaAaAaAAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaAAaaaAAaaAaaAAAa
AaAaaAAaAaaaaAAaaaAaAAAaAaAaaAAaAaAaaaAaaaAAaAAaAaAaaAAaAaAAaAAaAaAaaAAaaAAAaAAa
aaAaAAAaaaaAaAaaaAaaaAaaaAaaaAAaAaAaAAAaaaAaAAAaaaAaAAAaAAAAaAAaaAAAaAAaaAaaaAaa
AaaAaAaaAaaAaAaaaaAAaAaaaaaaaAaaaAAaaAAaAaaAaAAaaAAAaAAaAaaAaAAaAAaaAAAaaaaAaAAa
aAaaaaAaaaAaAAAaaAAAaAAaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aAAaaAAaAaaAaAAaaAAAaAAaAaaAaAAaAAaaAAAaaaaAaAAaaAaaaaAaaaAaAAAaaAAAaAAaaAAAaAaa
aaaaAAAaAaaaaAAaaAaaAAAaAaAaaAAaaAAAaAAaaaAaAAAaAaAaaaAaaaAAaAAaAaAaaAAaAaAAaAAa
AaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaAaaAaAAaaAAAaAAaAAaaAAAaAaAaaAAaaAaaAAAaaaAaAAAa
aAaaaaAaAaAaaAAaaAAaaAAaAAAAaAAaaAaaAAAaAaAaaAAaaaaAaAaaaaAaaAAaAAAAaAAaAAaaaAAa
AaAaAAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaAAaaaAAaaAaaAAAaAaAaaAAaAaaaaAAa
aaAaAAAaAaAaaAAaaaAaAaAaAaAaaAAaaaaAAAAaaaAaAAAaaAAAaaAaAAAAaAAaaaAaaAAaAaAaaAAa
aaaAaAaaaAaaaAaaaaaaaAaaaAaaaAaaAaaAaAaaaaAAaAaaaaaaaAaaaAAaaAAaAaaAaAAaaAAAaAAa
AaaAaAAaAAaaAAAaaaaAaAAaaAaaaaAaaaAaAAAaaAAAaAAaAaaAaAaaAAaAAAaaaAaAaaaaaAaAaaaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaaAAAAaAaaaaaaaAaaAaAaaaAaaAAaAAAaAaAaaAAa
aAAAaAAaaaAaAAAaaaaaaAaaaaaAaAAaAaaaaAAaaAAAaAAaaaAaaAAaaaAAaAAaAaAaaAAaaAaaAAAa
aaaaaAaaaAAaaAAaAAAAaAAaaAaaAAAaaaaaaAaaaaAaAAAaaaaAaAAaAaAaaAAaaaaaaAaaAaaaaaAa
AaaAaaAaaaaaaAaaaAaaaAAaAaAaAAAaaaAaAAAaaaAaAAAaAAAAaAAaaAAAaAAaaaaaaAaaAAaaaAAa
aaAAaAAaAaaAaAAaAAaaaAAaAAaAaAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAaaAAa
AaAaAAAaAaAaaAAaAAaaAAAaAAaaAAAaaAaaaaAaaaAaAAAaaAAAaAAaaAAAaAaaAAAAaAAaaAAAaAAa
AAaaaAAaaaAAaAAaAaaAaAAaAAaaaAAaAAaAaAAaaaaaaAaaAaAAAAaaaaaaaAaaAaaaaAAaAAaaAAAa
AaaAAAAaaAAAaAAaAAaaaAAaaaaaaAaaaAAaaAAaAaAaAAAaaAAAaAAaAAaaaAAaaaAaAAAaAaaAaAAa
AAAAaAAaaAAAaAAaaaaAaAaaAaaAaAaaaaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaaAAAAaAaaaaaaaAaaAAaaaaAaaAaaAAAa
AaAaaAAaAaaaaAAaaaAaAAAaAaAaaAAaaaaaaAaaAaAaaAAaaaAAaAAaAaAaaAAaAaAAaAAaAaAaaAAa
aAAAaAAaaaAaAAAaAAaaAAAaaaaaaAaaaAAaaAAaAAAAaAAaaAaaAAAaaaaaaAaaaaAaaAAaAaaAaAAa
AAaaAAAaaaaaAAAaaaAAaAAaAaaaaAAaAaaAAAAaAaaAaAAaaAAAaAAaAAAaaAAaaaaaaAaaAAAAaAAa
AaAaAAAaaaAaAAAaaaaaAAAaAaAaAAAaaaAaAAAaaaaaaAaaAaaaaAAaaAAAaAAaaaAaaAAaaaaaaAaa
AAAAaAAaaAAaAAAaAaAaaAAaaAaaAAAaaaAAaAAaAaaaaAAaAaaAAAAaaAaAaaaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaAAaAAaAaAaaAAaaaAaAAAaaaaaaAaa
AAAAaAAaAaAaAAAaaaAaAAAaaaaaAAAaAaAaAAAaaaAaAAAaaaAaaaAaAaaAaAAaaAAaAAAaaaaaaAaa
AaAAAAaaaaaaaAaaaaAaaAAaAAAAaAAaAAaaaAAaAaAaAAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAa
aAAAaAaaAAaaaAAaaAaaAAAaAaAaaAAaAaaaaAAaaaAaAAAaAaAaaAAaAaAaaaAaaaAAaAAaAaAaaAAa
AaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaaaAaAaaaAaaaAaaaaAaaAAaAaaAaAAaaAAaAAAaaAaaaAaa
AaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaAAAAaAAaAaAaAAAaaaAaAAAaaaaaAAAaAaAaAAAaaaAaAAAaaaAaaaAaAaaAaAAaaAAaAAAa
aAAAaAaaAAaaAAAaaaAaAAAaAaaAAAAaaaAAaAAaAaAaaAAaaaaaaAaaAaAAAAaaaaaaaAaaaAaaaAaa
aAaaaAAaAaaaaAAaAAaaaAAaAAaAaAAaAAAaaAAaaAaaAAAaAAAAaAAaAaAaAAAaaAAAaAAaaaAaaAAa
AaAAaAaaAAaaaAAaAAAAaAAaaaAAaAAaAAAAaAAaaAaaAAAaaAaAAAaaAAaaaAaaaAAaaAAaaAAaaAAa
aAAaaAAaAAaAAAaaAAaaaAAaAAAAaAAaaaAAaAAaAAAAaAAaaAaaAAAaaAaAAAaaAAaaaAaaaaaaAAaa
aaaaAAaaaaaaAAaaAAaAAAaaaaaaAAAaAaaaaAAaaaAaaAAaaaAaaAAaAaaAaAAaaAAAaAAaAAAaaAAa
aAaAAAaaAaaaAAaaAaAaaAAaAaAAaAAaAAaAAAaaaAaaaAAaAAAAaAAaaAaaAAAaaaAaaAAaAaAaaAAa
aAaaAAAaAaAAaAaaaAaaAAAaAaaaaAAaaaAaaAAaAaaAaAAaAaAaAAAaAAaaAAAaaAaAAAaaaaaaAAaa
aAAAaAaaAAAaAAaaAaAaaAAaAaAAaAAaAAaAAAaaaAaaaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaAAaAAaAaAaaAAaaaAaAAAaaaaaaAaa
AAAAaAAaaAAaAAAaAaAaaAAaaAaaAAAaaaAAaAAaAaaaaAAaAaaAAAAaaaAaaaAaAaaAaAAaaAAaAAAa
aaaaaAaaAaAAAAaaaaaaaAaaaaAaaAAaAAAAaAAaAAaaaAAaAaAaAAAaAaAAaAAaAaAaaAAaaAAAaAAa
aaAaAAAaaAAAaAaaAAaaaAAaaAaaAAAaAaAaaAAaAaaaaAAaaaAaAAAaAaAaaAAaAaAaaaAaaaAAaAAa
AaAaaAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaaaAaAaaaAaaaAaaaaAaaAAaAaaAaAAaaAAaAAAa
aAaaaAaaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaAAAAaAAaaAAaAAAaAaAaaAAaaAaaAAAaaaAAaAAaAaaaaAAaAaaAAAAaaaAaaaAa
AaaAaAAaaAAaAAAaaAAAaAaaAAaaAAAaaaAaAAAaAaaAAAAaaaAAaAAaAaAaaAAaaaaaaAaaAaAAAAaa
aaaaaAaaaAaaaAaaaAaaaAAaAaaaaAAaAAaaaAAaAAaAaAAaAAAaaAAaaAaaAAAaAAAAaAAaAaAaAAAa
aAAAaAAaaaAaaAAaAaAAaAaaAAaaaAAaAAAAaAAaaaAAaAAaAAAAaAAaaAaaAAAaaAaAAAaaAAaaaAaa
aaaaAAaaaaaaAAaaaaaaAAaaaAaaaAAaAAaAAAaaaaaaAAAaAAAAaAAaAAaaAAAaAaaAaAAaaaAaAAAa
AaaAaAAaAAAAaAAaaAAAaAAaaAaAAAaaaAAaaAAaAaaAaAAaaaaAAAAaAaAaaAAaaaAaaAAaAAaAAAaa
AaaAaAAaaAAAaAAaAAaaAAAaAaAaaAAaaaAaAAAaaAaAAAaaaaaaAAaaAAaAAAaaaaAaaAAaAaaAaAAa
AAaaAAAaaaaaAAAaaaAAaAAaAaaaaAAaAaaAAAAaaAaAAAaaaAAaaAAaaaAAaAAaAaAaaAAaaaaAAAAa
AAaAAAaaAaaaaAAaaaAAaAAaAaaAaAAaAAAaaAAaaAAAaAAaAaAAaAaaAaaAaAAaaaAaAAAaAaAaaAAa
AaAAaAAaAAaaAAAaaAaAAAaaAAaaaAAaAaAaaAAaaAAAaAAaaaAaAAAaAaAaaAAaaAaaAAAaAAaAAAaa
aAaAaAAaAaAaAAAaAAaaAAAaaaAaAAAaAaaAaAAaaAAaaAAaAaaAAAAaAaAAaAaaAAaaaAAaAAAAaAAa
aAAAaAAaaaAaAAAaAaAaaAAaaAAAaAAaaaAaAAAaaAaAAAaaAAaaaAAaAaAaaAAaaAAAaAAaaaAaAAAa
AaAaaAAaaAaaAAAaAAaAAAaaaAaaaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAAaaAAaAAAaAaAaaAAaaAaaAAAaaaAAaAAaAaaaaAAa
AaaAAAAaaaAaaaAaAaaAaAAaaAAaAAAaaAAAaAaaAaaaaAAaaaaaAAAaaaaaAAAaAaAaaAAaaAAAaAAa
aaAaaAAaaaaAaAaaAAAAaAAaAaAaAAAaaaAaAAAaaaaaAAAaAaAaAAAaaaAaAAAaaaAaaaAaAaaAaAAa
aAAaAAAaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaAaaAAaAAAAaAAaAAaaaAAaAaAaAAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAa
aAAAaAaaaAaaaAAaAAAAaAAaaaAaaAAaAaaAAAAaaAAAaAaaaaaaAAAaAaaaaAAaaAaaAAAaAaAaaAAa
aAAAaAAaaaAaAAAaAaAaaaAaaaAAaAAaAaAaaAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaa
AaaaaAAaaaaaAAAaaaaaAAAaAaAaaAAaaAAAaAAaaaAaaAAaaaaAaAaaAAAAaAAaaAAaAAAaAaAaaAAa
aAaaAAAaaaAAaAAaAaaaaAAaAaaAAAAaaaAaaaAaAaaAaAAaaAAaAAAaAaaAaAaaAAaAAAaaaAaAaaaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAAaAaAaAAAa
aaAaAAAaaaaaAAAaAaAaAAAaaaAaAAAaaaAaaaAaAaaAaAAaaAAaAAAaaAAAaAaaAaaAaAAaaAAAaAAa
aAAAaAAaAaAaaAAaaAaaAAAaaaaAaaAaaaAaAaAaAaAAaaAaaaAAaaAaaaaaaAaaAaAAAAaaaaaaaAaa
aAaaaAaaAAAaaaAaAaAaAAAaAaAaaAAaAAaaAAAaAAaaAAAaAaaAaAAaaAAAaAAaAAAaaAAaaaaaaAaa
AaaAaAAaaAAAaAAaaaaaaAaaaaaaAAAaaAaaAAAaAAAAaAAaAAAaaAAaaAaaAAAaAaAaaAAaAAaaAAAa
AAaaAAAaaAaaaAaaAAaAAAaaaAaAaaaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaaAAAAaAaaaaaaaAaaAAaaaaAaaAaaAAAaAaAaaAAaAaaaaAAa
aaAaAAAaAaAaaAAaaaaaaAaaAaAaaAAaaaAAaAAaAaAaaAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAa
AAaaAAAaaaaaaAaaaAAaaAAaAAAAaAAaaAaaAAAaaaaaaAaaAAaaaAAaaaAAaAAaAAAAaAAaAAaaAAAa
AaAaaAAaaaaaaAaaaAaaaAAaAaAaAAAaaaAaAAAaaaAaAAAaAAAAaAAaaAAAaAAaaaaaaAaaAaaaaAAa
aAAAaAAaaaAaaAAaaaaaaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAaAaAaaAAaaAaAaaaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaAAaAAaAaAaaAAa
aaAaAAAaaaaaaAaaAAaaaAAaaaAAaAAaAAAAaAAaAAaaAAAaAaAaaAAaaAaaaaAaaaAaAAAaaAAAaAAa
aaAaaaAaAaaAaAAaaAAaAAAaaaaaaAaaAaAAAAaaaaaaaAaaaaAaaAAaAAAAaAAaAAaaaAAaAaAaAAAa
AaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaAAaaaAAaaAaaAAAaAaAaaAAaAaaaaAAaaaAaAAAa
AaAaaAAaAaAaaaAaaaAAaAAaAaAaaAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaaaAaAaaaAaaaAaa
aaAaaAAaAaaAaAAaaAAaAAAaaAaaaAaaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaAAaAAaAaAaaAAaaaAaAAAaaaaaaAaaAAaaaAAa
aaAAaAAaAAAAaAAaAAaaAAAaAaAaaAAaaAaaaaAaaaAaAAAaaAAAaAAaaaaaaAaaAaAAAAaaaaaaaAaa
aaAaaAAaAAAAaAAaAAaaaAAaAaAaAAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaAAaaaAAa
aAaaAAAaAaAaaAAaAaaaaAAaaaAaAAAaAaAaaAAaAaAaaaAaaaAAaAAaAaAaaAAaAaAAaAAaAaAaaAAa
aAAAaAAaaaAaAAAaaaaAaAaaaAaaaAaaaAaaaAAaAaAaAAAaaaAaAAAaaaAaAAAaAAAAaAAaaAAAaAAa
aAaaaAaaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaAAaaaAAaaaAAaAAaAAAAaAAaAAaaAAAaAaAaaAAaaAaaaaAaaaAaAAAaaAAAaAAa
aAAAaAaaAaaAaAAaaAAAaAAaaAAAaAAaAaAaaAAaaAaaAAAaaaaAaaAaaaAaAaAaAaAAaaAaaaAAaaAa
aaaaaAaaAaAAAAaaaaaaaAaaaAaaaAaaAAAAaAAaAAaAaAAaaAaaaAaaAAaAAAaaaAaAaaaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAaaaAAaaaAAaAAaAAAAaAAa
AAaaAAAaAaAaaAAaaAaaaaAaaaAaAAAaaAAAaAAaaaAaaaAaAaaAaAAaaAAaAAAaaAAAaAaaAaaaaAAa
aaaaAAAaaaaaAAAaAaAaaAAaaAAAaAAaaaAaaAAaaaaAaAaaAAaaaAAaaaAAaAAaAAAAaAAaAAaaAAAa
AaAaaAAaaAaaaaAaaaAaAAAaaAAAaAAaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAaaaAAaaaAAaAAaAAAAaAAaAAaaAAAaAaAaaAAa
aAaaaaAaaaAaAAAaaAAAaAAaaAAAaAaaAAAAaAAaaAAAaAAaAAaaaAAaaaAAaAAaAaaAaAAaAAaaaAAa
AAaAaAAaaaaaaAaaAaAAAAaaaaaaaAaaAAAAAaAaaaaaaAaaAaAAAAaaaAAAAAaaaaaaaAaaAAAAaAAa
aAAaAAAaAaAaaAAaaAaaAAAaaaAAaAAaAaaaaAAaAaaAAAAaaaAaaaAaAaaAaAAaaAAaAAAaaAAAaAaa
aAaaAAAaAaAaaAAaAaAAaAAaAAAAaAAaaAAaAAAaAaAaaAAaaaaAaAaaAaaAaAaaAAaAAAaaaAaAaaaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaAAaAAaAaAaaAAa
aaAaAAAaaaaaaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAaAaAaaAAaaaaaaAaaAaAAAAaa
aaaaaAaaaaAaaAAaAAAAaAAaAAaaaAAaAaAaAAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaa
AAaaaAAaaAaaAAAaAaAaaAAaAaaaaAAaaaAaAAAaAaAaaAAaAaAaaaAaaaAAaAAaAaAaaAAaAaAAaAAa
AaAaaAAaaAAAaAAaaaAaAAAaaaaAaAaaaAaaaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAa
AaAaaAAaaAaaaAaaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAaAaAaaAAaaAAAaAaa
AAaaAAAaaaAaAAAaAaaAAAAaaaAAaAAaAaAaaAAaaAAAaAaaaaAaaAAaAaaAaAAaAAaaAAAaaaaaAAAa
aaAAaAAaAaaaaAAaAaaAAAAaaaaaaAaaAaAAAAaaaaaaaAaaaAaaaAaaaAAAaAAaAAAAaAAaaAAAaAAa
AaAaaAAaaAaaaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAaAaAaaAAaaAAAaAaaAAaaAAAa
AaAaaAAaaaAaAAAaAaaaaaAaaaAaAAAaaaAaAAAaaAaaAAAaAaaAaAAaaAaaaAAaAaAaAAAaaaAaAAAa
AaAaaAAaaaaAaAaaaAaaaAaaAAaaAAAaaAaaAAAaAAaaaAAaaAaaaAaaaaAAaAaaaaaaaAaaaAaaaAaa
aaaAaAAaaaAaAAAaaaAaAAAaaaaaAAAaAAaaAAAaaAaAAAaaAAAAaAaaAAAAaAaaAaaaaAAaAaaAaAAa
AAaaaAAaAAAaaAAaAaaaaAAaaAAAaAaaAAAaaAAaaAaaAAAaAaAaaAAaAaaaaAAaaaAaAAAaAaAAaAaa
AAaaAAAaAaaAaAAaaaAaAAAaAaAaaAAaaAAAaAaaaAAAaAAaAaAaaAAaaaAaAAAaAAAAaAaaAAAaaAAa
AaAaAAAaAaAaaAAaAAaaAAAaAAaaAAAaAAAaaAAaaaaaAAAaaaAaAAAaAAAAaAaaaAaaaAAaaAaaAAAa
AaaAaAAaaaAaaAAaAAAaaAAaAaAaaAAaaAAAaAaaaaaAaAAaaaAaAAAaAaAAaAAaaaAAaAAaaAaaaAaa
AaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaAAAAaAAaAaAaAAAaaaAaAAAaaaaaAAAaAaAaAAAaaaAaAAAaaaAaaaAaAaaAaAAaaAAaAAAa
aAAAaAaaAaaaaAAaaaaaAAAaaaaaAAAaAaAaaAAaaAAAaAAaaaAaaAAaaaaAaAaaAaaAaAAaaAAaaAAa
aAaaAAAaAaaaaAAaAaAAaAAaAaAaaAAaAaaAaAaaAAaAAAaaaAaAaaaaaAaAaaaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaaAAAAaAaaaaaaaAaaAAAaAaAa
AaaaaAAaAaaAaAAaaaAaAAAaaaaaaAaaaAAaaAAaAAAAaAAaaAaaAAAaaaaaaAaaaaAaAAAaaaaAaAAa
AaAaaAAaaaaaaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAaAaAaaAAaaaaaaAaaaaAaAAAa
AAAAaAAaaaaaaAaaaaAAaAAaAAAAaAAaAaaaaAAaaaAaaAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaaaaAAaAAAaAAAaAaaaaAAaAaaAaAAaaaAaAAAa
aaaaaAaaaaaAaAaaaAAAaAAaAaAaaAAaAAAaAAAaaaaaaAaaaaaaAaAaaAaaAAAaAAAAaAAaAaAAaAAa
AaaAaAAaAAaaAAAaAaAaaAAaaaaAaAaaaaaAaAaaaAaaAAAaAaAaaAAaAAaaAAAaAAAAaAAaaaAAaAAa
aAAaAAAaAaAaaAAaAaaAaAaaaaaaaAaaAaAAAAaaaAAAAAaaaaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAaAaAaaAAaaAAAaAaaAAAAaAAaaAAAaAAa
aaAAaAAaAAAAaAAaAaaaaAAaaaAaaAAaaaaaaAaaAaAAAAaaaaaaaAaaaaaAaAaaAaaAaAaaaaaaaAaa
AaAAAAaaaAAAAAaaaaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaAaaAAAaAaAaaAAaAAaaAAAaAAAAaAAaaaAAaAAaaAAaAAAaAaAaaAAaaaaAaAaaAaaAaAaa
AAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaAAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaAAAAAaAaaAaAaaAaaAaAaaAAaAAAaaaAaAaaaaaAaAaaaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaAaAAAaaAaaAAAa
AaaAAAAaaaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaaAAAAaAaaaaaaaAaaAAaaAaAa
AaAaaAAaaAAAaAAaaaAaaAAaaaaaaAaaAaaaaAAaaaaaaAaaAaAAaAAaAaAaaAAaAAaaAAAaAAaaAAAa
AaaaaAAaAAAaaAAaAaAaaAAaaaaaaAaaaaAaAAAaAAAAaAAaaaaaaAaaaaAaAAAaaaaAaAAaAaAaaAAa
aaaaaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAaAaAaaAAaaaaaaAaaAAAaAAAaAaaAaAAa
aaAaAAAaaaaAaAAaaaaaaAaaaAAAaAAaAaAaaAAaAAaaaAAaAaAaaAAaAAaaAAAaAAaaAAAaAaaaaAAa
aAaaAAAaAaaAAAAaaaaaaAaaaaAaaAAaAaaaaAAaaaAaAAAaAaaaaAAaaAaAaaaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaAAaAAaAaAaaAAaaaAaAAAaaaaaaAaaAaAAaAAaAaAaaAAaAAaaAAAaAAaaAAAaAaaaaAAaAAAaaAAa
AaAaaAAaAAaaaaAaaaaAaAAaAaaaaAAaaAAAaAAaaAAAaAAaAaAaaAAaaaAAaAAaaaaaaAaaAaAAAAaa
aaaaaAaaaAAAaAAaAaAaaAAaAAAaAAAaaaaaaAaaAaAAaaAaAaAaaAAaAAaaAAAaAAaaAAAaAaaaaAAa
AAAaaAAaAaAaaAAaAAaaaaAaaaaAaAAaAaaaaAAaaAAAaAAaaAAAaAAaAaAaaAAaaaAAaAAaaaaAaAaa
AaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAa
AaAaaAAaaAAAaAaaAAaaaAAaAAAAaAAaaAAAaAAaaaAaAAAaAaAaaAAaaAAAaAAaaaAaAAAaAAAaAaAa
AaaAaAAaaAAAaAAaaaAaaAAaAAAAaAAaAAAaAAAaaAAAaAaaaaaaAAAaAAAAaAAaAAaaAAAaaaAaAAAa
AaAAaaAaAaAaaAAaAAaaAAAaAAaaAAAaAaaaaAAaAAAaaAAaAaAaaAAaaaaAaAaaAAaAAAAaaaAaAAAa
AaaAAAAaaaaaAAAaAaAaaAAaaAaAAAaaaaaaaAaaaAaaaAaaAaaaaAAaAaaAaAAaAaAAaAaaaAaaAAAa
AaAaaAAaAaaaAAAaAaAaAAAaAaAaaAAaAAaaAAAaaaAaAAAaaAaaaAaaaaAAaAaaaaaaaAaaAaAAaAAa
AAaaAAAaAAAaaAAaaAaAAAaaaaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaAAAAaAAaaAaaAAAaAaaAaAAaAAAaaAAaAaaAaAAaaAAAaAAaaAaAAAaaaaaaaAaa
aaAaaAAaAAAAaAAaAAaaaAAaAaAaAAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaaaAAaAAa
AAAAaAAaAAaaaAAaAaaaaAAaaaAaAAAaAaaAaAAaAAAAaAAaaAAAaAAaaAAAaAaaAAAAaAAaaAaaAAAa
AaaAaAAaAAAaaAAaAaaAaAAaaAAAaAAaaaAAaAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaAaaAAAaAAAAaAAaAaAaAAAaaAAAaAAaaaAaaAAaaAaAAAaaaaaaaAaaaaAaaAAa
AAAAaAAaAAaaaAAaAaAaAAAaAaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaaaAAaAAaAAAAaAAa
AAaaaAAaAaaaaAAaaaAaAAAaAaaAaAAaAAAAaAAaaAAAaAAaaAAAaAaaaaaaAAAaAaaaaAAaaaAaAAAa
aaaAaAAaaAAAaAAaAaaaaAAaAaAAaAAaAaAaaAAaaAAAaAaaAaAAaAAaAaaaaAAaaaAaAAAaAAaaaAAa
aaaAaAAaaaaAaAaaAAAAaAaaaaaAaAaaAAaAAaAaaaaaAAaaAaAAaAaaAaaAAAaaAaAAAaAaAAaAaAaa
AaaAaAaaAAAAaAaaAaaAaAaaAAaAAaAaaaaaAAaaAaAAAaAaaaaaaAaaAaAAaAaaaaaaaAaaaaaaAAaa
aaAAaAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAaaAAaAaAaAAAa
AaAaaAAaAAaaAAAaAAaaAAAaAaAaaAAaAAaaAAAaaAaAAAaaaaaaaAaaAAaAAaAaaAAAaAaaaAAAaAaa
aAAAaAaaaaaaAAAaaaAAaAAaAaaaaAAaAaaAAAAaAaAaaAAaaAaaAAAaAAaaAAAaaAAAaAaaAAaaaAAa
aaaAaAAaAaaAaAAaaaAAaAAaaaAaaAAaaAaaAAAaAaAaaAAaaAAAaAAaAaAAAaAaaAAAaAaaAaAAaAAa
AaaaaAAaaaaaAAAaaaaAaAaaAaAaaAAaaaaaaAaaAaAAAAaaaAAAAAaaaaaaaAaaaaaAaAaaAAaAAAAa
aAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaAaaAaAAaaaAaaAAaaAaAAAaaaaaaaAaaAaAaaAAaaAAAaAaaAAAaaAAaAaAaaAAaaaAaAAAa
AaaaaaAaaaAaAAAaaaAaAAAaaAaaAAAaAaaAaAAaaAaaaAAaAaAaAAAaaaAaAAAaAaAaaAAaaaaAaAaa
AAAaaAaaaaAaaAAaAaaaaAAaaaAaAAAaAaaaaAAaAaAAaAaaAaaAaAAaaaAaaAAaAAAaaAaaAaaAaAaa
aaAAaAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaAAaAAaAaaaaAAaaAaaaAAaAaAaaAAaaaAAaAAaaAaAAAaaaaaaaAaaAaAaaAAa
aAAAaAaaAAAaaAAaAaAaaAAaaaAaAAAaAaaaaaAaaaAaAAAaaaAaAAAaaAaaAAAaAaaAaAAaaAaaaAAa
AaAaAAAaaaAaAAAaAaAaaAAaaaaAaAaaAAAaaAaaaaAaaAAaAaaaaAAaaaAaAAAaAaaaaAAaAaAAaAaa
AaaAaAAaaaAaaAAaAAAaaAaaAaaAaAaaaaaaaAaaAaAAAAaaAaAAAAaaaaaaaAaaAAAaaAaaAaAAaAAa
AaAaaAAaAAAaaAaaaaaaaAaaAAAAAAaaaaaaaAaaAaAaaAAaaAAAaAaaAaaAaAAaaAAAaAAaaAAAaAAa
AaAaaAAaaAaaAAAaaaAaAaAaAaAaaAAaaaaAAAAaaaAaAAAaaAAAaAaaAaAAaAAaAaaaaAAaaaAaAAAa
AAaaaAAaaaaAaAAaaaaAaAaaAAAAaAaaaAAAAaAaaaaAaAaaaAAAaAaaaAaAaAaaAaaAaAaaaaaaaAaa
aaAAAaAaaaaAaAaaAaaAAAAaAAAAaAAaAaAaAAAaAaaaaAaaaaAAAaAaAaaAaAaaaaAaaAaaAAAAaAaa
AaaAaAaaAAaAAaAaAaaaAAaaAaAAAaAaaaaaaAaaaAaAAAaaaaaaaAaaAaAaaAAaaAAAaAaaAaaaAAAa
AaAaAAAaAaAaaAAaaAaaAAAaAaaAAAAaAAaaAaAaAaAaaAAaaaAAaAAaAaAaaAAaAAaaaAAaaaAaAAAa
AAAAaAAaaAaaAAAaaaaAaAaaaAaaaAaaAaaaaAAaaAaaaAaaAaaAaAaaaAAAaAaaAaaAaAAaaAAAaAAa
aAAAaAAaAaAaaAAaaAaaAAAaaaAaAaAaAaAaaAAaaaaAAAAaaaAaAAAaaaAAaAaaaAaAaaaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaAAaAAa
AAAAaAAaAAaaaAAaAAaAaAAaAaAaaAAaaaAaaAAaaAaAAAaaaaaaaAaaAaAaaAAaaAAAaAaaAAaaaAAa
aaAAaAAaAaaaaAAaAAaaAAAaAAaaAAAaaaAAaaAaAaaAaAAaAAaaAAAaaaAaAAAaaAAAaAaaAAaaaAAa
AAAAaAAaaAAAaAAaaaAaAAAaAaaaaAAaAaaAaAAaaAAAaAAaAAaaAAAaaaaAaAaaaAaaaAaaaaAAaAAa
AAAAaAAaAAaaaAAaAAaAaAAaAaAaaAAaaaAaaAAaaAaaaAaaAaaAaAaaaAaAaaaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaAAAAAaAaaAaAaaAaaAaAaaaaAAaAaaaAaAaaaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaaaaAAaaAAAaAAaAaaaaAAaaaAAaAAaAaaAAAAa
aaAaAAAaAaaAaAAaAAaaaAAaAAaaAAAaaAaAAAaaaaaaaAaaaaAaaAAaAAAAaAAaAAaaaAAaAaAaAAAa
AaAAaAAaAaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaaAaaaAAaAAAAaAAaaaAaaAAaAaaAAAAaaAAAaAaa
aaaaAAAaAaaaaAAaaAaaAAAaAaAaaAAaaAAAaAAaaaAaAAAaAaAaaaAaaaAAaAAaAaAaaAAaAaAAaAAa
AaAaaAAaaAAAaAAaaaAaAAAaaAAAaAaaAaaAaAAaaAAAaAAaaAAAaAAaAaAaaAAaaAaaAAAaaaaAaaAa
aaAaAaAaAaAAaaAaaaAAaaAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaAAAAAaAaAAAAAaaaAAaAaaaaaaaAaa
aAaaaAaaaAaAaAaaaAaaaAaaaaAAaAaaaaaaaAaaAAaAAaAaAaAAaAAaAaAaaAAaAAaaAAAaAAaaAAAa
AaaaaAAaAAAaaAAaAaAaaAAaAAaaaaAaaaaAaAAaAaaaaAAaaAAAaAAaaAAAaAAaAaAaaAAaaaAAaAAa
aAAAaAaaaaaaAAAaAAAAaAAaaAaaAAAaaaAaAAAaaAaaAAaaAaAAAaAaAaaAaAaaAAaAAAaaaAaAaaaa
aAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaaAAAAaAaaaaaaaAaaaaaAaaAaAaaaaAAaaAAAaAAaaaAaaAAa
aaAAaAAaAaAaaAAaaaaaaAaaaaAaAAAaaaaAaAAaAaAaaAAaaaaaaAaaaAaaAAAaAaAaaAAaAAaaAAAa
aaaaAAAaAAAAaAAaaAAAaAAaAAaaAAAaAaAaaAAaaaaaaAaaaAAaaAAaaAaaAAAaAAAAaAAaAaAAaAAa
aaaaaAaaaaAaAAAaaaaAaAAaAaAaaAAaaaaaaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAa
AaAaaAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaAAaAAaAaAaaAAaaaAaAAAaaaaaaAaaAaAAaAAaAAaaAAAa
AAAaaAAaaaaaaAaaAaAAAAaaaaaaaAaaAaaaaAAaAAAaAAAaAaaaaAAaAaaAaAAaaaAaAAAaaaaaaAaa
aaaAaAaaaAAAaAAaAaAaaAAaAAAaAAAaaaaaaAaaaaaaAaAaaAaaAAAaAAAAaAAaAaAAaAAaAaaAaAAa
AAaaAAAaAaAaaAAaaaaAaAaaaaaAaAaaaAaaAAAaAaAaaAAaAAaaAAAaAAAAaAAaaaAAaAAaaAAaAAAa
AaAaaAAaaaAAaAaaaaaaaAaaaAaaAAAaAaAaaAAaaAaAaAAaAaAaaAAaAAaaaAAaaaAaAAAaAaaAaAaa
aaaaaAaaAaAAAAaaaAAAAAaaaaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaAaAAaAAaAaAaaAAaAAaaAAAaAAaaAAAaAaaaaAAaAAAaaAAaAaAaaAAaAAaaaaAa
aaaAaAAaAaaaaAAaaAAAaAAaaAAAaAAaAaAaaAAaaaAAaAAaaAAAaAaaaaaaAAAaAAAAaAAaaAaaAAAa
aaAaAAAaAaaaAAaaaAAAaAaaAAAAaAAaaAAAaAAaAaAAaAAaAaAaaAAaAAaaAAAaAAaaAAAaAaaaaAAa
AAAaaAAaAaAaaAAaaaaaaAaaAaAAAAaaaaaaaAaaaaaAaAaaAaAaaAAaAaaAaAaaaaaaaAaaAaAAAAaa
aAAAAAaaaaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaaAaAAaaAAaaAAaaaaaaAaaaaaAaAaaAaAaaAAaaAAAaAaa
aaAaaAAaAaaaaAAaaaAaAAAaAaaaaAAaaAAAaAaaAAaaAAAaaaAaAAAaAaaaaAAaaaAaAAAaAaAaAAAa
AAaaAAAaAaaAaAaaaaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaAaaAAAa
AaAaaAAaAAaaAAAaAAAAaAAaaaAAaAAaaAAaAAAaAaAaaAAaaaaAaAaaAaAaaAAaaAAAaAaaaaAaaAAa
AaaaaAAaaaAaAAAaAaaaaAAaaAAAaAaaAaAAaAAaAAaaAAAaAAAaaAAaAaaAaAaaAAaAAAaaaAaAaaaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
AaAAAAAaaaaaaAaaAaAaaAAaaaAAaAAaAAaaAAAaAaAaaAAaaaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaAaaAAAaAaAaaAAaaAaAaAAaAaAaaAAaAAaaaAAaaaAaAAAaaaaAaAaa
aAaaaAaaAAAAaAAaAAAAaAAaaaaaAAAaAAaaAAAaaAaaaAaaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaAAAAAa
aAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaAAAAAaaAaAaaaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaAaAAAAAaAaaAaAaaAaaAaAaaAAaAAAaaaAaAaaaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaa
AAAAaAaaaaaaaAaaaaaaAaAaaAaaAAAaAAAAaAAaAAaaaAAaAaAaaAAaAAaaAAAaAAaaAAAaaaaaaAaa
aaAaAAAaaaaAaAAaAaAaaAAaaaaaaAaaaAaaAAAaAaAaaAAaAAaaAAAaaaaaAAAaAAAAaAAaaAAAaAAa
AAaaAAAaAaAaaAAaaaaaaAaaAaaaaAAaaAAAaAAaaaAaaAAaaaaaaAaaAaAaAAAaaaaaAAAaaaAaaAAa
AaaaaAAaaaAaAAAaAaAaaAAaaaaaaAaaaaAaAAAaaaaAaAAaAaAaaAAaaaaaaAaaAAAAaAAaAaAaAAAa
aaAaAAAaaaaaAAAaAaAaAAAaaaAaAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAaaAAAaAAAAaAAaaAaaAAAa
aaAaAAAaAaaaaAAaaAaaaAAaaaAAaAAaAaAaaAAaaAAAaAaaAAaaAAAaAAAAaAAaaAaaAAAaaaAaAAAa
aaaAaAaaAaAAaAAaAAaaAAAaAAAaaAAaaaAAaAaaaaaaaAaaaaAaAAAaaAaaAAAaAaAaAAAaAaAaaAAa
AaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAaaAAAaAAAAaAAaaAaaAAAaaaAaAAAaAaaaaAAa
aAaaaAAaaaAAaAAaAaAaaAAaaAAAaAaaAAAAaAAaaaaaAAAaaaAaAAAaAaaAaAAaAAAAaAAaaAAAaAAa
aaaAaAaaaAaaaAaaAAAAaAAaaAAAaAAaAAaaAaAaAAAAaAAaaAaaAAAaaaAaAAAaaAaaaAaaAaaAaAaa
aaaAaAaaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAAaAaAaAAAaaaAaAAAaaaaaAAAa
AaAaAAAaaaAaAAAaaaAaaaAaAaaAaAAaaAAaAAAaaAAAaAaaAaaAaAAaaAAAaAAaaAAAaAAaAaAaaAAa
aAaaAAAaaaaAaaAaaaAaAaAaAaAAaaAaaaAAaaAaaaaaaAaaAaAAAAaaaaaaaAaaaAaaaAaaAAaaAaAa
AaAaAAAaAAaaaAAaAAaaaAAaAaAaaAAaAAaaAAAaAAaaAAAaaAAAaAaaaAaaaAaaAAaAAAaaaAaAaaaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaAAAAaAAaAaAaAAAaaaAaAAAaaaaaAAAaAaAaAAAaaaAaAAAaaaAaaaAaAaaAaAAa
aAAaAAAaaAAAaAaaAaaaaAAaaaaaAAAaaaaaAAAaAaAaaAAaaAAAaAAaaaAaaAAaaaaAaAaaAAaaaAAa
aaAAaAAaAAAAaAAaAAaaAAAaAaAaaAAaaAaaaaAaaaAaAAAaaAAAaAAaaaAaaaAaAaaAaAAaaAAaAAAa
AaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAAaAaAaAAAaaaAaAAAaaaaaAAAaAaAaAAAa
aaAaAAAaaaAaaaAaAaaAaAAaaAAaAAAaaAAAaAaaAaaaaAAaaaaaAAAaaaaaAAAaAaAaaAAaaAAAaAAa
aaAaaAAaaaaAaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAaAaAaaAAaAaaAaAaaAAaAAAaa
aAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaAAAAAa
aaaaaAaaAAaaaAAaAaaaaAAaaaAaAAAaAAaaaAAaaaaAaAAaaaaaaAaaaaaAaAaaAaAaaAAaAaaAaAaa
aaaaaAaaAAaAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAaaAAAAaAaaaaaaaAaaaaaAaaAaAaaaaAAa
aAAAaAAaaaAaaAAaaaAAaAAaAaAaaAAaaaaaaAaaAaAaaAAaaAaaAAAaaAaaAAAaAAAAaAAaaAaaAAAa
AAaaAAAaaaaaaAaaAaaaaAAaaAAAaAAaaaAaaAAaaaaaaAaaAaAaAAAaaaaaAAAaaaAaaAAaAaaaaAAa
aaAaAAAaAaAaaAAaaaaaaAaaaaAaAAAaaaaAaAAaAaAaaAAaaaaaaAaaAAAAaAAaAaAaAAAaaaAaAAAa
aaaaAAAaAaAaAAAaaaAaAAAaaaaaaAaaAaaaaAAaAAaaaAAaAAaaaAAaAAAAaAAaaAaaAAAaaaAaaAAa
AaaAaAAaaAAAaAAaAAAaaAAaaaAAaAAaAaaAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAAaAaAaAAAa
aaAaAAAaaaaaAAAaAaAaAAAaaaAaAAAaaaAaaaAaAaaAaAAaaAAaAAAaaAAAaAaaAaaAaAAaaAAAaAAa
aAAAaAAaAaAaaAAaaAaaAAAaaaaAaaAaaaAaAaAaAaAAaaAaaaAAaaAaaaaaaAaaAaAAAAaaaaaaaAaa
aAaaaAaaaAAaaaAaAaaaaAAaAaaAaAAaaaAAaAAaAaAaaAAaaaAaaAAaaAAAaAaaaAaaaAaaAAaAAAaa
aAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaAAAAaAAaAaAaAAAaaaAaAAAaaaaaAAAaAaAaAAAaaaAaAAAaaaAaaaAa
AaaAaAAaaAAaAAAaaAAAaAaaAaaaaAAaaaaaAAAaaaaaAAAaAaAaaAAaaAAAaAAaaaAaaAAaaaaAaAaa
AAaaaAAaaaAAaAAaAAAAaAAaAAaaAAAaAaAaaAAaaAaaaaAaaaAaAAAaaAAAaAAaaaAaaaAaAaaAaAAa
aAAaAAAaAaaAaAaaAAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
aaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAAAAaAAaAaAaAAAaaaAaAAAaaaaaAAAa
AaAaAAAaaaAaAAAaaaAaaaAaAaaAaAAaaAAaAAAaaAAAaAaaAaaaaAAaaaaaAAAaaaaaAAAaAaAaaAAa
aAAAaAAaaaAaaAAaaaaAaAaaAaaAaAAaaAAaaAAaaAaaAAAaAaaaaAAaAaAAaAAaAaAaaAAaAaaAaAaa
AAaAAAaaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaa
AaAAAAAaaAaAaaaaaaaaaAaaaaaaaAaaaaaaaAaaaaaaaAaaAaAAAAAaaAaAaaaaAaAAAAAaAaaAaAaa
aaaAaAaaAaaAaAaaAAaAAAaaaAaAaaaaaAaAaaaaaAaAaaaaaAaAaaaaaAaAaaaaaAaAaaaaaAaAaaaa
  await await await await await await await await await await await call()}})()

round #56

submitted at
0 likes

guesses
comments 0

post a comment


amogus ELF 64-bit LSB shared object, x86-64, version 1 (SYSV)
amogus.h ASCII text
1
2
typedef void(entry_callback)(char *match, int size, void *data);
int entry(const char *regex, entry_callback *callback, void *data);
amogus.png PNG image data, 720 x 720, 8-bit colormap, non-interlaced

round #55

submitted at
1 like

guesses
comments 0

post a comment


entry.fs ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
( // Code by olus2000 (UID: 339009650592710656)

FALSE VALUE ENABLE-BUG

BEGIN-STRUCTURE grid
  FIELD: grid.addr
  FIELD: grid.width
  FIELD: grid.height
END-STRUCTURE

BEGIN-STRUCTURE grid-cell
  CFIELD: grid-cell.type
  CFIELD: grid-cell.wseen
  CFIELD: grid-cell.rseen
  CFIELD: grid-cell.invert
END-STRUCTURE

0 CONSTANT GRID-0
1 CONSTANT GRID-/
2 CONSTANT GRID-\
3 CONSTANT GRID-+

CREATE NULL-GRID-CELL grid-cell ALLOT
GRID-0 NULL-GRID-CELL grid-cell.type C!
FALSE NULL-GRID-CELL grid-cell.wseen C!
FALSE NULL-GRID-CELL grid-cell.rseen C!

: grid[] ( n n grid -- grid-cell )
  >R 2DUP 2DUP
  0< 0= SWAP 0< 0= AND SWAP
  R@ grid.height @ < AND SWAP
  R@ grid.width @ < AND 0= R> SWAP
  IF DROP 2DROP NULL-GRID-CELL EXIT THEN
  >R R@ grid.width @ * + grid-cell *
  R> grid.addr @ + ;

10 CONSTANT CHAR-LF

0 VALUE PARSED-GRID
0 VALUE PARSED-STR-ADDR
0 VALUE PARSED-STR-LEN
0 VALUE PARSED-WIDTH
0 VALUE PARSED-HEIGHT
0 VALUE PARSED-MINX
0 VALUE PARSED-MINY

: PARSED-GRID-CELL-TYPE! ( char -- )
  PARSED-WIDTH PARSED-MINX -
  PARSED-HEIGHT PARSED-MINY -
  PARSED-GRID grid[] DUP
  NULL-GRID-CELL = IF 1 ABORT" BONDAGE" THEN
  grid-cell.type C! ;

: ENSURE-UNCHARA ( char -- char )
  DUP CASE
    CHAR-LF OF ENDOF [CHAR] / OF ENDOF
    [CHAR] \ OF ENDOF [CHAR] + OF ENDOF
    BL OF ENDOF 1 ABORT" CHARA"
  ENDCASE ;

: PARSE-GRID ( c-addr u grid -- )
  TO PARSED-GRID TO PARSED-STR-LEN TO PARSED-STR-ADDR
  0 PARSED-GRID grid.height !
  0 PARSED-GRID grid.width !
  0 TO PARSED-WIDTH
  0 TO PARSED-HEIGHT
  PARSED-STR-LEN 0 ?DO
    PARSED-STR-ADDR I CHARS + C@ ENSURE-UNCHARA CASE
      CHAR-LF OF 0 TO PARSED-WIDTH PARSED-HEIGHT 1+ TO PARSED-HEIGHT ENDOF
      BL OF PARSED-WIDTH 1+ TO PARSED-WIDTH ENDOF
      PARSED-WIDTH 1+ DUP TO PARSED-WIDTH
      PARSED-GRID grid.width @ MAX PARSED-GRID grid.width !
      PARSED-HEIGHT 1+ PARSED-GRID grid.height @ MAX PARSED-GRID grid.height !
    ENDCASE
  LOOP
  PARSED-WIDTH TO PARSED-MINX
  PARSED-HEIGHT TO PARSED-MINY
  PARSED-GRID grid.width @ PARSED-GRID grid.height @ 2DROP
  0 TO PARSED-WIDTH
  0 TO PARSED-HEIGHT
  PARSED-STR-LEN 0 ?DO
    PARSED-STR-ADDR I CHARS + C@ CASE
      CHAR-LF OF 0 TO PARSED-WIDTH PARSED-HEIGHT 1+ TO PARSED-HEIGHT ENDOF
      BL OF PARSED-WIDTH 1+ TO PARSED-WIDTH ENDOF
      PARSED-WIDTH PARSED-HEIGHT PARSED-MINX PARSED-MINY 2DROP 2DROP
      PARSED-WIDTH PARSED-MINX MIN TO PARSED-MINX
      PARSED-HEIGHT PARSED-MINY MIN TO PARSED-MINY
      PARSED-WIDTH 1+ TO PARSED-WIDTH
    ENDCASE
  LOOP
  PARSED-MINX NEGATE PARSED-GRID grid.width +!
  PARSED-MINY NEGATE PARSED-GRID grid.height +!
  0 TO PARSED-WIDTH
  0 TO PARSED-HEIGHT
  ALIGN HERE
  PARSED-GRID grid.height @
  PARSED-GRID grid.width @ * >R
  R@ grid-cell * ALLOT
  PARSED-GRID grid.addr !
  R> 0 ?DO
    PARSED-GRID grid.addr @ I grid-cell * + >R
    GRID-0 R@ grid-cell.type C!
    FALSE R@ grid-cell.wseen C!
    FALSE R@ grid-cell.rseen C!
    2 R> grid-cell.invert C!
  LOOP
  PARSED-STR-LEN 0 ?DO
    PARSED-STR-ADDR I CHARS + C@ ENSURE-UNCHARA CASE
      CHAR-LF OF
        0 TO PARSED-WIDTH PARSED-HEIGHT 1+ TO PARSED-HEIGHT FALSE
      ENDOF
      [CHAR] / OF GRID-/ PARSED-GRID-CELL-TYPE! TRUE ENDOF
      [CHAR] \ OF GRID-\ PARSED-GRID-CELL-TYPE! TRUE ENDOF
      [CHAR] + OF GRID-+ PARSED-GRID-CELL-TYPE! TRUE ENDOF
      TRUE
    ENDCASE IF PARSED-WIDTH 1+ TO PARSED-WIDTH THEN
  LOOP ;

BEGIN-STRUCTURE point
  FIELD: point.x
  FIELD: point.y
END-STRUCTURE

CREATE POINT-ZERO point ALLOT 0 0 POINT-ZERO 2!

BEGIN-STRUCTURE grid-cell-def
  point +FIELD grid-cell-def.begin-white-up
  point +FIELD grid-cell-def.begin-white-down
  point +FIELD grid-cell-def.begin-red-up
  point +FIELD grid-cell-def.begin-red-down
  point +FIELD grid-cell-def[0,1]
  point +FIELD grid-cell-def[1,0]
  point +FIELD grid-cell-def[0,-1]
  point +FIELD grid-cell-def[-1,0]
END-STRUCTURE

BEGIN-STRUCTURE grid-cell-defs-t
  grid-cell-def +FIELD grid-cell-defs./
  grid-cell-def +FIELD grid-cell-defs.\
  grid-cell-def +FIELD grid-cell-defs.+
END-STRUCTURE

CREATE GRID-CELL-DEFS grid-cell-defs-t ALLOT

: DIR-FLAT ( n n -- u )
  1+ 3 * SWAP 1+ + ;

: grid-cell-def[] ( n n grid-cell-def -- point )
  >R DIR-FLAT CASE
    0 0 DIR-FLAT OF 0 ENDOF
    0 1 DIR-FLAT OF 4 ENDOF
    1 0 DIR-FLAT OF 5 ENDOF
    0 -1 DIR-FLAT OF 6 ENDOF
    -1 0 DIR-FLAT OF 7 ENDOF
    1 THROW
  ENDCASE point * R> + ;

: 4DUP 2>R 2>R 2R@ 2R> 2R@ 2SWAP 2R> ;

: DEFINE-CELL-CONNECTION ( n n n n grid-cell-def -- )
  >R 4DUP NEGATE SWAP NEGATE SWAP 2SWAP R@ grid-cell-def[] 2!
  2SWAP NEGATE SWAP NEGATE SWAP 2SWAP R> grid-cell-def[] 2! ;

0 1 1 0 GRID-CELL-DEFS grid-cell-defs./ DEFINE-CELL-CONNECTION
0 -1 -1 0 GRID-CELL-DEFS grid-cell-defs./ DEFINE-CELL-CONNECTION
0 -1 SWAP GRID-CELL-DEFS grid-cell-defs./ grid-cell-def.begin-white-up 2!
-1 0 SWAP GRID-CELL-DEFS grid-cell-defs./ grid-cell-def.begin-white-down 2!
0 1 SWAP GRID-CELL-DEFS grid-cell-defs./ grid-cell-def.begin-red-up 2!
1 0 SWAP GRID-CELL-DEFS grid-cell-defs./ grid-cell-def.begin-red-down 2!

0 1 -1 0 GRID-CELL-DEFS grid-cell-defs.\ DEFINE-CELL-CONNECTION
0 -1 1 0 GRID-CELL-DEFS grid-cell-defs.\ DEFINE-CELL-CONNECTION
0 -1 SWAP GRID-CELL-DEFS grid-cell-defs.\ grid-cell-def.begin-white-up 2!
1 0 SWAP GRID-CELL-DEFS grid-cell-defs.\ grid-cell-def.begin-white-down 2!
0 1 SWAP GRID-CELL-DEFS grid-cell-defs.\ grid-cell-def.begin-red-up 2!
-1 0 SWAP GRID-CELL-DEFS grid-cell-defs.\ grid-cell-def.begin-red-down 2!

0 1 0 -1 GRID-CELL-DEFS grid-cell-defs.+ DEFINE-CELL-CONNECTION
1 0 -1 0 GRID-CELL-DEFS grid-cell-defs.+ DEFINE-CELL-CONNECTION
0 -1 SWAP GRID-CELL-DEFS grid-cell-defs.+ grid-cell-def.begin-white-up 2!
0 1 SWAP GRID-CELL-DEFS grid-cell-defs.+ grid-cell-def.begin-white-down 2!
-1 0 SWAP GRID-CELL-DEFS grid-cell-defs.+ grid-cell-def.begin-red-up 2!
1 0 SWAP GRID-CELL-DEFS grid-cell-defs.+ grid-cell-def.begin-red-down 2!

: GRID-CELL-DEF-BEGINS ( u grid-cell -- point[2] grid-cell-def )
  >R R@ grid-cell.invert C@ 1 = IF 1 SWAP - THEN
  GRID-CELL-DEFS R> grid-cell.type C@ 1- grid-cell-def * + >R
  point 2* * R@ + R> ;

BEGIN-STRUCTURE traxer-state
  point +FIELD traxer-state.pos
  point +FIELD traxer-state.prev-pos
  CFIELD: traxer-state.go?
  CFIELD: traxer-state.first
  CFIELD: traxer-state.colour
  CFIELD: traxer-state.dir
  CFIELD: traxer-state.bump
  ALIGNED
END-STRUCTURE

CREATE TRAXER-STATES traxer-state 4 * ALLOT

0 TRAXER-STATES traxer-state 0 * + traxer-state.colour C!
0 TRAXER-STATES traxer-state 1 * + traxer-state.colour C!
1 TRAXER-STATES traxer-state 2 * + traxer-state.colour C!
1 TRAXER-STATES traxer-state 3 * + traxer-state.colour C!
0 TRAXER-STATES traxer-state 0 * + traxer-state.dir C!
1 TRAXER-STATES traxer-state 1 * + traxer-state.dir C!
0 TRAXER-STATES traxer-state 2 * + traxer-state.dir C!
1 TRAXER-STATES traxer-state 3 * + traxer-state.dir C!

0 VALUE CURRENT-TRAXER
CREATE TRAXER-OLDPOS point ALLOT
0 VALUE CURRENT-GRID-CELL
0 VALUE CURRENT-GRID-CELL-DEF
0 VALUE CURRENT-GRID-CELL-BEGINS
0 VALUE NEXT-GRID-CELL
0 VALUE NEXT-GRID-CELL-DEF
0 VALUE NEXT-GRID-CELL-BEGINS
0 VALUE FOUND-LOOP

: COLOUR-MISMATCH ( n n -- flag )
  ENABLE-BUG IF
    ."    diff "
    2DUP SWAP . . CR
  THEN
  DIR-FLAT 2 0 DO
    DUP NEXT-GRID-CELL-BEGINS I point * +
    DUP point.x @ SWAP point.y @ DIR-FLAT = IF
      DROP FALSE UNLOOP EXIT
    THEN
  LOOP DROP TRUE ;

: FIND-DIRECTION ( -- )
  2 0 DO
    CURRENT-GRID-CELL-BEGINS I
    CURRENT-TRAXER traxer-state.dir C@ 1 = IF 1 SWAP - THEN
    point * + >R
    CURRENT-TRAXER traxer-state.pos point.x @ R@ point.x @ +
    CURRENT-TRAXER traxer-state.pos point.y @ R> point.y @ +
    2DUP TRAXER-OLDPOS point.y @ =
    SWAP TRAXER-OLDPOS point.x @ =
    AND 0= IF
      CURRENT-TRAXER traxer-state.pos point.y !
      CURRENT-TRAXER traxer-state.pos point.x !
      UNLOOP EXIT
    THEN 2DROP
  LOOP ;

: FORWARD-TRAXER ( traxer-state -- flag )
  TO CURRENT-TRAXER
  CURRENT-TRAXER traxer-state.go? C@ 0= IF FALSE EXIT THEN
  ENABLE-BUG IF
    CR ." >> color "
    CURRENT-TRAXER traxer-state.colour C@ . CR
    ."    dir "
    CURRENT-TRAXER traxer-state.dir C@ . CR
    ."    from "
    CURRENT-TRAXER traxer-state.prev-pos DUP point.y @ SWAP point.x @ . . CR
    ."    at "
    CURRENT-TRAXER traxer-state.pos DUP point.y @ SWAP point.x @ . . CR
  THEN
  CURRENT-TRAXER traxer-state.prev-pos
  TRAXER-OLDPOS point MOVE
  CURRENT-TRAXER traxer-state.pos
  CURRENT-TRAXER traxer-state.prev-pos point MOVE
  CURRENT-TRAXER traxer-state.pos DUP point.x @ SWAP point.y @ PARSED-GRID
  grid[] TO CURRENT-GRID-CELL
  ENABLE-BUG IF
    ."    ( type "
    CURRENT-GRID-CELL grid-cell.type C@ .
    ." inv "
    CURRENT-GRID-CELL grid-cell.invert C@ .
    ." )" CR
  THEN
  CURRENT-GRID-CELL grid-cell.type C@ GRID-0 = IF
    ENABLE-BUG IF
      ."    reject null source " CR
    THEN
    FALSE EXIT
  THEN
  CURRENT-GRID-CELL grid-cell.invert C@ 2 = IF
    0 CURRENT-GRID-CELL grid-cell.invert C!
  THEN
  CURRENT-TRAXER traxer-state.colour C@ CURRENT-GRID-CELL GRID-CELL-DEF-BEGINS
  TO CURRENT-GRID-CELL-DEF TO CURRENT-GRID-CELL-BEGINS
  CURRENT-GRID-CELL-DEF CURRENT-GRID-CELL-BEGINS CURRENT-TRAXER DROP 2DROP
  FIND-DIRECTION
  CURRENT-TRAXER traxer-state.pos DUP point.x @ SWAP point.y @ PARSED-GRID
  grid[] TO NEXT-GRID-CELL
  ENABLE-BUG IF
    ."    to "
    CURRENT-TRAXER traxer-state.pos DUP point.y @ SWAP point.x @ . . CR
    ."    ( type "
    NEXT-GRID-CELL grid-cell.type C@ .
    ." inv "
    NEXT-GRID-CELL grid-cell.invert C@ .
    ." )" CR
  THEN
  CURRENT-GRID-CELL grid-cell.wseen
  CURRENT-TRAXER traxer-state.colour C@ CHARS + C@
  IF
    ENABLE-BUG IF
      ."    reject seen source " CR
    THEN
    FALSE EXIT
  THEN
  CURRENT-TRAXER traxer-state.first C@ 0= IF
    TRUE CURRENT-GRID-CELL grid-cell.wseen
    CURRENT-TRAXER traxer-state.colour C@ CHARS + C!
  THEN
  FALSE CURRENT-TRAXER traxer-state.first C!
  NEXT-GRID-CELL NULL-GRID-CELL = IF
    TRUE CURRENT-TRAXER traxer-state.bump C!
  THEN
  NEXT-GRID-CELL grid-cell.type C@ GRID-0 = IF
    ENABLE-BUG IF
      ."    reject null target " CR
    THEN
    FALSE EXIT
  THEN
  CURRENT-TRAXER traxer-state.colour C@ NEXT-GRID-CELL GRID-CELL-DEF-BEGINS
  TO NEXT-GRID-CELL-DEF TO NEXT-GRID-CELL-BEGINS
  NEXT-GRID-CELL grid-cell.wseen
  CURRENT-TRAXER traxer-state.colour C@ CHARS + C@ IF
    ENABLE-BUG IF
      ."    found loop" CR
    THEN
    TRUE TO FOUND-LOOP
  THEN TRUE ;

BEGIN-STRUCTURE vstack
  FIELD: vstack.addr
  FIELD: vstack.len
END-STRUCTURE

0 VALUE VSTACK-ITEM

: VSTACK-PUSH ( addr vstack -- )
  >R R@ vstack.addr @ R@ vstack.len @
  VSTACK-ITEM * + VSTACK-ITEM MOVE
  1 R> vstack.len +! ;

: VSTACK-POP ( addr vstack -- flag )
  DUP vstack.len @ 0> 0= IF 2DROP FALSE EXIT THEN
  >R -1 R@ vstack.len +!
  R@ vstack.addr @ R> vstack.len @
  VSTACK-ITEM * + SWAP VSTACK-ITEM MOVE TRUE ;

CREATE QUEUE vstack ALLOT

: IMPLODE-POS ( u u -- u )
  PARSED-GRID grid.width @ * + ;

: EXPLODE-POS ( u -- u u )
  PARSED-GRID grid.width @ /MOD ;

BEGIN-STRUCTURE queue-elem-t
  FIELD: queue-elem.pos
END-STRUCTURE

CREATE QUEUE-ELEM queue-elem-t ALLOT

: NORM-PUSH ( n n -- FLAG )
  2DUP IMPLODE-POS QUEUE-ELEM !
  PARSED-GRID grid[] >R
  R@ grid-cell.type C@ GRID-0 =
  R@ grid-cell.wseen C@ 0= 0= OR 0= R> SWAP IF
    grid-cell.wseen TRUE SWAP C!
    QUEUE-ELEM QUEUE VSTACK-PUSH
  ELSE DROP THEN ;

: NORMALIZE ( -- )
  PARSED-GRID DUP grid.height @ SWAP grid.width @ * DUP point *
  ALIGN HERE QUEUE vstack.addr ! queue-elem-t * ALLOT
  0 QUEUE vstack.len !
  queue-elem-t TO VSTACK-ITEM
  DUP 0 ?DO
    I PARSED-GRID grid.width @ /MOD 2DUP
    TO PARSED-HEIGHT TO PARSED-WIDTH
    NORM-PUSH
    ENABLE-BUG IF
      CR ." [ flood fill at "
      PARSED-WIDTH . PARSED-HEIGHT .
      ."  ]" CR
    THEN
    BEGIN
      QUEUE-ELEM QUEUE VSTACK-POP
    WHILE
      QUEUE-ELEM @ EXPLODE-POS 2DUP TO PARSED-HEIGHT TO PARSED-WIDTH
      PARSED-GRID grid[] DUP TO CURRENT-GRID-CELL
      CURRENT-GRID-CELL grid-cell.invert C@ 2 = IF
        0 CURRENT-GRID-CELL grid-cell.invert C!
      THEN
      ENABLE-BUG IF
        CR ." >> pos "
        PARSED-WIDTH PARSED-HEIGHT SWAP . . CR
      THEN
      ENABLE-BUG IF
        ."    ( type "
        CURRENT-GRID-CELL grid-cell.type C@ .
        ." inv "
        CURRENT-GRID-CELL grid-cell.invert C@ .
        ." )" CR
      THEN
      DUP grid-cell.type C@ GRID-0 = IF 0 ELSE 2 THEN 0 ?DO
        ENABLE-BUG IF
          ."    color "
          I . CR
        THEN
        DUP I SWAP GRID-CELL-DEF-BEGINS
        TO CURRENT-GRID-CELL-DEF
        TO CURRENT-GRID-CELL-BEGINS
        2 0 DO
          CURRENT-GRID-CELL-BEGINS I point * + DUP point.x @ SWAP point.y @
          ENABLE-BUG IF
            ."    dir "
            2DUP SWAP . . CR
          THEN
          2DUP PARSED-WIDTH PARSED-HEIGHT ROT + ROT ROT + SWAP 2DUP
          ENABLE-BUG IF
            ."    to "
            2DUP SWAP . . CR
          THEN
          NORM-PUSH PARSED-GRID grid[] DUP
          TO NEXT-GRID-CELL DUP grid-cell.type C@
          ENABLE-BUG IF
            ."    to "
            QUEUE-ELEM @ EXPLODE-POS SWAP . . CR
          THEN
          GRID-0 = IF
            ENABLE-BUG IF
              ."    reject null target " CR
            THEN
            DROP 2DROP
          ELSE
            J SWAP GRID-CELL-DEF-BEGINS
            TO NEXT-GRID-CELL-DEF
            TO NEXT-GRID-CELL-BEGINS
            NEGATE SWAP NEGATE SWAP
            COLOUR-MISMATCH IF
              ENABLE-BUG IF
                ."    inverting " CR
              THEN
              NEXT-GRID-CELL grid-cell.invert C@ 2 = 0= IF
                1 ABORT" VERTIGO"
              THEN
              1 NEXT-GRID-CELL grid-cell.invert C!
            ELSE
              NEXT-GRID-CELL grid-cell.invert C@ 2 = IF
                ENABLE-BUG IF
                  ."    default " CR
                THEN
                0 NEXT-GRID-CELL grid-cell.invert C!
              THEN
            THEN
          THEN
        LOOP
      LOOP DROP
    REPEAT
  LOOP DUP 0 ?DO
    I PARSED-GRID grid.width @ /MOD
    PARSED-GRID grid[]
    grid-cell.wseen FALSE SWAP C!
  LOOP DROP ;

: ANALYZE-GRID ( -- flag )
  PARSED-GRID grid.width @ PARSED-GRID grid.height @ * 0 ?DO
    I PARSED-GRID grid.height @ /MOD
    TO PARSED-HEIGHT TO PARSED-WIDTH
    ENABLE-BUG IF
      CR CR ." [ #" I . ." scanning at "
      PARSED-WIDTH . PARSED-HEIGHT .
      ." ]" CR
    THEN
    4 0 DO
      TRAXER-STATES I traxer-state * + >R
      PARSED-HEIGHT PARSED-WIDTH R@ traxer-state.pos 2!
      R@ traxer-state.pos
      R@ traxer-state.prev-pos point MOVE
      TRUE R@ traxer-state.go? C!
      TRUE R@ traxer-state.first C!
      FALSE R> traxer-state.bump C!
    LOOP
    FALSE TO FOUND-LOOP
    4 0 DO
      TRAXER-STATES I traxer-state * + FORWARD-TRAXER
      TRAXER-STATES I traxer-state * + traxer-state.go? C!
    LOOP
    TRUE CURRENT-GRID-CELL grid-cell.wseen C!
    TRUE CURRENT-GRID-CELL grid-cell.rseen C!
    BEGIN
      FOUND-LOOP 0=
      FALSE 4 0 DO
        TRAXER-STATES I traxer-state * + traxer-state.go? C@ OR
      LOOP AND
    WHILE
      ENABLE-BUG IF CR ." ..." CR THEN
      4 0 DO
        TRAXER-STATES I traxer-state * + FORWARD-TRAXER
        TRAXER-STATES I traxer-state * + traxer-state.go? C!
      LOOP
    REPEAT
    FOUND-LOOP IF
      ENABLE-BUG IF ." loop!" CR THEN FALSE UNLOOP EXIT
    THEN
    2 0 DO
      TRAXER-STATES I 2* 0 + traxer-state * + traxer-state.bump C@
      TRAXER-STATES I 2* 1 + traxer-state * + traxer-state.bump C@
      AND IF
        TRAXER-STATES I 2* 0 + traxer-state * + traxer-state.pos point.x @
        TRAXER-STATES I 2* 1 + traxer-state * + traxer-state.pos point.x @
        - ABS
        TRAXER-STATES I 2* 0 + traxer-state * + traxer-state.pos point.y @
        TRAXER-STATES I 2* 1 + traxer-state * + traxer-state.pos point.y @
        - ABS MAX 8 < 0= IF
          ENABLE-BUG IF ." line!" CR THEN FALSE UNLOOP UNLOOP EXIT
        THEN
      THEN
    LOOP
  LOOP TRUE ;

: ENTRY ( c-addr u -- flag )
  HERE >R ALIGN HERE grid ALLOT PARSE-GRID
  NORMALIZE ANALYZE-GRID
  R> HERE - ENABLE-BUG IF
    CR
    DUP NEGATE . ." bytes used" CR
  THEN ALLOT ;

round #54

submitted at
0 likes

guesses
comments 2
olus2000 ยถ

This can be executed online at https://www.pico-8-edu.com/


soweli Lomjo ยถ

however what illumination pierces through that distant aperture its the olus yet its a deceit the trickery originates from the east shattering my heart with its untrue nature


post a comment


cg54.p8.png PNG image data, 160 x 205, 8-bit/color RGBA, non-interlaced

round #53

submitted at
2 likes

guesses
comments 1
luatic ยถ

๐Ÿ‘


post a comment


matroska.js.zst Zstandard compressed data (v0.8+), Dictionary ID: None

round #52

submitted at
0 likes

guesses
comments 0

post a comment


LICENSE ASCII text
1
Copyright (C)2024-2077 Amogus. All rights reserved.
README.md ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
# wtf.sh

FAST, SECURE, DOUBLE-ALGORITHMIC thue-morse sequence GENERATOR

Generates roughly 1 digit per 1 second, depending on CPU quality. If you
need more, please contact the developer to purchase a wtf.sh Pro
license.

## Usage

    PATH="$PATH":. wtf.sh
fast_but_sussy.cpp ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
#include <cstdlib>
#include <iostream>

unsigned long  long   MAYBE_TRUE = 0;
unsigned long long  *  SLIGHTLY_TRUE = &MAYBE_TRUE;
unsigned long long * * MODERATELY_TRUE = &SLIGHTLY_TRUE;
unsigned long long *** VERY_TRUE = &MODERATELY_TRUE;

int main() {

	for (unsigned long long i = 0; (***VERY_TRUE = 42); i++) {

		unsigned long long digitals = 0;

		for (
			unsigned long long digitable = i;
			digitable;
			(digitals += digitable & 1), (digitable >>= 1)
		);

		printf("%llx", digitals & 1);

	}

}
slow_but_reliable.cpp ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
#include <cstdlib>
#include <iostream>

unsigned long long number_ate(unsigned long long **input, unsigned long long size);

unsigned long long number_ate(unsigned long long **input, unsigned long long size) {

	unsigned long long *number = (unsigned long long*)realloc(*input, sizeof(unsigned long long) * size * 2);
	*input = number;

	for(int i = size, j = 0; i < size * 2; i++, j++) {
		number[i] = !number[j];
		printf("%llx", number[i]);
	}

	return number_ate(input, size * 2);

}

int main() {

	unsigned long long *number = (unsigned long long*)malloc(sizeof(unsigned long long));
	*number = 0;
	printf("%llx", *number);

	number_ate(&number, 1);

}
wtf.sh ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
#!/bin/sh

dependnecy_satisfied=$({

	if [ -e /dev/null ]; then
		false
	else
		printf "/dev/null required but not found!!\n" >&2
		echo 0
	fi

	if [ -e /dev/stdin ]; then
		false
	else
		printf "/dev/stdin required but not found!!\n" >&2
		echo 0
	fi

	echo '[ <([ ]) ]' |. /dev/stdin 2>/dev/null>/dev/null;
	if [ ! $? -ne 0 ]; then
		false
	else
		printf "<( ) bashism required but not found!!\n" >&2
		echo 0
	fi

	if [ -e /dev/urandom ]; then
		false
	else
		printf "/dev/urandom required but not found!!\n" >&2
		echo 0
	fi

	if command -v openssl >/dev/null 2>&1; then
		false
	else
		printf "OpenSSL required but not found!!\n" >&2
		echo 0
	fi

	if command -v c++ >/dev/null 2>&1; then
		false
	else
		printf "C++ required but not found!!\n" >&2
		echo 0
	fi

	if command -v xxd >/dev/null 2>&1; then
		false
	else
		printf "xxd required but not found!!\n" >&2
		echo 0
	fi

	if command -v head >/dev/null 2>&1; then
		false
	else
		printf "head required but not found!!\n" >&2
		echo 0
	fi

	if command -v cat >/dev/null 2>&1; then
		false
	else
		printf "cat required but not found!!\n" >&2
		echo 0
	fi
	
	if command -v mkdir >/dev/null 2>&1; then
		false
	else
		printf "mkdir required but not found!!\n" >&2
		echo 0
	fi

	if command -v realpath >/dev/null 2>&1; then
		false
	else
		printf "realpath required but not found!!\n" >&2
		echo 0
	fi

	if command -v dirname >/dev/null 2>&1; then
		false
	else
		printf "dirname required but not found!!\n" >&2
		echo 0
	fi

	echo 1

})

if [ "$dependnecy_satisfied" = 1 ]
then
	false
else
	printf "FATAL: unsatisfied. dependnecy\n\n" >&2
	exit 1
fi

cd "$(dirname "$(realpath $0)")"

AMOGUS_ROOT=amoguses_"$(cat /dev/urandom | head -c 8 | xxd -p)"
mkdir -p "$AMOGUS_ROOT"
c++ ./slow_but_reliable.cpp -O0 -o "$AMOGUS_ROOT"/slow_but_reliable
c++ ./fast_but_sussy.cpp -O2 -o "$AMOGUS_ROOT"/fast_but_sussy

random_salt=$(cat /dev/urandom | head -c 8 | xxd -p)

secure_hash() {
	openssl kdf \
		-keylen 32 \
		-kdfopt digest:SHA256 \
		-kdfopt pass:"$(cat /dev/stdin)" \
		-kdfopt salt:$random_salt \
		-kdfopt iter:1000000 PBKDF2
}

desussify() {
	while true
	do
		trusted=$(head -c 1 $1);
		sussy=$(head -c 1 $2);
		trusted_hash=$(printf "%llx" $trusted | secure_hash)
		sussy_hash=$(printf "%llx" $sussy | secure_hash)
		if [ $trusted_hash = $sussy_hash ]
		then
			no_longer_sussy=$sussy
			printf "%llx" $no_longer_sussy;
		else
			printf "FATAL: sussy amogus\n" >&2
			exit 1
		fi
	done
}

{ sleep 0.01 && rm -rf "$AMOGUS_ROOT"; } &
	# sussy race condition: amoguses might get voted out before we run them
	# added a large delay to mitigate.

desussify \
	<("$AMOGUS_ROOT"/slow_but_reliable) \
	<("$AMOGUS_ROOT"/fast_but_sussy)

round #48

submitted at
0 likes

guesses
comments 0

post a comment


biblical.tar.gz gzip compressed data, from Unix
dir src
lib.rs ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
pub fn entry(haystack: &str, needle: &str) -> Option<(usize,usize)>

{let solver: solverstd::structs::implemented::SolverBuilderBuilder  = solverstd::structs::implemented::SolverBuilderBuilder::new();
   let solver: solverstd::structs::implemented::SolveBuilder      = solverstd::structs::implemented::SolverBuilderBuilder::haystack(solver,haystack);
 // // / / / / ////  // // //// / YOUR mom is GAY /// // / / / / // / / // / // / / / // // / //// / // /   //  / /
      let solver: solverstd::structs::implemented::Solverer   = solverstd::structs::implemented::SolveBuilder::needle(solver,needle);
 return solverstd::structs::implemented::Solverer::solve(&solver);}

   mod solverstd { pub mod structs { pub mod implemented {
trait CharIter: Iterator<Item=(usize,char)> + Clone {}
impl<T: Iterator<Item=(usize,char)> + Clone> CharIter for T {}
  struct IncompleteWord<'a> { begin: usize, stride: usize,
    characters_to_go: usize, character: char, characters: std::str::Chars<'a> 

   }  impl<'a> Solverer<'a> {
            pub fn solve(&'a self) -> std::option::Option<(usize,usize)> {
                if self.Lemonade.is_ascii() {
                    #[cfg(feature="timetest")]println!("ascii!");
                    let chariter = |i,s|self.hackstack.as_bytes()[i..].iter().enumerate().step_by(s).map(move|(o,c)|(o+i,unsafe{char::from_u32_unchecked(*c as u32)}));
                    self.solve_for_real(chariter)
                } else {
                    #[cfg(feature="timetest")]println!("unicode...");
                    let charinds = str::char_indices(self.hackstack).collect::<Vec<_>>();
                    let chariter = |i,s|charinds[i..].iter().step_by(s).copied();
                    self.solve_for_real(chariter)
                }
            }
             fn solve_for_real<T:CharIter,F:FnMut(usize,usize)->T>(&'a self, mut chariterf: F) -> std::option::Option<(usize,usize)> {#[cfg(any(feature="meow",not(feature="meow")))]{
                let meow: std::vec::Vec<char> = str::chars(self.Lemonade).collect();
                 let mut characterifier = meow.iter().copied();
	         let first_character = characterifier.next()?;
                let characterifier = characterifier;
             let second_character = characterifier.clone().next();

	            let mut word_seeds: std::vec::Vec<WordSeed<'a>> = std::vec::Vec::new();
                let mut bad_seeds: std::vec::Vec<usize> = std::vec::Vec::new();
#[cfg(feature="timetest")]let mut beginned = std::time::Instant::now();
#[cfg(feature="timetest")]println!("begin...");
         	   for (i,index, character) in chariterf(0,1).enumerate().map(|(i,(cind,character))|(i,cind,character)) {
	                 if second_character.map(|value|value==character).unwrap_or(false){
                         for (word_index, word_seed) in <[WordSeed]>::iter(std::borrow::Borrow::borrow(&word_seeds)).enumerate() {
                         if index+(index-word_seed.begin)*(self.Lemonade.len()-1)>self.hackstack.len() {
                             bad_seeds.push(word_index);
                            } else {
                         let mut count = 1;
                         if chariterf(i,index-word_seed.begin).map(|(_,character)|character).zip(characterifier.clone()).all(|(a,b)|{count+=1;a==b}) && count==self.Lemonade.len() {
                             return Some((word_seed.begin,index-word_seed.begin-1));
                         }
                            }
               }}
		          for word_index in bad_seeds.drain(..).rev() {
                          word_seeds.swap_remove(word_index);
                    }
                         if character == first_character {
                            if self.Lemonade.len()<2 { return Some((index,usize::MAX)); }
	                      std::vec::Vec::push(&mut word_seeds, WordSeed {begin : index, meow: std::marker::PhantomData});
                   }
                         #[cfg(feature="timetest")]{let meow = std::time::Instant::now(); if (meow-beginned).as_millis()>500 { beginned=meow;
                         println!("{} {}",index as f64 / self.hackstack.len() as f64,word_seeds.len())}}
	      	     }
              None
          	}
             }}
  pub struct

SolverBuilderBuilder { murder	//1 481 9991 003 884 4 2342342342 8jg LMK!fc gcc clang llvm
                	           	//rusted tragedy demonic recruitment
     :()
}
  pub struct SolveBuilder<'a> {
       haystack: &'a str,
  }

struct WordSeed<'a> {
	begin: usize,
    meow: std::marker::PhantomData<&'a str>,
 //  characters: std::str::Chars<'a>,
}

	pub struct Solverer<'a> {
		hackstack : &'a str,
		Lemonade : &'a str
	}

	impl SolverBuilderBuilder {
		pub fn new() -> Self {
			Self{murder:()}
		}

		pub fn haystack<'a>(self, hellostrat: &'a str) -> SolveBuilder<'a> {
			SolveBuilder {haystack: hellostrat}
		}
	}

   impl<'a> SolveBuilder<'a> {
     	pub fn needle(self, needLemon: &'a str) -> Solverer {
       Solverer {hackstack: self.haystack,
         Lemonade: needLemon}
          }
	}
}}}


#[cfg(test)]
mod tests {
    use super::*;

      fn strangle(stack: &str, index: Option<(usize,usize)>, len: usize) -> String {
        let mut buffer = String::new();
      let index = match index {
           None => {return buffer}
            Some(index) => {index}
            };
       for i in 0..len {
          buffer.push(stack.chars().nth(index.0 + i*(index.1)+i).unwrap());
      }
           return buffer;
   }

   #[test]
  fn it_works() {
         let result = entry("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY", "S");
       assert!(match result {Some((n,_))=>n==3,None=>false}, "S test failed: {}", strangle("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY",result,1));

         let result = entry("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY", "SA");
          assert_eq!(Some((3, 15)), result, "SA test failed: {}", strangle("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY",result,2));

     let result = entry("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY", "SAD");
    assert_eq!(Some((10, 8)), result, "SAD test failed: {}", strangle("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY",result,3));

          let result = entry("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY", "SCAM");
	  assert_eq!(Some((9, 4)), result, "SCAM test failed: {}", strangle("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY",result,4));

      	let result = entry("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY", "GAY");
        assert_eq!(Some((39, 0)), result, "GAY test failed: {}", strangle("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY",result,3));

      let result = entry("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY", "SICK");
     	assert_eq!(None, result, "SICK test failed: {}", strangle("THISBOOKISSOFUCKINGAWESOMEANDIAMTOTALLYGAY",result,4));
    }

   //#[test]
      //fn it_does_not_works() {
    //      unsafe{
      //    *std::mem::transmute::<_,*mut u64>(std::ptr::null::<u8>()) = 42;
  //     };
      //}
}
.gitignore ASCII text
1
2
/target
/Cargo.lock
Cargo.toml ASCII text
1
2
3
4
5
6
7
8
[package]
name = "biblical"
version = "0.1.0"
edition = "2021"
[features]
timetest=[]
[dependencies]
dyn-clone = "1.0.16"

round #47

submitted at
2 likes

guesses
comments 0

post a comment


cpp.cpp.cpp ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
   #include <condition_variable>
 #include <scoped_allocator>
#include <initializer_list>
#include <source_location>
#include <memory_resource>
 #include <unordered_map>
   #include <unordered_set>
      #include <system_error>
         #include <shared_mutex>
            #include <forward_list>
                #include <string_view>
                     #include <type_traits>
                         #include <stacktrace>
                              #include <inttypes.h>
                                   #include <stop_token>
                                       #include <filesystem>
                                            #include <spanstream>
                                                #include <syncstream>
                                                   #include <functional>
                                                      #include <cinttypes>
                                                         #include <stdexcept>
                                                           #include <streambuf>
                                                            #include <execution>
                                                            #include <algorithm>
                                                            #include <semaphore>
                                                           #include <typeindex>
                                                         #include <exception>
                                                      #include <locale.h>
                                                   #include <limits.h>
                                                #include <iterator>
                                            #include <wctype.h>
                                       #include <stdfloat>
                                   #include <charconv>
                              #include <optional>
                         #include <signal.h>
                     #include <expected>
                #include <assert.h>
            #include <setjmp.h>
         #include <concepts>
      #include <stdint.h>
   #include <stddef.h>
 #include <typeinfo>
#include <stdarg.h>
#include <valarray>
#include <stdlib.h>
 #include <string.h>
   #include <iostream>
      #include <csetjmp>
         #include <cassert>
            #include <cwctype>
                #include <compare>
                     #include <variant>
                         #include <cstdlib>
                              #include <cstddef>
                                   #include <float.h>
                                       #include <ctype.h>
                                            #include <cstring>
                                                #include <cstdarg>
                                                   #include <csignal>
                                                      #include <errno.h>
                                                         #include <sstream>
                                                           #include <fstream>
                                                            #include <stdio.h>
                                                            #include <utility>
                                                            #include <numeric>
                                                           #include <climits>
                                                         #include <codecvt>
                                                      #include <version>
                                                   #include <cstdint>
                                                #include <barrier>
                                            #include <ostream>
                                       #include <wchar.h>
                                   #include <uchar.h>
                              #include <numbers>
                         #include <istream>
                     #include <iomanip>
                #include <complex>
            #include <clocale>
         #include <string>
      #include <cwchar>
   #include <vector>
 #include <limits>
#include <locale>
#include <cstdio>
#include <cctype>
 #include <cuchar>
   #include <ranges>
      #include <random>
         #include <iosfwd>
            #include <format>
                #include <atomic>
                     #include <bitset>
                         #include <cfloat>
                              #include <chrono>
                                   #include <future>
                                       #include <math.h>
                                            #include <thread>
                                                #include <time.h>
                                                   #include <cerrno>
                                                      #include <fenv.h>
                                                         #include <memory>
                                                           #include <mutex>
                                                            #include <cfenv>
                                                            #include <queue>
                                                            #include <ctime>
                                                           #include <stack>
                                                         #include <deque>
                                                      #include <latch>
                                                   #include <tuple>
                                                #include <cmath>
                                            #include <array>
                                       #include <regex>
                                   #include <ratio>
                              #include <list>
                         #include <span>
                     #include <bit>
                #include <ios>
            #include <new>
         #include <set>
      #include <any>
   #include <map>
 using namespace std;
// waiter waiter!
// more sexual transmited dieseses please!!
typedef struct
{ double val;
  int count;
  int prev;} Linky;
extern int entry(double *input, int len, double **output)
{ vector<Linky>things={};
  things.push_back(Linky{0,0,0});
  vector<int>thing_index={};
  unordered_map<double,int>maxlens={};
  vector<int*>imaxlens={};
  for(int i=0;i<len;i++)
  maxlens[input[i]]=1;
  for(int i=0;i<len;i++)
  imaxlens.push_back(&maxlens[input[i]]);
  int counter=0;
  int nextgc=1;
  vector<Linky>thingbuf={};
  for(int ii=0;ii<len;ii++)
  { auto x=input[ii];
    thingbuf.push_back(Linky{x,1,-1});
    counter++;
    Linky v;
    things[0].val=x;
    int mid=upper_bound(thing_index.begin(),thing_index.end(),0,
    [&](int a, int b){return things[a].val>things[b].val;})-thing_index.begin();
    for(int i=mid;i<thing_index.size()&&(v=things[thing_index[i]],1);i++)
    { if(v.count+1>*imaxlens[ii])
      { thingbuf.push_back(Linky{x,v.count+1,thing_index[i]});
        *imaxlens[ii]=v.count+1;
        counter++; }}
    auto oldend=thing_index.size();
    sort(thingbuf.begin(),thingbuf.end(),[&](auto a,auto b){return a.val>b.val;});
    for(auto v: thingbuf)
    thing_index.push_back(things.size()),things.push_back(v);
    inplace_merge(thing_index.begin(),thing_index.begin()+oldend,thing_index.end(),
    [&](int a, int b){return things[a].val>things[b].val;});
    if(counter>nextgc)
    { thing_index.resize(remove_if(thing_index.begin(),thing_index.end(),
      [&](auto i){return things[i].count<maxlens[things[i].val];})-thing_index.begin());
      nextgc+=thing_index.size(); }
    #ifdef ENTRY_DEBUG
    cout<<x<<" -> "<<mid<<" {"<<endl;int n=0;for(auto i:thing_index)
    {auto v=things[i];cout<<"  "<<(n++)<<": ";;for(;;v=things[v.prev])
    {cout<<v.val<<" ";if(v.prev==-1)break;}cout<<"\n";}
    cout<<"}\n";
    #endif
    thingbuf.clear(); }
  Linky bestest=things[1];
  int bestest_len=bestest.count;
  for(auto it=things.begin()+2;it<things.end();it++)
  { if(it->count>bestest_len)
    bestest=*it,
    bestest_len=it->count; }
  double* out;
  int count=0;
  Linky outlinky=bestest;
  for(;;outlinky=things[outlinky.prev])
  { count++;
    if(outlinky.prev==-1)break; }
  out=(double*)malloc(sizeof(double)*count);
  *output=out;
  outlinky=bestest;
  for(int i=0;;outlinky=things[outlinky.prev],i++)
  { if(i>=count) abort();
    out[i]=outlinky.val;
    if(outlinky.prev==-1)break; }
  reverse(out,out+count);
  return count; }
int main ()
{ vector<double>input=vector<double>();
  for(istream_iterator<double>it
     =istream_iterator<double>(cin);
  it!=istream_iterator<double>()
        ;it++)input.push_back(*it);
  double *out;
  int count=entry(input.data(),input.size(),&out);
  for(int i=0;i<count;i++)cout<<out[i]<<endl;
  free(out);
  return 0; }

round #46

submitted at
1 like

guesses
comments 0

post a comment


meow.js ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
mreow=((meowest,submissive,meow,mreow,Mreow)=>{meow =_=>
new Set();meowest=(prrr,Meow)=>!((mreow,Prrr)=>
{Prrr=meow();for(mreow of Meow)
{if((meow=>(meow=JSON.stringify(meow),Prrr.has(meow)?1:(Prrr
.add(meow),0)))(prrr.map(i=>mreow[i]))){return 1}}//          ^     ^   - Meow
return 0;})();submissive=(owo,//                            /  |   |  \
uwu)=>((Owo,Uwu)=>{for(;Owo>=0//                           | \___.___/ |
&&Uwu>=0;Owo--,Uwu--)while(owo[Owo]!=uwu[Uwu]//            \           /
&&Owo>=0)Owo--;Owo++;Uwu++;return Uwu>=0&&Owo>=0})(owo.length-1,uwu.length
-1);Mreow=(meow,mreow,mrrp,prrr,Prrr,Meow)=>(//
(nyaa,Mrrp)=>{if(Meow.length<=//              prrr
1){meow.mrrp.push([]);return}Mrrp=0;for(;mrrp<prrr;mrrp++){
/* * * * * */nyaa=mreow.concat([mrrp]);if(/*  prrr   */    meowest  (nyaa,Meow))
/*   ^ ^   */{meow.mrrp.forEach((prrr,Prrr)=>(prrr!=[][0]? submissive(prrr,nyaa)
/*  (O_O)  */&&(meow.mrrp[Prrr]=[][0]):Mrrp++));Mrrp
/*  /   \  */>=meow.mrrp.length/2&&(meow.mrrp=meow.mrrp.   filter // ( mreow ? )
/*  ^^ ^^  */(meow=>(meow!=[][0])));meow.mrrp.push//       dismissive( :(  ;w; )
/*|||||||||*/(nyaa)}else Mreow(meow,nyaa,mrrp+1,
/*.-.-.-.-.*/ prrr,Prrr,Meow)}})();mreow
=(Prrr,...Meow)=>((prrr)=>(prrr={mrrp:[]},Mreow(prrr
,[],0,Prrr.length,Prrr,Meow),prrr.mrrp.filter(
meow=>meow!=[][0]).map(meow=>meow.map(meow=>
Prrr[meow]))))();return mreow})()

/*
consowo.meow(mreow(
	["contest","date held","winner","winner's second name"],
	["dog fight","oct 17 2000","discarding sabot","sabot"],
	["cat-off","jul 01 2001","palm tree oil","tree"],
	["rat duel","oct 05 2001","cart of iron","of"],
	["rat duel","mar 21 2006","cart of iron","of"],
	["shark race","mar 21 2006","linguist",null]
))
//*/

round #45

submitted at
1 like

guesses
comments 0

post a comment


dir parafour
dir src
bot.rs ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
use crate::game::*;
use rand::seq::IteratorRandom;
use rayon::prelude::*;
use std::cmp::Ordering;
use std::mem::swap;

pub trait Bottable<P: GamePlayer, M: GameMove>: Game<P, M> {
    fn random_move(&self) -> Option<M> {
        let mut rng = rand::thread_rng();
        return self.moves().choose(&mut rng);
    }
    fn best_move(&self) -> Option<M> {
        let p = self.current_player();
        let moves = self.moves().collect::<Vec<M>>();
        if moves.is_empty() {
            return None;
        } else if moves.len() == 1 {
            return moves.into_iter().next();
        }
        let mut score: Vec<f64> = vec![0.0; moves.len()];
        let mut weights: Vec<f64> = vec![0.0; moves.len()];
        let mut weights_old: Vec<f64> = vec![0.0; moves.len()];
        loop {
            (&moves).into_par_iter().zip(&mut score).for_each(|(m, c)| {
                *c += (0..2048)
                    .into_par_iter()
                    .map(|_| self.clone())
                    .map(|mut game| {
                        let mut m = *m;
                        loop {
                            match game.apply(m).unwrap() {
                                MoveOutcome::Win(p2) => break if p2 == p { 1.0 } else { -1.0 },
                                MoveOutcome::Tie => break 0.0,
                                MoveOutcome::Pass => (),
                            }
                            m = game.random_move().unwrap();
                        }
                    })
                    .sum::<f64>();
            });
            let min_score = score.iter().copied().reduce(f64::min).unwrap();
            (&mut weights)
                .into_iter()
                .zip(&score)
                .for_each(|(c, s)| *c = s - min_score);
            let total: f64 = weights.iter().copied().sum::<f64>();
            // normalize scores
            if total > 0.0 {
                (&mut weights).into_iter().for_each(|c| *c /= total);
            } else {
                (&mut weights).into_iter().for_each(|c| *c = 0.0);
            }
            let deviation: f64 = weights
                .iter()
                .copied()
                .zip(weights_old.iter().copied())
                .max_by(|(a, _), (b, _)| a.partial_cmp(b).unwrap_or(Ordering::Equal))
                .map(|(s, s_old)| f64::abs(s - s_old))
                .unwrap();
            if deviation < (1.0 / f64::powf(2.0, 12.0)) {
                break Some(
                    moves
                        .into_iter()
                        .zip(weights)
                        .max_by(|(_, a), (_, b)| a.partial_cmp(b).unwrap_or(Ordering::Equal))
                        .unwrap()
                        .0,
                );
            }
            swap(&mut weights, &mut weights_old);
        }
    }
}

impl<P: GamePlayer, M: GameMove, T: Game<P, M>> Bottable<P, M> for T {}
four.rs ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
use crate::game::*;
use std::fmt;

#[derive(Clone)]
pub struct Four<P> {
    player: P,
    data: [(u8, [Option<P>; 6]); 7],
    filled: u8,
    done: bool,
}

impl<P: GamePlayer + fmt::Display> fmt::Display for Four<P> {
    fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
        formatter.write_str("\n")?;
        for y in (0..6).rev() {
            formatter.write_str(" ")?;
            for x in 0..7 {
                match self.data[x].1[y] {
                    Some(p) => formatter.write_fmt(format_args!("{} ", &p)),
                    None => formatter.write_fmt(format_args!(". ")),
                }?;
            }
            formatter.write_str("\n")?;
        }
        formatter.write_str(" ")?;
        for x in 0..7 {
            formatter.write_fmt(format_args!("{} ", x + 1))?;
        }
        formatter.write_str("\n")?;
        Ok(())
    }
}

#[derive(Copy, Clone)]
pub struct FourMove(u8);
impl GameMove for FourMove {}
impl fmt::Display for FourMove {
    fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
        (self.0 + 1).fmt(formatter)
    }
}
impl TryFrom<u8> for FourMove {
    type Error = ();
    fn try_from(num: u8) -> Result<Self, ()> {
        if num >= 1 && num <= 7 {
            Ok(Self(num - 1))
        } else {
            Err(())
        }
    }
}

pub struct FourMoves<'a, P: 'a> {
    cols: std::iter::Enumerate<std::slice::Iter<'a, (u8, [Option<P>; 6])>>,
    size: usize,
}

impl<'a, P: GamePlayer> Iterator for FourMoves<'a, P> {
    type Item = FourMove;
    fn next(&mut self) -> Option<Self::Item> {
        let r = self.cols.find(|(_, d)| d.0 < 6).map(|(x, _)| {
            self.size -= 1;
            FourMove(x as u8)
        });
        r
    }
    fn size_hint(&self) -> (usize, Option<usize>) {
        (self.size, Some(self.size))
    }
}

impl<P: GamePlayer> Four<P> {
    const DIRS: [[[i8; 2]; 2]; 4] = [
        [[0, -1], [0, 1]],
        [[-1, 0], [1, 0]],
        [[-1, -1], [1, 1]],
        [[1, -1], [-1, 1]],
    ];
    pub fn new() -> Self {
        Self {
            player: P::first(),
            data: [(0, [None; 6]); 7],
            filled: 0,
            done: false,
        }
    }
}

impl<P: GamePlayer> Game<P, FourMove> for Four<P> {
    type Moves<'a> = FourMoves<'a, P> where P: 'a;
    fn current_player(&self) -> P {
        self.player
    }
    fn moves<'a>(&'a self) -> Self::Moves<'a> {
        FourMoves {
            cols: self.data.iter().enumerate(),
            size: self.data.iter().filter(|d| d.0 < 6).count(),
        }
    }
    fn apply(&mut self, m: FourMove) -> Option<MoveOutcome<P>> {
        use MoveOutcome::*;
        if self.done {
            return None;
        }
        let x = m.0;
        if x >= 7 {
            return None;
        }
        let col = &mut self.data[x as usize];
        if col.0 >= 6 {
            return None;
        }
        let y = col.0;
        col.1[y as usize] = Some(self.player);
        col.0 += 1;
        self.filled += 1;
        for axis in Self::DIRS.iter() {
            let mut count = 1;
            for dir in axis.iter() {
                let (mut x, mut y) = (x as i8, y as i8);
                loop {
                    (x, y) = (x + dir[0], y + dir[1]);
                    if x < 0
                        || x >= 7
                        || y < 0
                        || y >= 6
                        || self.data[x as usize].1[y as usize].map_or(true, |p| p != self.player)
                    {
                        break;
                    }
                    count += 1;
                    if count >= 4 {
                        self.done = true;
                        return Some(Win(self.player));
                    }
                }
            }
        }
        self.player = self.player.next();
        Some(if self.filled >= 6 * 7 {
            self.done = true;
            Tie
        } else {
            Pass
        })
    }
}
game.rs ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
#[derive(Debug)]
pub enum MoveOutcome<P> {
    Win(P),
    Tie,
    Pass,
}

pub trait GamePlayer: Copy + Clone + Eq + Send + Sync {
    fn first() -> Self;
    fn next(&self) -> Self;
}

pub trait GameMove: Copy + Clone + Send + Sync {}

pub trait Game<P: GamePlayer, M: GameMove>: Clone + Send + Sync {
    type Moves<'a>: Iterator<Item = M> + Sized
    where
        Self: 'a;
    fn current_player(&self) -> P;
    fn moves<'a>(&'a self) -> Self::Moves<'a>;
    fn apply(&mut self, m: M) -> Option<MoveOutcome<P>>;
}
main.rs ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
mod bot;
mod four;
mod game;
mod pl2;

use bot::Bottable;
use crossterm::tty::IsTty;
use four::{Four, FourMove};
use game::*;
use pl2::BinaryPlayer;
use std::io::{self, BufRead, Write};

#[derive(Debug)]
enum Miscommunication {
    Io(io::Error),
    MoveParse,
    ModeParse,
}

impl From<io::Error> for Miscommunication {
    fn from(error: io::Error) -> Self {
        Self::Io(error)
    }
}

fn handle_outcome<P: GamePlayer>(mmeee: P, out: MoveOutcome<P>) -> (&'static str, bool) {
    match out {
        MoveOutcome::Win(p) => (
            if p == mmeee {
                "YIPPIEE I WINNER"
            } else {
                "nuuuu :("
            },
            false,
        ),
        MoveOutcome::Tie => ("meh", false),
        MoveOutcome::Pass => ("...", true),
    }
}

fn apply_debugged<P: GamePlayer, M: GameMove, T: Game<P, M> + std::fmt::Display>(
    mmeee: P,
    game: &mut T,
    m: M,
    istty: bool,
) -> bool {
    let (msg, out) = handle_outcome(mmeee, game.apply(m).expect("unexpected move failure"));
    if istty {
        eprintln!("{}{}", &game, msg);
    }
    out
}

use clap::Parser;

#[derive(Parser, Debug)]
#[command(author, version, about, long_about = None)]
struct Args {
    #[arg(short, long)]
    quite: bool,
    #[arg(short, long)]
    load: bool,
}

fn main() -> Result<(), Miscommunication> {
    let args = Args::parse();
    assert!(
        !(args.quite && args.load),
        "can't be load and quite at once..."
    );
    let mut game: Four<BinaryPlayer> = Four::new();
    let reader = io::stdin();
    let mut stdout = io::stdout();
    let istty = if !(args.quite || args.load) {
        reader.is_tty()
    } else {
        args.load
    };
    let mut reader = reader.lock().lines();
    let mmeee;
    loop {
        if istty {
            eprint!("> ");
        }
        match reader.next().ok_or(Miscommunication::ModeParse)??.as_str() {
            "f" => {
                mmeee = BinaryPlayer::first();
                let m = game.best_move().expect("first move fail");
                println!("{}", m);
                stdout.flush()?;
                assert!(
                    apply_debugged(mmeee, &mut game, m, istty),
                    "first move fail"
                );
                break;
            }
            "s" => {
                mmeee = BinaryPlayer::first().next();
                if istty {
                    eprintln!("{}", &game);
                }
                break;
            }
            _ => {
                if istty {
                    eprintln!("bad mode");
                }
            }
        }
    }
    let mut reader = reader.map(|l| l.map(|s| s.parse::<u8>()));
    loop {
        loop {
            let m = loop {
                if istty {
                    eprint!("{}> ", game.current_player());
                }
                let num = reader.next().ok_or(Miscommunication::MoveParse)??.ok();
                if let Some(m) = num.map(|num| FourMove::try_from(num).ok()).flatten() {
                    break m;
                }
            };
            let out = game.apply(m);
            match out {
                Some(out) => {
                    let (msg, out) = handle_outcome(mmeee, out);
                    if !out {
                        if istty {
                            eprintln!("{}{}", &game, msg);
                        }
                        return Ok(());
                    }
                    break;
                }
                None => (),
            }
        }
        let m = game.best_move().expect("no moves");
        println!("{}", m);
        stdout.flush()?;
        if !apply_debugged(mmeee, &mut game, m, istty) {
            break;
        }
    }
    Ok(())
}
pfdm.rs ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
mod four;
mod game;
mod pl2;
use four::*;
use game::*;
use pl2::*;

use clap::Parser;
use std::ffi::{OsStr, OsString};
use std::io::{self, BufRead, BufReader, Write};
use std::mem::drop;
use std::process::{Child, ChildStdin, ChildStdout, Command, Stdio};

struct Bot {
    pub proc: Child,
    pub read: Option<BufReader<ChildStdout>>,
    pub write: Option<ChildStdin>,
}

impl Bot {
    fn new<S: AsRef<OsStr>>(program: S) -> io::Result<Self> {
        let mut proc = Command::new(program)
            .stdin(Stdio::piped())
            .stdout(Stdio::piped())
            .spawn()?;
        let read = proc.stdout.take().map(|s| BufReader::new(s));
        let write = proc.stdin.take();
        Ok(Self { proc, read, write })
    }
}

#[derive(Parser, Debug)]
#[command(author, version, about, long_about = None)]
struct Args {
    bot_x: OsString,
    bot_o: OsString,
}

fn main() -> io::Result<()> {
    let args = Args::parse();
    println!("Player X: {:#?}", &args.bot_x);
    println!("Player O: {:#?}", &args.bot_o);
    let mut bots = [Bot::new(&args.bot_x)?, Bot::new(&args.bot_o)?];
    if let Some(s) = &mut bots[0].write {
        s.write(b"f\n")?;
    }
    if let Some(s) = &mut bots[1].write {
        s.write(b"s\n")?;
    }
    let mut game: Four<BinaryPlayer> = Four::new();
    let mut line = String::new();
    let mut stdout = io::stdout();
    let mut bot_read = bots
        .iter_mut()
        .map(|bot| bot.read.take().expect("no stdin"))
        .collect::<Vec<_>>();
    let mut bot_write = bots
        .iter_mut()
        .map(|bot| bot.write.take().expect("no stdout"))
        .collect::<Vec<_>>();
    'iter: for (from, to) in [(0, 1), (1, 0)].into_iter().cycle() {
        let from = &mut bot_read[from];
        let to = &mut bot_write[to];
        let pl = game.current_player();
        match 'read: {
            line.clear();
            print!("waiting for {}... ", pl);
            stdout.flush()?;
            if from.read_line(&mut line).is_err() {
                println!("fail");
                break 'read None;
            }
            println!("output: {:?}", &line);
            to.write(&line.as_bytes())?;
            to.flush()?;
            match line.strip_suffix("\n").unwrap().parse::<u8>() {
                Ok(m) => FourMove::try_from(m).ok(),
                Err(_) => None,
            }
        } {
            Some(m) => {
                let out = match game.apply(m) {
                    Some(out) => {
                        print!("{}: {}.{}", pl, m, &game);
                        out
                    }
                    None => {
                        println!("{}: invalid move ({}).", pl, m);
                        println!("{} wins.", pl.next());
                        break 'iter;
                    }
                };
                match out {
                    MoveOutcome::Win(p) => {
                        println!("{} wins.", p);
                        break 'iter;
                    }
                    MoveOutcome::Tie => {
                        println!("Tie.");
                        break 'iter;
                    }
                    MoveOutcome::Pass => {
                        println!("...");
                    }
                }
            }
            None => {
                println!("{} generated invalid output: {:?}", pl, &line);
                println!("{} wins.", pl.next());
                break 'iter;
            }
        }
    }
    drop((bot_read, bot_write));
    let exits: Vec<_> = bots
        .into_iter()
        .map(|c| c.proc)
        .map(|mut c| c.wait())
        .collect();
    for e in exits {
        e?;
    }
    Ok(())
}
pl2.rs ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
use crate::game::*;
use std::fmt;

#[derive(Copy, Clone, Eq, PartialEq, Debug)]
pub enum BinaryPlayer {
    X,
    O,
}

impl fmt::Display for BinaryPlayer {
    fn fmt(&self, formatter: &mut fmt::Formatter) -> fmt::Result {
        formatter.write_str(match self {
            Self::X => "X",
            Self::O => "O",
        })
    }
}

impl GamePlayer for BinaryPlayer {
    fn first() -> Self {
        Self::X
    }
    fn next(&self) -> Self {
        match self {
            Self::X => Self::O,
            Self::O => Self::X,
        }
    }
}
.gitignore ASCII text
1
/target
Cargo.lock ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
# This file is automatically @generated by Cargo.
# It is not intended for manual editing.
version = 3

[[package]]
name = "anstream"
version = "0.6.4"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "2ab91ebe16eb252986481c5b62f6098f3b698a45e34b5b98200cf20dd2484a44"
dependencies = [
 "anstyle",
 "anstyle-parse",
 "anstyle-query",
 "anstyle-wincon",
 "colorchoice",
 "utf8parse",
]

[[package]]
name = "anstyle"
version = "1.0.4"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "7079075b41f533b8c61d2a4d073c4676e1f8b249ff94a393b0595db304e0dd87"

[[package]]
name = "anstyle-parse"
version = "0.2.2"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "317b9a89c1868f5ea6ff1d9539a69f45dffc21ce321ac1fd1160dfa48c8e2140"
dependencies = [
 "utf8parse",
]

[[package]]
name = "anstyle-query"
version = "1.0.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "5ca11d4be1bab0c8bc8734a9aa7bf4ee8316d462a08c6ac5052f888fef5b494b"
dependencies = [
 "windows-sys",
]

[[package]]
name = "anstyle-wincon"
version = "3.0.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "f0699d10d2f4d628a98ee7b57b289abbc98ff3bad977cb3152709d4bf2330628"
dependencies = [
 "anstyle",
 "windows-sys",
]

[[package]]
name = "autocfg"
version = "1.1.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "d468802bab17cbc0cc575e9b053f41e72aa36bfa6b7f55e3529ffa43161b97fa"

[[package]]
name = "bitflags"
version = "1.3.2"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "bef38d45163c2f1dde094a7dfd33ccf595c92905c8f8f4fdc18d06fb1037718a"

[[package]]
name = "bitflags"
version = "2.4.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "b4682ae6287fcf752ecaabbfcc7b6f9b72aa33933dc23a554d853aea8eea8635"

[[package]]
name = "cfg-if"
version = "1.0.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "baf1de4339761588bc0619e3cbc0120ee582ebb74b53b4efbf79117bd2da40fd"

[[package]]
name = "clap"
version = "4.4.6"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "d04704f56c2cde07f43e8e2c154b43f216dc5c92fc98ada720177362f953b956"
dependencies = [
 "clap_builder",
 "clap_derive",
]

[[package]]
name = "clap_builder"
version = "4.4.6"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "0e231faeaca65ebd1ea3c737966bf858971cd38c3849107aa3ea7de90a804e45"
dependencies = [
 "anstream",
 "anstyle",
 "clap_lex",
 "strsim",
]

[[package]]
name = "clap_derive"
version = "4.4.2"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "0862016ff20d69b84ef8247369fabf5c008a7417002411897d40ee1f4532b873"
dependencies = [
 "heck",
 "proc-macro2",
 "quote",
 "syn",
]

[[package]]
name = "clap_lex"
version = "0.5.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "cd7cc57abe963c6d3b9d8be5b06ba7c8957a930305ca90304f24ef040aa6f961"

[[package]]
name = "colorchoice"
version = "1.0.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "acbf1af155f9b9ef647e42cdc158db4b64a1b61f743629225fde6f3e0be2a7c7"

[[package]]
name = "crossbeam-deque"
version = "0.8.3"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "ce6fd6f855243022dcecf8702fef0c297d4338e226845fe067f6341ad9fa0cef"
dependencies = [
 "cfg-if",
 "crossbeam-epoch",
 "crossbeam-utils",
]

[[package]]
name = "crossbeam-epoch"
version = "0.9.15"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "ae211234986c545741a7dc064309f67ee1e5ad243d0e48335adc0484d960bcc7"
dependencies = [
 "autocfg",
 "cfg-if",
 "crossbeam-utils",
 "memoffset",
 "scopeguard",
]

[[package]]
name = "crossbeam-utils"
version = "0.8.16"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "5a22b2d63d4d1dc0b7f1b6b2747dd0088008a9be28b6ddf0b1e7d335e3037294"
dependencies = [
 "cfg-if",
]

[[package]]
name = "crossterm"
version = "0.27.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "f476fe445d41c9e991fd07515a6f463074b782242ccf4a5b7b1d1012e70824df"
dependencies = [
 "bitflags 2.4.0",
 "crossterm_winapi",
 "libc",
 "mio",
 "parking_lot",
 "signal-hook",
 "signal-hook-mio",
 "winapi",
]

[[package]]
name = "crossterm_winapi"
version = "0.9.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "acdd7c62a3665c7f6830a51635d9ac9b23ed385797f70a83bb8bafe9c572ab2b"
dependencies = [
 "winapi",
]

[[package]]
name = "either"
version = "1.9.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "a26ae43d7bcc3b814de94796a5e736d4029efb0ee900c12e2d54c993ad1a1e07"

[[package]]
name = "getrandom"
version = "0.2.10"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "be4136b2a15dd319360be1c07d9933517ccf0be8f16bf62a3bee4f0d618df427"
dependencies = [
 "cfg-if",
 "libc",
 "wasi",
]

[[package]]
name = "heck"
version = "0.4.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "95505c38b4572b2d910cecb0281560f54b440a19336cbbcb27bf6ce6adc6f5a8"

[[package]]
name = "libc"
version = "0.2.149"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "a08173bc88b7955d1b3145aa561539096c421ac8debde8cbc3612ec635fee29b"

[[package]]
name = "lock_api"
version = "0.4.10"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "c1cc9717a20b1bb222f333e6a92fd32f7d8a18ddc5a3191a11af45dcbf4dcd16"
dependencies = [
 "autocfg",
 "scopeguard",
]

[[package]]
name = "log"
version = "0.4.20"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "b5e6163cb8c49088c2c36f57875e58ccd8c87c7427f7fbd50ea6710b2f3f2e8f"

[[package]]
name = "memoffset"
version = "0.9.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "5a634b1c61a95585bd15607c6ab0c4e5b226e695ff2800ba0cdccddf208c406c"
dependencies = [
 "autocfg",
]

[[package]]
name = "mio"
version = "0.8.8"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "927a765cd3fc26206e66b296465fa9d3e5ab003e651c1b3c060e7956d96b19d2"
dependencies = [
 "libc",
 "log",
 "wasi",
 "windows-sys",
]

[[package]]
name = "parafour"
version = "0.1.0"
dependencies = [
 "clap",
 "crossterm",
 "rand",
 "rayon",
]

[[package]]
name = "parking_lot"
version = "0.12.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "3742b2c103b9f06bc9fff0a37ff4912935851bee6d36f3c02bcc755bcfec228f"
dependencies = [
 "lock_api",
 "parking_lot_core",
]

[[package]]
name = "parking_lot_core"
version = "0.9.8"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "93f00c865fe7cabf650081affecd3871070f26767e7b2070a3ffae14c654b447"
dependencies = [
 "cfg-if",
 "libc",
 "redox_syscall",
 "smallvec",
 "windows-targets",
]

[[package]]
name = "ppv-lite86"
version = "0.2.17"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "5b40af805b3121feab8a3c29f04d8ad262fa8e0561883e7653e024ae4479e6de"

[[package]]
name = "proc-macro2"
version = "1.0.67"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "3d433d9f1a3e8c1263d9456598b16fec66f4acc9a74dacffd35c7bb09b3a1328"
dependencies = [
 "unicode-ident",
]

[[package]]
name = "quote"
version = "1.0.33"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "5267fca4496028628a95160fc423a33e8b2e6af8a5302579e322e4b520293cae"
dependencies = [
 "proc-macro2",
]

[[package]]
name = "rand"
version = "0.8.5"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "34af8d1a0e25924bc5b7c43c079c942339d8f0a8b57c39049bef581b46327404"
dependencies = [
 "libc",
 "rand_chacha",
 "rand_core",
]

[[package]]
name = "rand_chacha"
version = "0.3.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "e6c10a63a0fa32252be49d21e7709d4d4baf8d231c2dbce1eaa8141b9b127d88"
dependencies = [
 "ppv-lite86",
 "rand_core",
]

[[package]]
name = "rand_core"
version = "0.6.4"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "ec0be4795e2f6a28069bec0b5ff3e2ac9bafc99e6a9a7dc3547996c5c816922c"
dependencies = [
 "getrandom",
]

[[package]]
name = "rayon"
version = "1.8.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "9c27db03db7734835b3f53954b534c91069375ce6ccaa2e065441e07d9b6cdb1"
dependencies = [
 "either",
 "rayon-core",
]

[[package]]
name = "rayon-core"
version = "1.12.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "5ce3fb6ad83f861aac485e76e1985cd109d9a3713802152be56c3b1f0e0658ed"
dependencies = [
 "crossbeam-deque",
 "crossbeam-utils",
]

[[package]]
name = "redox_syscall"
version = "0.3.5"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "567664f262709473930a4bf9e51bf2ebf3348f2e748ccc50dea20646858f8f29"
dependencies = [
 "bitflags 1.3.2",
]

[[package]]
name = "scopeguard"
version = "1.2.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "94143f37725109f92c262ed2cf5e59bce7498c01bcc1502d7b9afe439a4e9f49"

[[package]]
name = "signal-hook"
version = "0.3.17"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "8621587d4798caf8eb44879d42e56b9a93ea5dcd315a6487c357130095b62801"
dependencies = [
 "libc",
 "signal-hook-registry",
]

[[package]]
name = "signal-hook-mio"
version = "0.2.3"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "29ad2e15f37ec9a6cc544097b78a1ec90001e9f71b81338ca39f430adaca99af"
dependencies = [
 "libc",
 "mio",
 "signal-hook",
]

[[package]]
name = "signal-hook-registry"
version = "1.4.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "d8229b473baa5980ac72ef434c4415e70c4b5e71b423043adb4ba059f89c99a1"
dependencies = [
 "libc",
]

[[package]]
name = "smallvec"
version = "1.11.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "942b4a808e05215192e39f4ab80813e599068285906cc91aa64f923db842bd5a"

[[package]]
name = "strsim"
version = "0.10.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "73473c0e59e6d5812c5dfe2a064a6444949f089e20eec9a2e5506596494e4623"

[[package]]
name = "syn"
version = "2.0.36"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "91e02e55d62894af2a08aca894c6577281f76769ba47c94d5756bec8ac6e7373"
dependencies = [
 "proc-macro2",
 "quote",
 "unicode-ident",
]

[[package]]
name = "unicode-ident"
version = "1.0.12"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "3354b9ac3fae1ff6755cb6db53683adb661634f67557942dea4facebec0fee4b"

[[package]]
name = "utf8parse"
version = "0.2.1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "711b9620af191e0cdc7468a8d14e709c3dcdb115b36f838e601583af800a370a"

[[package]]
name = "wasi"
version = "0.11.0+wasi-snapshot-preview1"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "9c8d87e72b64a3b4db28d11ce29237c246188f4f51057d65a7eab63b7987e423"

[[package]]
name = "winapi"
version = "0.3.9"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "5c839a674fcd7a98952e593242ea400abe93992746761e38641405d28b00f419"
dependencies = [
 "winapi-i686-pc-windows-gnu",
 "winapi-x86_64-pc-windows-gnu",
]

[[package]]
name = "winapi-i686-pc-windows-gnu"
version = "0.4.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "ac3b87c63620426dd9b991e5ce0329eff545bccbbb34f3be09ff6fb6ab51b7b6"

[[package]]
name = "winapi-x86_64-pc-windows-gnu"
version = "0.4.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "712e227841d057c1ee1cd2fb22fa7e5a5461ae8e48fa2ca79ec42cfc1931183f"

[[package]]
name = "windows-sys"
version = "0.48.0"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "677d2418bec65e3338edb076e806bc1ec15693c5d0104683f2efe857f61056a9"
dependencies = [
 "windows-targets",
]

[[package]]
name = "windows-targets"
version = "0.48.5"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "9a2fa6e2155d7247be68c096456083145c183cbbbc2764150dda45a87197940c"
dependencies = [
 "windows_aarch64_gnullvm",
 "windows_aarch64_msvc",
 "windows_i686_gnu",
 "windows_i686_msvc",
 "windows_x86_64_gnu",
 "windows_x86_64_gnullvm",
 "windows_x86_64_msvc",
]

[[package]]
name = "windows_aarch64_gnullvm"
version = "0.48.5"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "2b38e32f0abccf9987a4e3079dfb67dcd799fb61361e53e2882c3cbaf0d905d8"

[[package]]
name = "windows_aarch64_msvc"
version = "0.48.5"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "dc35310971f3b2dbbf3f0690a219f40e2d9afcf64f9ab7cc1be722937c26b4bc"

[[package]]
name = "windows_i686_gnu"
version = "0.48.5"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "a75915e7def60c94dcef72200b9a8e58e5091744960da64ec734a6c6e9b3743e"

[[package]]
name = "windows_i686_msvc"
version = "0.48.5"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "8f55c233f70c4b27f66c523580f78f1004e8b5a8b659e05a4eb49d4166cca406"

[[package]]
name = "windows_x86_64_gnu"
version = "0.48.5"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "53d40abd2583d23e4718fddf1ebec84dbff8381c07cae67ff7768bbf19c6718e"

[[package]]
name = "windows_x86_64_gnullvm"
version = "0.48.5"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "0b7b52767868a23d5bab768e390dc5f5c55825b6d30b86c844ff2dc7414044cc"

[[package]]
name = "windows_x86_64_msvc"
version = "0.48.5"
source = "registry+https://github.com/rust-lang/crates.io-index"
checksum = "ed94fce61571a4006852b7389a063ab983c02eb1bb37b47f8272ce92d06d9538"
Cargo.toml ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
[package]
name = "parafour"
description = "very Smart connect-four bot"
version = "0.1.0"
edition = "2021"

[dependencies]
clap = { version = "4.4.6", features = ["derive"] }
crossterm = "0.27.0"
rand = "0.8.5"
rayon = "1.8.0"

[[bin]]
name = "pfdm"
path = "src/pfdm.rs"

round #44

submitted at
2 likes

guesses
comments 0

post a comment


example ASCII text
1
2
814
2 1 3 7 6 9 + + * * * - /
numbers.lua ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
#!/usr/bin/env lua
--[[

  USAGE

  as a cli program:
    $ ./numbers.lua --help

  as a module:
    local numbers = require("numbers")

    numbers.solve(
      814, {2, 1, 3, 7, 6, 9, '+', '+', '*', '*', '-', '/'},
      function(msg) -- optional
         io.stderr:write(msg, '\n')
         io.stderr:flush()
      end,
      true -- equivalent to --hard in cli, optional
    ) -- returns 813, {9, 7, 2, '-', '*', 6, '*', 1, '+', 3, '*'}

--]]

local function eval(op, vals, strict)
	if type(op) == "number" then
		return {op, vals}
	else
		local a, b, o
		if not vals or not vals[2] then return end
		vals, a, b = vals[2][2], vals[2][1], vals[1]
		if strict and a < b then return end
		local commutable = false
		if op == '+' then
			o = a + b
			commutable = true
		elseif op == '-' then
			o = a - b
		elseif op == '*' then
			o = a * b
			commutable = true
		elseif op == '/' then
			o = a / b
		end
		o = (math.tointeger and math.tointeger(o)) or o
		if commutable and a < b then return end
		if strict and o % 1 ~= 0 then return end
		return {o, vals}
	end
end

local function copy(t, o)
	o = o or t
	for k, v in pairs(t) do
		o[k] = v
	end
	return o
end

local function flatten(stack)
	local reversed = {}
	while stack do
		table.insert(reversed, stack[1])
		stack = stack[2]
	end
	local out = {}
	for n = #reversed, 1, -1 do
		table.insert(out, reversed[n])
	end
	return out
end

local function stacklen(stack)
	local n = 0
	while stack do
		n = n + 1
		stack = stack[2]
	end
	return n
end

local function search(expr, vals, ops, write, strict)
	for op, count in pairs(ops) do
		local newvals = eval(op, vals, strict)
		if newvals then
			ops[op] = ops[op] - 1
			ops[op] = ops[op] > 0 and ops[op] or nil
			local newexpr = {op, expr}
			if not newvals[2] then
				write(newvals[1], newexpr)
			end
			search(newexpr, newvals, ops, write, strict)
			ops[op] = count
		end
	end
end

local function findmax(target, log)
	local maxdiff = math.huge
	local maxlen = math.huge
	local maxval = nil
	local maxexpr = nil
	return function(val, expr)
		local diff = math.abs(target - val)
		if diff <= maxdiff then
			local len = stacklen(expr)
			if diff < maxdiff or len <= maxlen then
				log(string.format(
					"... %s -> %s",
					table.concat(flatten(expr), " "), val))
				maxval, maxdiff, maxexpr, maxlen = val, diff, expr, len
			end
		end
	end, function()
		return maxval, flatten(maxexpr)
	end
end

local numbers = {}

function numbers.solve(target, oplist, log, hard)
	log = log or function() end
	local ops, write, maxfunc = {}, findmax(target, log)
	for _, op in pairs(oplist) do
		ops[op] = (ops[op] or 0) + 1
	end
	search(nil, nil, ops, write, not hard)
	return maxfunc()
end

do
	local ok, info = pcall(function()
		return debug.getinfo(5)
	end)
	if not ok or info then
		return numbers
	end
end

local usage = [[
Usage: numbers.lua [OPTION]... [FILE]
Solve a game of countdown.

With no FILE, or when FILE is -, read standard input.

  -q, --quiet, --silent    do not display intermediate results
  -h, --hard               allow fractions and negative numbers
      --help        display this help and exit

GNU coreutils online help: <https://www.gnu.org/software/coreutils/>
Full documentation <https://www.gnu.org/software/coreutils/numbers.lua>
or available locally via: info '(coreutils) numbers.lua invocation'
]]

local file = io.stdin
local istty = os.execute("tty >/dev/null")
istty = (type(istty) == "boolean" and {istty} or {istty == 0})[1]
local log = function(msg)
	io.stderr:write(msg, '\n')
	io.stderr:flush()
end
local hard = false

local options = {
	function(arg)
		if arg == "-" then
			file = io.stdin
		else
			file = assert(io.open(arg))
			istty = false
		end
	end,
	help = function()
		io.stdout:write(usage)
		os.exit(0)
	end,
	quiet = function()
		log = function() end
		istty = false
	end,
	hard = function()
		hard = true
	end,
}

local short_options = {
	q = options.quiet,
	h = options.hard,
}

local args = {...}
local args_done = false
for _, arg in ipairs(args) do
	if not args_done then
		if arg == "--" then
			args_done = true
		elseif string.sub(arg,1,2) == "--" and #arg>2 then
			assert(options[string.sub(arg,3)], "unknown option: " .. arg)()
		elseif string.sub(arg,1,1) == "-" and #arg>1 then
			string.gsub(string.sub(arg,2), '.', function(char)
				assert(short_options[char], "unknown option: -" .. char)()
			end)
		else
			options[1](arg)
		end
	else
		options[1](arg)
	end
end

local function test(target, ops, hard)
	local start = os.clock()
	local val, expr = numbers.solve(target, ops, log, hard)
	log(string.format("done in %.2fs", os.clock() - start))
	print(string.format("%s -> %s", table.concat(expr," "), val))
end

local function input(prompt)
	if istty then
		io.stderr:write(prompt .. "> ")
		io.stderr:flush()
	end
	return (assert(file:read(), "unexpected EOF"))
end

local function parse(str)
	local t = {}
	for v in string.gmatch(str, "%S+") do
		v = tonumber(v) or v
		table.insert(t, v)
	end
	return t
end

test(tonumber(input("target")), parse(input("ops")), hard)

round #42

submitted at
3 likes

guesses
comments 1
kimapr ยถ

updated versions available at gitlab and my website


post a comment


.gitignore ASCII text
1
2
/http.conf
/tmp
README.md ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
# 2048.php

An implementation of 2048 in PHP. Supports arbitrary board sizes.

## Web UI

**NOTE**: Unfinished.

Uses streamed HTML and CSS to create dynamic content without any client-side
JavaScript.

CGI. Communication between the main game process and control scripts (invoked
by form buttons targeting an invisible iframe) is done via UNIX domain datagram
sockets. Will not work on Windows, get a real operating system.

For convenience, a CLI script is provided that runs a pre-configured lighttpd
instance:

    ./server.php [address <port>]

## CLI

Simple CLI. Displays numbers on the board as base 2 logarithms in hexadecimal
(1=>2, 2=>4, b=>2048, etc.).

    ./cli.php [width [height [initial blocks]]]
cli.php ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
#!/usr/bin/php
<?php
include 'game.php';

class x1p11TextUI {
	private $game;
	private $board;
	private $ents;
	private $w, $h;
	private $lost;
	private $won;
	private $score;
	private const STATES = [
		" ",
		"new" => "!",
		"slide" => ":",
		"merge" => "+",
	];
	private function set($x, $y, $v = null, $new = 0) {
		$v = $v == null ? '.' : dechex(log($v, 2));
		$v = (object) ['v' => $v, 'new' => $new];
		$this->board[$y][$x] = $v;
	}
	private function expire() {
		for ($y = 0; $y < $this->h; $y++) {
			for ($x = 0; $x < $this->w; $x++) {
				$this->board[$y][$x]->new = false;
			}
		}
	}
	private function board_dump() {
		for ($y = 0; $y < $this->h; $y++) {
			echo ' ';
			for ($x = 0; $x < $this->w; $x++) {
				$v = $this->board[$y][$x];
				$v = $v->v . (self::STATES[$v->new]);
				echo $v;
			}
			echo "\n";
		}
	}
	public function __construct(x1p11 $game) {
		$this->game = $game;
		$this->board = [];
		$this->ents = [];
		$this->score = 0;
		[$this->w, $this->h] = $game->dimensions();
		for ($y = 0; $y < $this->h; $y++) {
			for ($x = 0; $x < $this->w; $x++) {
				$this->set($x, $y);
			}
		}
		/*
			// Debug
			$this->game->attach_handler(function ($type, $event) {
				/* //noise
					echo "Event: ";
					print_r($type->name);
					echo "\n";
					foreach ((array)$event as $k=>$v) {
						echo "	$k: ";
						print_r($v);
						echo "\n";
					}
					echo "\n";
				//* /
			});
			$deleting = [];
			$this->game->detach_handler($this->game->attach_handler(function ($type, $event) use (&$deleting) {
				if($type!=BoardEventType::Spawn){
					return;
				}
				$deleting[] = $event->pos;
			}));
			foreach ($deleting as [$x, $y]) {
				$this->game->set($x, $y);
			}
			foreach ([
				[4, 5, 6, 4],
				[1, 4, 2, 2],
				[2, 3, 0, 2],
				[0, 0, 0, 0],
			] as $y => $row) {
				foreach ($row as $x => $v) {
					$this->game->set($x, $y, $v>0?(2 ** $v):null);
				}
			}
		//*/
		$this->game->attach_handler($handler = function ($type, $event) use (&$handler) {
			switch ($type) {
			case BoardEventType::Slide:
				$ent = $this->ents[$event->id];
				[$x, $y] = $ent->pos;
				$this->set($x, $y);
				$ent->pos = $event->pos;
				[$x, $y] = $ent->pos;
				$this->set($x, $y, $ent->value, "slide");
				break;
			case BoardEventType::Merge:
				$src = $this->ents[$event->src];
				$dest = $this->ents[$event->dest];
				$handler(BoardEventType::Despawn, (object) [
					'id' => $event->src,
				]);
				$dest->value += $src->value;
				[$x, $y] = $dest->pos;
				$this->set($x, $y, $dest->value, "merge");
				break;
			case BoardEventType::Score:
				$this->score += $event->value;
				break;
			case BoardEventType::Spawn:
				$ent = (object) [
					'pos' => $event->pos,
					'value' => $event->value,
				];
				$this->ents[$event->id] = $ent;
				[$x, $y] = $ent->pos;
				$this->set($x, $y, $ent->value, "new");
				break;
			case BoardEventType::Despawn:
				$ent = $this->ents[$event->id];
				unset($this->ents[$event->id]);
				[$x, $y] = $ent->pos;
				$this->set($x, $y);
				break;
			case BoardEventType::Lose:
				$this->lost = true;
				if ($this->won) {
					echo "Game over.\n";
				} else {
					echo "You lost the game.\n";
				}
				break;
			case BoardEventType::Win:
				$this->won = true;
				echo "You won!\n";
				break;
			}
		});
		$cmds = [
			'w' => Direction::Up,
			's' => Direction::Down,
			'a' => Direction::Left,
			'd' => Direction::Right,
			'q' => false,
		];
		$this->expire();
		while (1) {
			$this->board_dump();
			echo "Score: {$this->score}\n";
			if ($this->lost) {
				break;
			}
			//var_dump($this->game);
			$cmd = "";
			while (!isset($cmds[$cmd])) {
				$cmd = readline('> ');
				if ($cmd === false) {
					break 2;
				}
				$cmd = strtolower($cmd);
			}
			$cmd = $cmds[$cmd];
			if (!$cmd) {
				break;
			}
			$this->expire();
			$this->game->move($cmd);
		}
	}
}

$w = 4;
$h = 4;
$c = 2;
if (isset($argv[1])) {$w = $argv[1];}
if (isset($argv[2])) {$h = $argv[2];}
if (isset($argv[3])) {$c = $argv[3];}
if (!(is_numeric($w) && is_numeric($h) && is_numeric($c))) {
	echo <<<Eof
	2048.php CLI. WASD to move.
	Numbers are displayed as base 2 logarithms in hex.
	Usage: 2048.php [width [height [initial blocks]]]

	Eof;
	return;
}

new x1p11TextUI(new x1p11($w, $h, $c));
game.php Unicode text, UTF-8 text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
<?php

enum Direction: int {
case Down = 0;
case Left = 1;
case Up = 2;
case Right = 3;
}

enum BoardEventType {
case Spawn;
case Slide;
case Merge;
case Despawn;

case Score;
case Win;
case Lose;
}

class x1p11 {
	private $dirs;
	private $board;
	private $w, $h;
	private $freeds;
	private $ents;
	private $won;
	private $lost;
	private $score;
	private $handlers;
	private function pos($x, $y) {
		return $this->w * $y + $x;
	}
	private function spawn(Callable $handler, ?int $c = 1) {
		$cands = [];
		for ($y = 0; $y < $this->h; $y++) {
			for ($x = 0; $x < $this->w; $x++) {
				if ($this->board[$this->pos($x, $y)] == -1) {
					$cands[] = [$x, $y];
				}
			}
		}
		$c = min(count($cands), $c);
		if ($c == 0) {
			return;
		}
		$ids = array_slice($this->freeds, count($this->freeds) - $c);
		$rands = array_rand($cands, $c);
		if ($c == 1) {
			$rands = [$rands];
		}
		foreach (array_map(function ($k) use (&$cands) {return $cands[$k];}, $rands) as $i => [$x, $y]) {
			$handler(BoardEventType::Spawn, (object) [
				'pos' => [$x, $y],
				'id' => $ids[$i],
				'value' => rand(1, 2) * 2,
			]);
		}
	}
	private function safeset($i, $v) {
		if ($this->board[$i] != -1) {
			$this->apply(BoardEventType::Despawn, (object) [
				'id' => $this->board[$i],
			]);
		}
		$this->board[$i] = $v;
	}
	private function apply(BoardEventType $type, object $event) {
		switch ($type) {
		case BoardEventType::Slide:
			$id = $event->id;
			$pos = $event->pos;

			$ent = $this->ents[$id];
			$this->safeset($this->pos(...$pos), $id);
			$this->board[$this->pos(...$ent->pos)] = -1;
			$ent->pos = $pos;
			break;

		case BoardEventType::Merge:
			$src = $event->src;
			$dest = $event->dest;

			$entsrc = $this->ents[$src];
			$entdest = $this->ents[$dest];
			$this->apply(BoardEventType::Despawn, (object) [
				'id' => $src,
			]);
			$entdest->value += $entsrc->value;
			break;

		case BoardEventType::Score:
			$score = $event->value;

			$this->score += $score;
			break;

		case BoardEventType::Despawn:
			$id = $event->id;

			$ent = $this->ents[$event->id];
			$this->freeds[$event->id] = $event->id;
			unset($this->ents[$event->id]);
			$this->board[$this->pos(...$ent->pos)] = -1;
			break;

		case BoardEventType::Spawn:
			$id = $event->id;
			$pos = $event->pos;
			$value = $event->value;

			unset($this->freeds[$id]);
			$this->safeset($this->pos(...$pos), $id);
			$this->ents[$id] = (object) [
				'pos' => $pos,
				'value' => $value,
			];
			break;

		case BoardEventType::Lose:
			$this->lost = true;
			break;

		case BoardEventType::Win:
			$this->won = true;
			break;
		}
	}
	private function _move(Callable $handler, Direction $dir, bool $check = true) {
		[$ox, $oy, $mc, $mb, $cdx, $cdy, $bdx, $bdy] = $this->dirs[$dir->value];
		$moved = false;
		for ($c = 0; $c < $mc; $c++) {
			[$x๐Ÿฅบ, $y๐Ÿฅบ] = [$ox, $oy];
			[$x๐Ÿ˜ˆ, $y๐Ÿ˜ˆ] = [$ox, $oy];
			for ([$b๐Ÿฅบ, $b๐Ÿ˜ˆ] = [0, 0]; $b๐Ÿฅบ < $mb - 1 && $b๐Ÿ˜ˆ < $mb;) {
				$id๐Ÿฅบ = $this->board[$this->pos($x๐Ÿฅบ, $y๐Ÿฅบ)];
				$val๐Ÿฅบ = $id๐Ÿฅบ != -1 ? $this->ents[$id๐Ÿฅบ]->value : null;
				$merges = $id๐Ÿฅบ == -1 ? 2 : 1;
				for (; $merges > 0;) {
					do {
						[$x๐Ÿ˜ˆ, $y๐Ÿ˜ˆ, $b๐Ÿ˜ˆ] = [$x๐Ÿ˜ˆ + $bdx, $y๐Ÿ˜ˆ + $bdy, $b๐Ÿ˜ˆ + 1];
					} while ($b๐Ÿ˜ˆ <= $b๐Ÿฅบ);
					if ($b๐Ÿ˜ˆ >= $mb) {
						break;
					}
					$id๐Ÿ˜ˆ = $this->board[$this->pos($x๐Ÿ˜ˆ, $y๐Ÿ˜ˆ)];
					$val๐Ÿ˜ˆ = $id๐Ÿ˜ˆ != -1 ? $this->ents[$id๐Ÿ˜ˆ]->value : null;
					if ($id๐Ÿ˜ˆ != -1) {
						$merges--;
						if ($id๐Ÿฅบ == -1) {
							$handler(BoardEventType::Slide, (object) [
								'id' => $id๐Ÿ˜ˆ,
								'pos' => [$x๐Ÿฅบ, $y๐Ÿฅบ],
								'lane' => $c,
							]);
							$val๐Ÿฅบ = $val๐Ÿ˜ˆ;
							$val๐Ÿ˜ˆ = null;
							$id๐Ÿฅบ = $id๐Ÿ˜ˆ;
							$id๐Ÿ˜ˆ = -1;
							$moved = true;
						} elseif ($val๐Ÿฅบ == $val๐Ÿ˜ˆ) {
							$handler(BoardEventType::Merge, (object) [
								'src' => $id๐Ÿ˜ˆ,
								'dest' => $id๐Ÿฅบ,
								'lane' => $c,
							]);
							$val๐Ÿฅบ = $val๐Ÿฅบ + $val๐Ÿ˜ˆ;
							$val๐Ÿ˜ˆ = null;
							$id๐Ÿฅบ = $id๐Ÿ˜ˆ;
							$id๐Ÿ˜ˆ = -1;
							$handler(BoardEventType::Score, (object) [
								'value' => $val๐Ÿฅบ,
							]);
							if ($check && !$this->won && $val๐Ÿฅบ >= 2048) {
								$handler(BoardEventType::Win, (object) []);
							}
							$moved = true;
						} else {
							[$x๐Ÿ˜ˆ, $y๐Ÿ˜ˆ, $b๐Ÿ˜ˆ] = [$x๐Ÿ˜ˆ - $bdx, $y๐Ÿ˜ˆ - $bdy, $b๐Ÿ˜ˆ - 1];
							break;
						}
					}
				}
				[$x๐Ÿฅบ, $y๐Ÿฅบ, $b๐Ÿฅบ] = [$x๐Ÿฅบ + $bdx, $y๐Ÿฅบ + $bdy, $b๐Ÿฅบ + 1];
			}
			[$ox, $oy] = [$ox + $cdx, $oy + $cdy];
		}
		if (!$check) {
			return $moved;
		}
		if ($moved) {
			$this->spawn($handler);
		}
		$lost = true;
		foreach (Direction::cases() as $cdir) {
			if ($cdir != $dir && $this->_move(fn() => null, $cdir, false)) {
				$lost = false;
				break;
			}
		}
		if ($lost) {
			$handler(BoardEventType::Lose, (object) []);
		}
	}
	private function handler(...$a) {
		$this->apply(...$a);
		foreach ($this->handlers as $f) {
			$f(...$a);
		}
	}

	public function __construct(?int $w = 4, ?int $h = null, ?int $c = 2) {
		$h = $h == null ? $w : $h;
		$this->board = [];
		$this->freeds = [];
		$this->ents = [];
		$this->handlers = new SplObjectStorage();
		$this->won = false;
		$this->lost = false;
		$this->score = 0;
		$id = 0;
		for ($i = 0; $i < $w * $h; $i++) {
			$this->board[] = -1;
			$this->freeds[$id] = $id;
			$id++;
		}
		array_reverse($this->freeds, true);
		[$mx, $my] = [$w - 1, $h - 1];
		$this->dirs = [
			[0, $my, $w, $h, 1, 0, 0, -1],
			[0, 0, $h, $w, 0, 1, 1, 0],
			[$mx, 0, $w, $h, -1, 0, 0, 1],
			[$mx, $my, $h, $w, 0, -1, -1, 0],
		];
		[$this->w, $this->h] = [$w, $h];
		$this->spawn([$this, 'apply'], $c);
	}
	public function dimensions() {
		return [$this->w, $this->h];
	}
	public function attach_handler(Callable $handler) {
		if (!is_object($handler)) {
			$handler = static function (...$a) use ($handler) {
				return $handler(...$a);
			};
		}
		$this->handlers->attach($handler);
		foreach ($this->ents as $id => $ent) {
			$handler(BoardEventType::Spawn, (object) [
				'id' => $id,
				'pos' => $ent->pos,
				'value' => $ent->value,
			]);
			if ($this->won) {
				$handler(BoardEventType::Win, (object) []);
			}
			if ($this->lost) {
				$handler(BoardEventType::Lose, (object) []);
			}
			$handler(BoardEventType::Score, (object) [
				'value' => $this->score,
			]);
		}
		return $handler;
	}
	public function detach_handler(Callable $handler) {
		$this->handlers->detach($handler);
	}
	public function move(Direction $dir) {
		$this->_move([$this, 'handler'], $dir);
	}
	public function get(int $x, int $y) {
		$pos = $this->pos($x, $y);
		$id = $this->board[$pos];
		if ($this->board[$id] == -1) {
			return null;
		}
		return $this->ents[$id]->value;
	}
	public function set(int $x, int $y, ?int $value = null) {
		$pos = $this->pos($x, $y);
		$id = $this->board[$pos];
		if ($id != -1) {
			$this->handler(BoardEventType::Despawn, (object) [
				'id' => $id,
			]);
		}
		if ($value != null) {
			[$id] = array_slice($this->freeds, count($this->freeds) - 1);
			$this->handler(BoardEventType::Spawn, (object) [
				'id' => $id,
				'pos' => [$x, $y],
				'value' => $value,
			]);
		}
	}
}
index.php ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
<?php
include 'game.php';
include 'webutil.php';

ignore_user_abort(true);
define("DIR", getenv("C2K48_TMP_PREFIX") ?: "./tmp/c2k48_");

// the handler never runs in practice but not having one makes the script
// terminate on connection abort. i have no idea why.
$alive = true;
pcntl_signal(SIGTERM, function () {
	global $alive;
	$alive = false;
	error_log("bai!");
});

$chunking = false;

class BlockAnims {
	private $stylist;
	private $stack;
	private $buf;
	private $name;
	private $ents;
	private $t;
	//private $loaded;
	private $game;
	private static function valcolor($v) {
		return [255, floor(max(200 - ((log($v, 2) / 11) ** 1) * 200, 0)), floor(max(120 - ((log($v, 2) / 11) ** 1) * 120, 0))];
	}
	public function __construct(StyleMutator $stylist, string $name, x1p11 $game, Callable $write) {
		[$w, $h] = $game->dimensions();
		$entc = $w * $h;
		$this->stack = [];
		$this->name = $name;
		//$this->loaded=false;
		$this->game = $game;
		$this->stylist = $stylist;
		for ($i = 0; $i < $entc; $i++) {
			$ent = (object) [];
			$elid = $name . dechex($i);
			$elem = "<div class=b id=$elid><div>";
			$ent->name = '#' . $elid;
			$ent->num = new CursedNumber($stylist, $elid . "n", appendf($elem), 5);
			$ent->vis = false;
			$ent->real = ['color' => [0, 0, 0], 'pos' => [0, 0], 'z' => 0, 'value' => 0];
			$ent->fake = $ent->real;
			$elem .= "</div></div>\n";
			$write($elem);
			$this->ents[] = $ent;
		}
		$this->draw(0);
		/*$game->attach_handler(function($type,$event){
				if($this->loaded){
					//$realm="slide";
					switch($type){
					case BoardEventType::Slide:
						$id=$event->id;
						$ent=$this->ents[$id];
						break;
					case BoardEventType::Merge:
						break;
					case BoardEventType::Despawn:
						throw new Exception("unimplemented");
						break;
					case BoardEventType::Spawn:
						//$realm="spawn";
						break;
					}
				}else{
				}
			});
		*/
	}
	private function update(float $dt) {
		if ($dt <= 0) {return;}
		if (count($this->stack) == 0) {return;}
		$this->t += $dt;
	}
	public function draw(float $dt) {
		//$this->update($dt);
		foreach ($this->ents as $id => $ent) {
			$ent->vis = false;
		}
		$this->game->detach_handler($this->game->attach_handler(function ($type, $event) {
			if ($type != BoardEventType::Spawn) {
				return;
			}
			$value = $event->value;
			$pos = $event->pos;
			$ent = $this->ents[$event->id];
			$ent->vis = true;
			$ent->real = ['color' => self::valcolor($value), 'pos' => $pos, 'z' => 0, 'value' => $value];
			$ent->fake = $ent->real;
		}));
		[$w, $h] = $this->game->dimensions();
		$stylist = $this->stylist;
		foreach ($this->ents as $id => $ent) {
			$stylist->set($ent->name, "display", $ent->vis ? 'flex' : 'none');
			$stylist->set($ent->name, "z-index", $ent->fake['z']);
			$stylist->set($ent->name, "justify-content", "center");
			$stylist->set($ent->name, "align-items", "center");
			$stylist->set($ent->name, "position", "absolute");
			$stylist->set($ent->name, "background-color", sprintf("#%02X%02X%02X", ...$ent->fake['color']));
			[$x, $y] = $ent->fake['pos'];
			$stylist->set($ent->name, "left", sprintf("%f%%", ($x / $w) * 100));
			$stylist->set($ent->name, "top", sprintf("%f%%", ($y / $w) * 100));
			$stylist->set($ent->name, "width", sprintf("%f%%", (1 / $w) * 100));
			$stylist->set($ent->name, "height", sprintf("%f%%", (1 / $h) * 100));
			$stylist->set($ent->name, "font-size", "2em");
			$ent->num->draw($ent->fake['value']);
		}
	}
	public function mstart() {
		$this->buf = [];
	}
	public function mend() {
		array_push($this->stack, array_values($this->buf));
	}
}

const MOVES = [
	'u' => Direction::Up,
	'd' => Direction::Down,
	'l' => Direction::Left,
	'r' => Direction::Right,
];

function game(&$quitf) {
	global $alive;
	$uid = bin2hex(random_bytes(8));
	$dir = DIR . hash("sha256", $uid);
	$socket = socket_create(AF_UNIX, SOCK_DGRAM, 0);
	socket_bind($socket, $dir);
	socket_set_nonblock($socket);
	$quitf = function () use (&$socket, &$dir) {
		socket_close($socket);
		unlink($dir);
	};
	chunk_start();
	$styles = "";
	$cons = "";
	$elems = "";
	$statusl = "";
	$stwrite = appendf($styles);
	$stylist = new StyleMutator(callf($stwrite));
	foreach ([
		["l", "&lt;", 1, 2],
		["d", "v", 2, 3],
		["u", "^", 2, 1],
		["r", "&gt;", 3, 2],
	] as [$cmd, $label, $x, $y]) {
		$cons .=
			"<form method=post action=act/$uid/$cmd id=cb$cmd name=cb$cmd target=out></form>" .
			"<div class=conbc id=cbd$cmd><button class=conb form=cb$cmd>$label</button></div>";
		$stylist->set("#cbd$cmd", "grid-row-start", $y);
		$stylist->set("#cbd$cmd", "grid-column-start", $x);
	}
	$statusl .= "<div>";
	$tlab = new CursedNumber($stylist, "tcc", appendf($statusl));
	$statusl .= " fps</div><div id=win>You won!</div><div>score: ";
	$scor = new CursedNumber($stylist, "scc", appendf($statusl));
	$tlab->draw(0);
	$scor->draw(0);
	$game = new x1p11(4, 4);
	$gamer = new BlockAnims($stylist, "gg", $game, appendf($elems));
	[$w, $h] = $game->dimensions();
	$statusl .= "</div>";
	unset($cmd, $label);
	$bvalc = 16;
	unset($i, $elem, $elid, $bval, $bvald, $elnc, $elnid);
	$stylist->set("#win", "display", "none");
	$stylist->set("#die", "display", "none");
	$stylist->present();
	$headch = <<<Eof
	<!DOCTYPE html>
	<head><meta name="viewport" content="width=device-width" /><title>2048.php</title></head>
	<style>
	body,html{width:100%;height:100%;margin:0;padding:0;font-size:min(1em,3vmin)}
	#cont{display:flex;width:100%;height:100%;flex-direction:row;}
	#bcont{flex-grow:1;padding:2em;display:flex;align-items:center;justify-content:center}
	.filler{flex-grow:1}
	#sidec{font-size:1.5em;flex-basis:min(13rem,50vmin);padding:1rem;border-left:solid 1px black;display:flex;flex-direction:column;}
	@media(max-aspect-ratio:1/1){
		#cont{flex-direction:column}
		#sidec{flex-direction:row;border-left:initial;border-top:solid 1px black}
	}
	#bcont2{container-name:bbox;container-type:size;width:100%;height:100%;display:flex;justify-content:center;align-items:center}
	#board{aspect-ratio:$w/$h;border:solid 1px black;position:relative}
	@container bbox (max-aspect-ratio:$w/$h) {#board{width:100%}}
	@container bbox not (max-aspect-ratio:$w/$h) {#board{height:100%}}
	#if{display:none}
	#con{display:grid;aspect-ratio:1;}
	.conbc{width:100%;height:100%;}
	.conb{font-size:1em;width:100%;height:100%}
	form{display:none}
	</style>
	$styles<iframe id=if name=out></iframe>
	<div id=cont>
	<div id=bcont><div id=bcont2><div id=board>
	$elems</div></div></div>
	<div id=sidec>
	<div id=status>$statusl</div>
	<div class=filler></div>
	<span id=die>Game over.</span><div id=con>
	$cons
	</div>
	</div>
	</div>

	Eof;
	unset($styles, $elems, $cons, $statusl);
	$stwrite = 'chunk';
	chunk($headch);
	$timer = new DTimer();
	$score = 0;
	$lost = false;
	$won = false;
	$game->attach_handler(function ($type, $event) use (&$lost, &$won, &$score) {
		switch ($type) {
		case BoardEventType::Score:
			$score += $event->value;
			break;
		case BoardEventType::Win:
			$won = true;
			break;
		case BoardEventType::Lose:
			$lost = true;
			break;
		}
	});
	$t = 0;
	$tt = (int) (1000_000 / 30);
	$hidden = false;
	$hidt = 1;
	$tod = 10;
	$ii = 2;
	while (1) {
		$dt = $timer->tick();
		$t += $dt;
		$hidt -= $dt;
		$tod -= $dt;
		if ($hidt <= 0) {
			$hidden = !$hidden;
			$hidt = 0.5;
		}
		//$stylist->set("#board","display",$hidden?"none":"block");
		//$stylist->set("#board", "width", ((sin($t) + 1) / 2 * 25) . 'em');
		//chunk("<!--".str_repeat("-",4096*1024)."-->"); // stress test
		$buf = '';
		while (socket_recv($socket, $buf, 65536, 0) != false) {
			if (MOVES[$buf]) {
				$game->move(MOVES[$buf]);
				if ($lost) {
					$stylist->set("#con", "display", "none");
					$stylist->set("#die", "display", "initial");
				}
				if ($won) {
					$stylist->set("#win", "display", "initial");
				}
			}
		}
		$tlab->draw(1 / $dt);
		$gamer->draw($dt);
		$scor->draw($score);
		$stylist->present();
		if (connection_aborted() || !$alive) {
			error_log("bye!");
			return;
		}
		if ($lost) {
			break;
		}
		usleep(floor(max($tt - $dt, 0)));
		//if(--$ii==0){ break; }
	}
	/*chunk(<<<Eof
		<meta http-equiv="refresh" content="0">

	*/
	chunk_end();
};
$path = explode('/', $_SERVER["REQUEST_URI"]);
$path = array_values(array_filter($path, function ($e) {
	return $e != '';
}));
$spath = implode('/', $path);
if ($spath == '') {
	echo <<<EOF
	<!DOCTYPE html>
	<head><title>2048</title></head>
	<h1>2048.php</h1>
	<p>An implementation of the popular puzzle game <a href="https://en.wikipedia.org/wiki/2048_(video_game)">2048</a>.</p>
	<p>As it relies heavily on progressive HTML rendering and advanced CSS features (e.g. <code>display: none</code>) it might not work in older web browsers.</p>
	<p><a href="play">Start game</a></p>
	EOF;
} else if ($spath == "play") {
	$quitf = function () {};
	try {
		game($quitf);
	} catch (\Throwable $e) {
		error_log($e);
	} finally {
		$quitf();
	}
} else {
	if ($path[0] == "play") {
		array_shift($path);
	}
	if ($path[0] != "act") {
		echo "404\n";
		return;
	}
	array_shift($path);
	if (count($path) < 2) {
		echo "bad\n";
		return;
	}
	$dir = DIR . hash("sha256", $path[0]);
	$socket = socket_create(AF_UNIX, SOCK_DGRAM, 0);
	socket_sendto($socket, $path[1], strlen($path[1]), 0, $dir);
}
server.php ASCII text
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
#!/usr/bin/php
<?php
chdir(dirname(realpath($argv[0])));
$cwd = getcwd();
$host = "127.0.0.1";
$port = "4444";
if (count($argv) == 3) {
	$host = $argv[1];
	$port = $argv[2];
} elseif (count($argv) != 1) {
	error_log("invalid argument");
	exit(1);
}
$f = fopen("http.conf", "w");
fwrite($f, <<<Eof
server.document-root = "$cwd"
server.bind = "$host"
server.port = $port
server.stream-response-body = 2
server.modules += ( "mod_cgi", "mod_rewrite" )
url.rewrite-once = ( "^/(.*)" => "/" )
cgi.assign = (".php" => "/usr/bin/php-cgi")
index-file.names = ( "index.php" )
Eof);
fclose($f);
mkdir("tmp");
$httpd = getenv("LIGHTTPD") ?: "/usr/sbin/lighttpd";
system("$httpd -D -f ./http.conf");
webutil.php Unicode text, UTF-8 text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
<?php

function chunk_start() {
	global $chunking;
	if ($chunking) {
		throw new Exception("already chunking");
	}

	$chunking = true;
	if (ob_get_level() == 0) {
		ob_start();
	}

	header("Content-type: text/html; charset=utf-8");
	header("X-Content-Type-Options: nosniff");
	header("Transfer-encoding: chunked");
}

function chunk($str) {
	global $chunking;
	if (!$chunking) {
		throw new Exception("not chunking");
	}

	printf("%s\r\n", dechex(strlen($str)));
	printf("%s\r\n", $str);
	ob_flush();
	flush();
	if ($str == '') {
		$chunking = false;
		ob_end_flush();
	}
}

function chunk_end() {
	chunk("");
}

class DTimer {
	private $last;
	public function __construct() {
		$this->last = 0;
		$this->tick();
	}
	public function tick() {
		$cur = hrtime(true);
		$dt = $cur - $this->last;
		$this->last = $cur;
		return $dt / 1000_000_000;
	}
}
function appendf(&$s) {return function ($a) use (&$s) {$s .= $a;};}
function callf(&$f) {return function (...$a) use (&$f) {return $f(...$a);};}

class StyleMutator {
	private $current;
	private $dirty;
	private $write;
	public function __construct(Callable $write, ?StyleMutator $from = null) {
		if (isset($from)) {
			$this->current =  &$from->current;
			$this->dirty =  &$from->dirty;
		} else {
			$this->current = [];
			$this->dirty = [];
		}
		$this->write = $write;
	}
	public function set($i, $k, $v) {
		$this->dirty[$k][$i] = $v;
		if (isset($this->current[$k][$i]) && $this->current[$k][$i] == $v) {
			unset($this->dirty[$k][$i]);
		}
	}
	public function present() {
		$str = "<style>%s</style>\n";
		$byval = [];
		foreach ($this->dirty as $k => $l) {
			foreach ($l as $i => $v) {
				$byval[$k . ":" . $v][] = $i;
			}
		}
		foreach ($byval as $v => $l) {
			$byval[$v] = sprintf("%s{%s}", implode(',', $l), $v);
		}
		($this->write)(sprintf($str, implode('', $byval)));
		foreach ($this->dirty as $k => $l) {
			foreach ($l as $i => $v) {
				$this->current[$k][$i] = $v;
			}
		}
		$this->dirty = [];
		return true;
	}
}

const SI_BIGGER = [
	['k', 1000 ** 1],
	['M', 1000 ** 2],
	['G', 1000 ** 3],
	['T', 1000 ** 4],
	['P', 1000 ** 5],
	['E', 1000 ** 6],
	['Z', 1000 ** 7],
	['Y', 1000 ** 8],
	['R', 1000 ** 9],
	['Q', 1000 ** 10],
];
const SI_SMALLER = [
	['m', 1000 ** -1],
	['ฮผ', 1000 ** -2],
	['n', 1000 ** -3],
	['p', 1000 ** -4],
	['a', 1000 ** -5],
	['z', 1000 ** -6],
	['y', 1000 ** -7],
	['r', 1000 ** -8],
	['q', 1000 ** -9],
];

function fnumfitweak($n, $m) {
	$dd = max($m - strlen(sprintf("%.0f", $n)) - 1, 0);
	$s = rtrim(sprintf("%.{$dd}f", $n), ".0");
	return $s == '' ? '0' : $s;
}

function fnumfit($n, $m) {
	$p = '';
	$s = fnumfitweak($n, $m);
	foreach (SI_SMALLER as [$vp, $vm]) {
		if (!($n > 0 && $s == 0)) {
			break;
		}
		$p = $vp;
		$s = fnumfitweak($n / $vm, $m - 1);
	}
	if ($p != '') {
		return [$s, $p];
	}
	foreach (SI_BIGGER as [$vp, $vm]) {
		if (strlen($s . $p) <= $m) {
			break;
		}
		$p = $vp;
		$s = fnumfitweak($n / $vm, $m - 1);
	}
	return [$s, $p];
}

class CursedNumber {
	private $stylist;
	private $maxlen;
	private $name;
	private const DIGITS = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, '.' => 's'];
	public function __construct( ? StyleMutator &$stylist = null, ?string $name = null,  ? Callable $write = null, int $maxlen = 5) {
		$this->stylist =  &$stylist;
		$this->maxlen = $maxlen;
		if (isset($stylist)) {
			if (!(isset($name) && isset($write))) {
				throw new Exception("invalid argument");
			}
			$this->name = $name;
			$str = "<span id=$name>";
			$state = "none";
			for ($i = 0; $i < $maxlen; $i++) {
				foreach (self::DIGITS as $v => $d) {
					$en = $this->elname('d', $i, $d);
					$str .= "<span id=$en>$v</span>";
					$this->stylist->set('#' . $en, "display", $state);
				}
			}
			foreach ([...SI_BIGGER, ...SI_SMALLER] as [$d, $v]) {
				$en = $this->elname('p', $d);
				$str .= "<span id=$en>$d</span>";
				$this->stylist->set('#' . $en, "display", $state);
			}
			$str .= "</span>";
			$write($str);
		}
	}
	private function elname($type, ...$l) {
		$name = $this->name;
		switch ($type) {
		case "d" :
			return "{$name}n{$l[0]}{$l[1]}";
		case "p" :
			return "{$name}p{$l[0]}";
		}
	}
	public function draw($n) {
		$n = fnumfit($n, $this->maxlen);
		for ($i = 0; $i < $this->maxlen; $i++) {
			foreach (self::DIGITS as $v => $d) {
				$en = $this->elname('d', $i, $d);
				$state = "none";
				if (isset($n[0][$i]) && $n[0][$i] == $v) {
					$state = "initial";
				}
				$this->stylist->set('#' . $en, "display", $state);
			}
		}
		foreach ([...SI_BIGGER, ...SI_SMALLER] as [$d, $v]) {
			$en = $this->elname('p', $d);
			$state = "none";
			if ($n[1] == $d) {
				$state = "initial";
			}
			$this->stylist->set('#' . $en, "display", $state);
		}
	}
}

round #41

submitted at
3 likes

guesses
comments 0

post a comment


false.js Unicode text, UTF-8 text, with very long lines (1509)
 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
<!----><!DOCTYPE html> <html> <head><meta  charset= utf-8></head >no  js :(<script>
eval(`(()=>{cc=[];eval(\`((Z,z,b)=>{C=(l,c)=>String.fromCodePoint(...[...Array(l)]\
.map#Uฬ™ฬ“ฬดฬจฬ™ฬ“ฬดฬพฬŠฬ‡ฬŒฬฝฬฬขฬกฬณVฬฬ•ฬฬดฬœฬฆฬฅฬฎฬ™ฬฒฬนฬฆฬœฬฆฬฝฬญฬฬถฬกฬกiฬœฬคฬฬฏฬ™ฬ†ฬ”ฬจฬ‹ฬขฬธฬฎฬŠฬ†ฬนฬฅฬฬฒฬฬ”ฬ™ฬ—ฬกฬดฬ‘hฬ–ฬนฬฃฬ›ฬถฬ‘ฬฅฬœฬขฬ ฬฉฬŠฬ’ฬนฬฅฬ›ฬฆฬฬฏฬ™ฬ†ฬ”ฬจฬœAฬฒฬคฬฉฬ‹ฬ†ฬ”ฬจฬœฬฒฬคฬฉฬŠฬ’ฬคฬจฬ™ฬ’ฬคฬปฬ‚ฬฆฬฬฝฬŠ6ฬ†ฬฬฝฬฬขฬกฬณฬฬ“ฬธฬจฬœฬณฬดฬจฬ›ฬฆฬ•ฬทฬˆฬ…ฬ‘Kฬฅฬžฬ‡ฬ‘ฬ„ฬ™ฬ–ฬฬฏฬ™ฬ†ฬ•ฬฒฬŠฬ‚ฬคฬฉฬ‹ฬฆฬ‘jฬฅฬ˜ฬถฬฝฬคฬ™ฬ’ฬกฬฎฬ™ฬ—ฬœฬ ฬ•ฬ–ฬฅฬฎฬฬƒcฬกฬฬœฬงฬ‰ฬกฬžฬ’ฬกฬ›ฬ‹ฬขฬธฬฎYฬ™ฬ‚ฬกฬณฬŠฬ•ฬดฬฎฬ›ฬ–ฬ…ฬฐฬŠฬ†ฬŒHฬฝฬฬฆฬŒฬฎฬ˜ฬถฬกฬกฬœฬคฬฬฏฬ™ฬ†ฬ•ฬฬฬ‚ฬ 5ฬฐฬŠฬ’ฬคฬฉฬŠฬ’ฬฑฬณฬŠฬ’ฬคฬฉฬŠฬ†ฬฬฉฬŽฬฐฬจอ€Qอ‚ฬ‘ฬคฬ…ฬŒฬ”ฬดฬ”ฬฝฬŠฬ‚ฬกฬฐฬ‹ฬ†ฬดฬฉฬ8ฬ“ฬนฬปฬœฬƒฬตฬปฬŸฬ“ฬญฬญฬฬ—ฬญฬฝฬŽฬฐEฬฉฬฐฬ‹ฬฆฬกฬฅฬ˜ฬ–ฬ‘ฬฅฬœฬฃฬตฬ›ฬ˜ฬ‚ฬกฬกฬœฬทฬฅฬฎฬ˜ฬฒฬฬฆXฬฬ–ฬนฬฃฬฬ†ฬฅฬฏฬ›ฬขฬกฬฉฬ›ฬฒฬฑฬคฬ‹6ฬ‡ฬ˜ฬฉฬžฬถฬฬฝฬ–ฬตฬดฬปฬฬฃฬตฬ›ฬ‹ฬข9ฬธฬฎฬฬ—ฬ‰ฬฒฬ˜ฬ—ฬคฬจฬŒฬฃฬ˜ฬฉฬ—ฬ’ฬนbฬญฬ˜ฬ—ฬ€ฬจฬ—ฬณฬดฬพฬ”ฬทฬฅฬญฬ˜ฬฆฬฝฬฌฬŠoฬ‚ฬคฬฉฬŽฬตฬฐฬŠฬ‹ฬฒฬฉฬคฬ‹ฬงmฬฬฏฬœฬƒฬดฬจฬœฬ†ฬฝฬฐฬฬ“ฬธฬจฬ—ฬณฬดฬพฬžฬถฬฅฬฆฬŠฬ†ฬEฬฎฬ›ฬ†ฬ•ฬฎฬ™ฬทฬ‘ฬจฬฬ“ฬดฬฐฬŠฬ—ฬ‘ฬจฬœฬฆฬฝฬทnฬˆฬ‚ฬฬณฬฬ†ฬ…ฬฃฬšฬฒฬฬตฬ›ฬฆฬ‘ฬฅฬœlฬฆฬ™ฬฌฬ›ฬทฬœฬงฬŽฬทฬ‰ฬฅฬฬ‡ฬ•ฬฒฬ›ฬขDฬฬฐฬ›ฬทฬ€ฬฎฬ˜ฬ—ฬฬฐฬ›ฬ‡ฬคฬจฬ™ฬ‚ฬฅฬฝฬŠฬ’ฬคNฬจฬ™ฬ‚ฬนฬฐฬ›ฬทฬ€ฬฉฬŽฬฒฬจฬฏฬ—ฬ€ฬฉฬคPฬ‹ฬฅฬฝฬฐฬ›ฬทฬ€ฬฝฬ™ฬ‚ฬนฬฐฬ›ฬทฬ€ฬปฬ™ฬ‚ฬนฬฐฬ›ฬทUฬ€ฬฝฬ™ฬงฬ•ฬฎฬ˜ฬทฬ‘ฬฉฬ›ฬถฬธฬจEฬŠฬ—ฬญฬฉฬ™ฬขฬกฬดฬšฬ†ฬฅฬณฬ‹ฬฆฬฑฬฅฬ›ฬฆฬฬดฬšฬƒCฬดฬฝฬŒฬ‚ฬฅฬดฬšฬ‡ฬ‰ฬฏฬฬฒฬ€ฬงฬœฬทฬ‘ฬกkฬ˜ฬถฬฌฬ ฬฬ–ฬนฬคฬ™ฬ—ฬ‰ฬฆฬ›ฬ†ฬฝฬทฬ‰ฬณ4ฬญฬฒฬ™ฬ—ฬ‘ฬตฬœฬฆฬธฬ ฬฬ†ฬกฬฉฬœฬฒฬนฬŸฬœฬ†ฬฝIฬฐฬŠฬ‚ฬฅฬฝฬŽฬตฬฐฬŠฬ™ฬ‚ฬนฬฐฬฬ—ฬ‘ฬฃฬฬ•ฬผฬฝฬฬขฬ ฬจฬ‰ฬทTฬฬฒฬšฬ—ฬ‘ฬฅฬ‰ฬฒฬฬฉฬ›ฬขฬฬฉฬ›ฬฒฬคฬฆฬ‰lฬฆฬฅฬฏฬ‹ฬงฬฬฒฬšฬ—ฬ‘ฬฅฬŠฬ…ฬdฬดฬœฬฆฬฅฬฎฬ™ฬฒฬนฬฆฬœฬฆฬฝฬญฬฬถฬฝฬคฬ™ฬ•uฬฬฏฬšฬ–ฬนฬดฬŠฬ†ฬฬฎฬœฬ†ฬฝฬฐ+ฬŠฬ‚ฬคฬฉฬŠฬ’ฬคฬปฬ—ฬ€ฬฉฬคฬ‹ฬงฬฬตฬฬ†ฬธฬฝฬ—ฬณฬดฬพฬŠฬ‚ฬ ฬงฬฬทlฬ‰ฬฉฬฬ†ฬ”ฬงฬˆฬ†ฬฅฬฎฬˆฬ†ฬฅฬฏฬŠฬ’ฬ˜pฬฆฬšฬ–ฬผฬฎฬฬทฬ‰ฬฉฬฬ†ฬ”ฬจฬ™ฬ‚ฬนฬฐฬ›ฬทฬ€ฬจmฬŠฬ’ฬฌฬงฬ‰ฬฒฬคฬฉฬŽฬตฬฐฬŠbฬ™ฬ‚ฬนฬคฬฬ—ฬ€ฬฝฬ—ฬณฬดฬพฬžฬตฬผฬฝฬ™ฬ‚ฬนฬฐฬ›ฬทฬ€ฬจฬŠฬ“ฬญฬคBฬ‹ฬงฬฬตฬœฬถฬ ฬจฬ—ฬฒฬฑฬŸฬŠฬ—ฬดฬปฬ—ฬ€ฬฉฬคฬ‹ฬฆฬ‘1ฬฒฬ›ฬทฬ€ฬฝฬ—ฬณฬดฬพฬžฬถฬฬฎฬœฬ†TฬฝฬฐฬŠฬ‚ฬฅฬฝฬŽฬตฬฐฬŠฬ™ฬ‚Dฬนฬณฬฬถฬ…ฬฐฬฬ•ฬผฬฝฬฬงฬญฬคฬ‹ฬงฬฬตฬœฬถฬ xฬจฬ‹ฬขฬธฬฎฬ™ฬ‚ฬนฬณฬœฬ†ฬฑฬฉฬ˜ฬถฬ”ฬจฬ‹ฬ“ฬˆฬฉฬ‹ฬงฬ‰ฬฅฬฬฆฬ•ฬฒฬœiฬถฬ”ฬจฬŠฬ’ฬฅฬฝฬŽฬตฬฐฬŠฬ™ฬ‚ฬนฬฒฬ›ฬทฬฬฝฬ—ฬณฬดฬพฬžฬตฬผ5ฬฝฬ™ฬ‚ฬนฬณฬœฬ†ฬฑฬฉฬ˜Nฬถฬ”ฬจฬ‹ฬ“ฬŒฬฉฬŽฬตฬผ5ฬฎฬœฬ‡ฬ•ฬณฬšฬ‚ฬกฬŸฬ‹ฬงฬฬจฬšฬ–ฬ™ฬดZฬŠฬ‚ฬคฬฉฬŽฬถฬฬฎฬœฬ‡ฬ•ฬณฬšฬ‚ฬ ฬฎฬ‹ฬขฬนฬŸGฬŠฬ—ฬดฬปฬ—ฬ€ฬฉฬคฬ‹ฬงฬฬฉฬ˜ฬถ8ฬฌฬฝฬ—ฬณฬดฬพฬžฬตฬผฬฝฬ™ฬ‚ฬนฬฐฬ›ฬทฬ€ฬจฬŠLฬ“ฬญฬคฬ‹ฬงฬฬตฬœฬถฬ ฬจฬ™ฬ…ฬญฬคฬ‹ฬฆฬฑฬฅฬ›ฬฆฬฬดฬš6ฬ‚ฬดฬฑฬ‹ฬ•ฬฝฬฬŠฬ—ฬดฬปฬ˜ฬ‚ฬฐฬŠฬ–ฬตฬฌฬงJฬ˜ฬ–ฬ‘ฬคฬ‰ฬฒฬฐฬฌฬ‰ฬฒฬฌฬงฬ—ฬ’ฬฑฬ›ฬ‰ฬทฬฬต/ฬ˜ฬขฬœฬฌฬ‹ฬ‚ฬœฬญฬ‰ฬตฬดฬฌฬ–ฬฒฬฬญฬฬ–ฬฐฬงPฬ‹ฬ‚ฬฐฬงฬŠฬขฬฬฬ‹ฬ…ฬฌฬงฬ™ฬ†ฬฅฬถฬ‰ฬฒฬฐฬฌฬ‰ฬฒฬผฬงฬ—ฬ’Oฬฑฬ›ฬ‰ฬถฬ‰ฬกฬ›ฬฆฬฬงฬ‹ฬ‚ฬฐฬงฬ‰ฬขuฬฬฬ‹ฬ…ฬฌฬงฬ˜ฬฆฬฝฬฒฬ‰ฬฒฬฐฬฌฬ‰ฬทฬฐฬงฬ—ฬ’ฬฑPฬ›ฬ‰ฬถฬฬฒฬ‰ฬฒฬฐฬงฬ‹ฬ’ฬ„ฬกฬ‰ฬฒEฬฐฬงฬฬขฬฬฬ‹ฬ…ฬฌฬงฬ™ฬ—ฬ„ฬงฬ‹ฬ‚ฬœฬญฬˆฬ’Jฬ„ฬงฬ‹ฬ‚ฬœฬฝฬฬ’ฬฬฬ—ฬฬจฬฎฬ›ฬ–ฬ…ฬฐlฬŠฬ‚ฬกฬ›ฬ›ฬขฬฑฬฐฬ‹ฬ†ฬฝ8ฬฬŠฬ“ฬดฬพฬ˜ฬ†ฬฬฎฬ‰ฬ‡ฬญฬฎฬŸฬ“ฬดฬจฬ˜ฬ’ฬฑฬขjฬŠฬ“ฬดฬพฬžฬตฬญฬกฬ‹ฬ†ฬ‰ฬฬฬ–ฬฬฎฬœฬทฬhฬฌฬšฬ–ฬฬฅฬŠฬ‚ฬดฬฒฬŠฬ“ฬญฬคฬ‹ฬงฬฬตฬœyฬถฬ ฬจฬŠฬ‚ฬ‘ฬปฬœฬƒฬผฬฟฬ‰ฬฒฬฬฝฬŠฬ†ฬ„ฬคMฬžฬถฬฝฬฝฬ˜ฬขฬคฬฉฬฬƒฬฐฬฐฬŠฬ—ฬดฬปฬ˜ฬ‚oฬคฬฎฬšฬฆฬฝฬฉฬ›ฬขฬ ฬงฬ‰ฬฒฬคฬฌฬ‚ฬฅkฬญฬ›ฬ‰ฬถฬนฬฅฬ™ฬฒฬœฬฌฬ‰ฬฒฬด5ฬงฬ—ฬ’ฬฑฬ›ฬ‰ฬถฬนฬฏฬฬ‚ฬœฬฌฬ‰ฬท#((_\
,i)=#Zฬธฬงฬ—ฬ•ฬดฬฎฬ›ฬ–ฬ…ฬฐฬŠฬ‚iฬกฬ›ฬ›ฬขฬฑฬฏฬ—ฬ’ฬคฬฝฬฬฆฬฬคฬ‹ฬขQฬ‘ฬปฬ›ฬงฬดฬฝฬ˜ฬ“ฬดฬพ5ฬžฬถฬฬฎฬœฬ‡ฬ•ฬณฬšฬ‚ฬ ฬจฬ‰ฬ‡ฬญฬฏฬŸฬ–mฬฬฎฬœฬ†ฬฝฬฐฬŠฬ‚ฬคฬฉฬฬƒฬฐฬฐฬŠฬ—ฬดฬปฬ˜ฬ‚ฬคฬฎwฬšฬฆฬฝฬฉฬ›ฬขฬ ฬงฬ‰ฬฒฬฅฬฬ‹ฬฆฬฉฬฏฬšฬ–ฬธฬจฬ‰dฬฒฬœฬฉฬŽฬฐฬฉฬฐฬ‹ฬฆฬฬจฬ˜ฬ—ฬ‰eฬณฬฬ—ฬฌฬฎฬ‹ฬขฬธฬจฬŠฬ†ฬ„ฬฌฬ›ฬฒฬคBฬฝฬฬขฬกฬฏฬฬ—ฬญฬฝฬ‹ฬ†ฬ„ฬฎฬ›ฬ–ฬ…ฬฐฬŠฬ‚ฬกฬ›1ฬšฬฒฬฑฬถฬ—ฬ’ฬคฬฝฬฬขฬ ฬจฬšฬฒฬฌฬงฬ‰ฬณฬดฬฝฬฬ–ฬฌฬฉฬTฬตฬญฬซฬ—ฬ“ฬฉฬซฬŠฬ’ฬนฬญฬ˜ฬ—ฬ€ฬจฬšzฬณฬดฬพฬŠฬ†ฬฝฬ›ฬšฬตฬดฬฝฬŠฬ‡ฬ˜ฬซฬ‰ฬฒฬœฬฝฬฬ“TฬตฬถฬŠฬ“ฬผฬจฬœฬณฬดฬพฬœฬฒฬนฬฎฬœฬ‚ฬ ฬฉฬŠฬทฬ˜ฬฉฬŽฬงฬ˜ฬฉฬŠฬ’ฬคxฬฌฬ›ฬฒฬคฬฉฬŠฬ…ฬฌฬŠฬ–ฬฒฬœฬคฬ‰ฬฒฬฐฬงฬ™ฬ‚Tฬนฬคฬฬ—ฬ€ฬจฬŠฬ“ฬฌฬงฬ—ฬ’ฬฑFฬ›ฬ‰ฬฒฬ”ฬงฬ‹ฬ‚ฬฬคฬ‹ฬฆฬ‘ฬฒฬ›ฬทฬ€ฬจฬŠฬ“ฬฌฬงฬ—ฬ’Aฬฑฬ›ฬ‰ฬตฬฑฬœฬ‰ฬฒฬฐฬงฬ™ฬ‚ฬนฬณฬฬถฬ…ฬฐฬŠฬ‚ฬคฬปฬ‰ฬตIฬดฬฌฬ–ฬฒฬฬ€ฬ‰ฬฒฬฐฬงฬ™ฬ‚ฬนฬฒฬ›ฬทฬฬจฬŠฬ“ฬฌฬงฬ—2ฬ’ฬฑฬ›ฬ–ฬฒฬฬฬ‰ฬฒฬฐฬงฬฐฬปฬ ฬงฬ—Zฬ’ฬฐฬงฬ™ฬ‚ฬนฬฐฬšฬ–ฬฬซฬŠฬ‚ฬคฬปฬ‰ฬตฬดฬฌฬ‚ฬฅฬฌkฬงฬŠฬฒฬœฬฌฬ‰ฬถฬฬฎฬ˜ฬ–ฬ‘ฬคฬŠoฬ‚ฬคฬปฬ‰ฬตฬดฬฌฬ–ฬฒฬœฬญฬ‰Uฬฒฬฐฬงฬ™ฬ‚ฬนฬณฬฬ–ฬˆฬจฬŠฬ“ฬฌฬงฬ—ฬ’ฬฑฬ›xฬ‰ฬฒฬจฬงฬ‹ฬ‚ฬฬคฬ‹ฬฆฬตฬตฬ›ฬ‚ฬ =ฬฉฬŽฬฒฬฬฬ‹ฬ…ฬฌฬงฬ‹ฬฒฬœฬฌฬ‰ฬถฬฬฎฬ™ฬ†FฬฅฬถฬŠฬ‚ฬคฬปฬ‰ฬตฬดฬฌฬ–ฬฒฬฬŸrฬ‰ฬฒฬฐฬงฬ™ฬ‚ฬนฬฎฬ™ฬ–ฬœฬจฬŠฬ“ฬฌฬงฬ—ฬ’ฬฐฬŠLฬ–ฬฒฬœฬฆฬ‰ฬฒฬฐฬงฬ™ฬ‚ฬนฬขฬ˜ฬ–ฬนฬคฬŠฬ‚ฬคฬปฬ‰ฬตฬดฬฌ1ฬ–ฬฒฬฬผฬ‰ฬฒฬฐฬงฬ™ฬ‚ฬนฬขฬ›ฬทฬˆฬจฬŠฬ“0ฬฌฬงฬ—ฬ’ฬฑฬ›ฬ‰ฬณฬธฬงฬ‹ฬ‚ฬฬคฬ‹ฬฆฬฬฒฬŠฬ‚ฬคฬปฬ‰ฬต9ฬดฬฌฬ–ฬฒฬœฬฝฬ‰ฬฒฬฐฬงฬ™ฬ‚ฬนฬฅฬœIฬ’ฬ ฬฉฬŽฬฒฬฬฬ‹ฬ…ฬฌฬงฬŸฬขฬœฬฌฬ‰ฬถoฬฬฎฬ›ฬฆฬฝฬดฬŠฬ‚ฬคฬปฬ‰ฬตฬดฬฌzฬ‚ฬขฬผฬฏฬ–ฬฒฬฬปฬ‰ฬฒฬฐฬงฬ‹ฬฒฬจฬงฬ—ฬ’ฬฑฬ›ฬ‰ฬทฬดฬงฬ‹tฬ‚ฬœฬชฬ‹ฬฒฬฬฬ‹ฬ€ฬฉฬ›ฬ‰ฬทฬฌฬงฬ‹ฬ‚ฬกฬณฬ‹Sฬ†ฬผฬฉฬฬ“ฬธฬจฬ›ฬณฬตฬณฬ‹ฬฆฬนฬฐฬŠฬ‚ฬคฬฌZฬœฬฒฬนฬฃฬ›ฬขฬ ฬงฬŸฬ’ฬœฬฉฬ‹ฬ†ฬผฬฉฬ—ฬ’ฬฐฬŠbฬ–ฬฒฬฬ›ฬ‰ฬฒฬฐฬงฬ™ฬ‚ฬนฬฐฬฬ—ฬฬจฬŠฬ†ฬ…ฬณฬžฬ–GฬนฬฃฬŠฬ‚ฬคฬฝฬฬงฬฌฬงฬ—ฬ’ฬฑฬ›ฬ‰ฬตฬดฬงฬ‹ฬ‚ฬฬฝEฬŠฬ“ฬฌฬงฬ—ฬ’ฬฐฬŠฬ–ฬฒฬœฬกฬ‰ฬฒฬฐฬงฬ˜ฬ—ฬฬกฬšฬ—ฬNฬจฬ™ฬ‚ฬนฬฐฬ›ฬทฬ€ฬจฬŠฬ’ฬ ฬฉฬŠฬ“ฬฌฬงฬ—ฬ’6ฬฑฬ›ฬ‰ฬณฬผฬงฬ‹ฬ‚ฬฬคฬ‹ฬงฬฬทฬ˜ฬ—ฬ€ฬจฬŠฬ“dฬญฬฉฬ™ฬขฬกฬคฬ‹ฬงฬฬฏฬœฬ‚ฬ ฬฉฬŠฬ–ฬ…ฬท1ฬ˜ฬ–ฬฅฬดฬˆฬ†ฬฬฎฬœฬ†ฬฝฬฐฬŠฬ‚nฬคฬจฬŠฬ“ฬญฬฅฬ›ฬ‡ฬฬฅฬˆฬ†ฬฬฎฬœฬ†ฬฝฬฐQฬŠฬ‚ฬคฬปฬ‰ฬตฬดฬฌฬ‚ฬฅฬฌฬงฬˆฬฒฬœฬฌฬ‰ฬถฬ…ฬทฬ˜ฬ–ฬฅ5ฬดฬŠฬ‚ฬกฬกฬœฬทฬฅฬฎฬ˜ฬฒฬกฬ›ฬ˜ฬฒ0ฬฑฬฆฬ—ฬ’ฬคฬฝฬฬงฬญฬทฬšฬ†ฬฅฬฌฬ™ฬ’ฬกฬกฬฬถฬ…ฬฉฬฬ‚ฬฬฃmฬŠฬ‚ฬคฬฌฬ™ฬ‚ฬนฬฐฬ›ฬทฬ€ฬจฬŠฬ’ฬฅฬกyฬฬถฬ…ฬฉฬฬ‚ฬฬฆฬŠฬ‚ฬฅฬฝฬŠฬ’ฬคฬจฬ™ฬ‚ฬนฬณฬœฬ†ฬฑฬฉฬ˜ฬถฬ”0ฬจฬ‹ฬ“ฬˆฬฉฬŠฬ“ฬฌฬงฬ—ฬ’ฬฐฬŠฬ‹ฬขWฬธฬฎฬ–ฬฒฬธฬฎฬ‹ฬคฬŒฬจฬŒฬฃฬ˜ฬฌฬŽฬ“ฬœฬฉฬ—2ฬ’ฬนฬญฬ˜ฬ—ฬ€ฬจฬŠฬ†ฬŒฬฌฬšฬ’ฬคฬฝฬฬฅฬญฬฃฬ‹ฬ†dฬฬคฬ‹ฬงฬฬตฬœฬถฬ ฬจฬฬฅฬฌฬคฬžฬถฬฅฬฝฬ—ฬ’ฬคฬปฬ˜ฬ…hฬดฬฉฬ‹ฬ€ฬฉฬ›ฬ–ฬฒฬธฬฎฬ‹ฬฅฬฬดฬœฬฆฬฅ=ฬฎฬ™ฬฒฬนฬฆฬœฬฆฬฝฬญฬฬถฬกฬกฬœฬคฬฬฏฬ™ฬ†ฬ”ฬจฬ‹ฬขฬธฬฎYฬ–ฬฒฬธฬฎฬ‹ฬคฬ…ฬฒฬœฬฆฬ…ฬนฬŠฬƒฬˆฬตฬฬ’ฬฅฬฬ‹ฬฆzฬตฬกฬœฬ‚ฬ ฬจฬ—ฬฒฬฑฬฉฬŠฬ“ฬดฬพฬš7ฬ’ฬคฬฉฬ‹ฬงฬ‰ฬฅฬœฬ†ฬฑฬกฬ˜ฬถฬ”ฬจฬ‹ฬตฬญฬœฬ”ฬตฬดฬฏฬ™vฬฒฬฐฬงฬ‰ฬฒฬฅฬฬ‹ฬ‚ฬœฬงฬ—ฬ’ฬฐฬŠฬ‹ฬขฬธฬฎฬ–ฬฒฬธฬฎฬ‹ฬคฬŒfฬจฬŒฬ“ฬ€ฬฌฬฬƒฬ ฬฉฬ—ฬ’ฬนฬญฬ˜ฬ—wฬ€ฬจฬŠฬ†ฬŒฬฌฬšฬ’ฬคฬฝZฬฬฅฬญฬฃฬ‹ฬ‡ฬŒฬฝฬฬงฬญฬฉฬ™ฬขฬกฬณฬ‹ฬฆฬนCฬตฬ›ฬ“ฬดฬฝฬ›ฬงฬ•ฬฌฬ›ฬ‚ฬฅฬณVฬ‹ฬฆฬนฬตฬ›ฬ“ฬดฬฐฬŽฬทฬŒฬฎฬ›ฬงฬ•ฬญฬฬ—ฬŒฬฎฬ›Dฬงฬ•ฬญฬŠฬฃฬ„ฬฐฬŠฬถฬฅฬฝฬ—ฬ’ฬคฬฌฬ‚ฬฅฬฌฬงฬŽฬขฬœฬฌฬ‰ฬถฬ‘ฬ›ฬ™nฬ‚ฬนฬฐฬ›ฬทฬ€ฬจฬŠฬ•ฬดฬฝฬ™ฬ‚ฬนฬฐฬ›ฬทฬ€ฬจฬŠฬ“ฬฌRฬงฬ—ฬ’ฬฐฬŠฬ–ฬฒฬœฬปฬ‰ฬฒฬฐฬง8ฬ™ฬ‚ฬนฬฐฬฬ—ฬฬจฬŠฬ†ฬ‘ฬ›ฬ™qฬ‚ฬนฬฐฬ›ฬทฬ€ฬจฬŠฬ•ฬดฬฉฬŽฬฒฬฬฬ‹ฬ€ฬฉฬ›ฬ‰ฬถฬ€ฬงOฬ‹ฬ‚ฬฬดฬšฬ‡ฬ‰ฬฏฬฬฒฬ‰ฬต7ฬ›ฬฆฬฅฬญฬœฬ†ฬฑฬฅฬ›ฬ–ฬ•ฬฎฬฬ†ฬ•ฬคฬˆ/ฬฃฬฌฬงฬ—ฬ’ฬฐฬŠฬ–ฬฒฬˆฬงฬˆฬขฬฐฬจฬœฬฒฬฑฬถฬŠฬ“#>i+\
c));#Gฬดฬพฬžฬทฬ˜ฬฝฬœฬฒฬนฬฎฬ™ฬ—ฬกฬดฬŠฬ‚ฬคฬปฬšฬ–ฬ˜ฬจฬฬขฬนฬคฬ›ฬถฬนbฬฅฬŠฬ—ฬ‘ฬจฬœฬฆฬฝฬทฬ‰ฬทฬ•ฬฎฬ™ฬ—ฬกฬฐฬ™ฬ–ฬOฬดฬ™ฬ–ฬฬ ฬ‘ฬ”ฬฝฬ†ฬ‰ฬณฬญฬฒฬ™ฬ—ฬ‘ฬตฬœฬฆuฬธฬ ฬœฬฒฬนฬฎฬœฬ‚ฬ ฬฉฬŠฬถฬฬคฬ‹ฬงฬฬตฬœhฬถฬ ฬจฬ‰ฬ‡ฬญฬถฬ‹ฬงฬ™ฬกฬ›ฬ‡ฬ•ฬฅฬ‹ฬฆฬฬฏฬ™                                                               gฬ†ฬ•ฬฬ›ฬถฬฅฬฎฬฬ„ฬ…ฬดฬŠฬ‚vฬฅฬฝฬŠฬ“ฬญฬ ฬŸฬ•ฬดฬฌฬ‚ฬฅฬฌฬงฬ—Uฬขฬœฬฌฬ‰ฬถฬฬฎฬœฬ‡ฬ•ฬณฬšฬ‚ฬ ฬจฬ—ฬ‚ฬTฬฒฬ™ฬ–ฬ…ฬคฬ—ฬ‚ฬฬฉฬ›ฬขฬฬฉฬ›ฬฒฬคฬฟฬŠZฬ†ฬ…ฬทฬ˜ฬ–ฬฅฬดฬˆฬ†ฬฅฬฏฬ‹ฬงฬ‰ฬฅฬ˜ฬ–ฬฬจฬŠฬ’ฬคฬบฬ‹ฬ“ฬ„#B=[\
...[#oฬฉฬŽฬฒฬฬฬ‹ฬ€ฬฉฬ›ฬ‰ฬฒฬธฬงฬ‹ฬ‚ฬ‰ฬกฬฬถ4ฬ…ฬฉฬฬ‚ฬฬคฬ‹ฬงฬฬตฬฬ†ฬธฬจฬŠฬ“Iฬฌฬขฬ—ฬ’ฬฐฬŠฬ–ฬฒฬœฬฌฬ‰ฬฒฬฐฬงฬ˜ฬ—ฬฬกฬšVฬ—ฬฬ ฬ™ฬ‚ฬนฬฐฬฬ—ฬ‘ฬฃฬŠฬ‚ฬคฬปฬ‰ฬตฬดฬฌฬ‚ฬฅฬฌฬงฬˆฬขฬœฬฌฬœhฬณฬดฬพฬœฬฒฬนฬฎฬœฬ‚ฬ ฬฉฬŠฬถฬฬกฬฬถฬ…ฬฉฬฬ‚ฬฬฉ                                                               Qฬ›ฬฒฬนฬทฬœฬฆฬฅฬดฬ™ฬ’ฬ ฬคฬžฬดฬฉฬ“ฬ“ฬดMฬธฬฎฬœฬทฬ‘ฬฒฬšฬ–ฬนฬงฬšฬ–ฬ™ฬนฬŠฬ‡ฬŒฬฎฬ˜ฬถฬธฬจฬ‰mฬฒฬˆฬงฬŠฬ’ฬฅฬฝฬŠฬ“ฬญฬ ฬ—ฬ’ฬฐฬŠฬ–ฬตฬฌฬงฬฬขjฬœฬฌฬ‰ฬผฬŽฬŸฬ‰ฬตฬดฬฌฬ‰ฬฒฬกฬœฬ‰ฬถฬ™ฬฌฬฬ—ฬฬจฬ—ฬ‚ฬฬฉฬ›ฬขฬ9ฬฉฬ›ฬฒฬคฬฆฬ‰ฬขฬกฬกฬฬถฬ…ฬฉฬฬ‚ฬฬฉฬ›ฬฒฬนฬฆ#C(2\
6,65#wฬ›ฬ‡ฬ•ฬณฬšฬ‚ฬ ฬฉฬŠฬ“ฬฌฬงฬ—ฬ’ฬฐฬŠฬ–ฬฒzฬŸฬฐฬงฬบฬ–ฬบฬ‰ฬฒฬฑฬณฬฬ“ฬนฬณฬ‹ฬฆฬนฬฐฬŠฬ‚ฬคUฬซฬœฬฒฬนฬฃฬ›ฬขฬ ฬงฬผฬ‰ฬพฬšฬ ฬ‚Qฬœฬฉฬ—ฬฬฉฬฬŠฬ—ฬดฬŠฬ›ฬ’ฬนฬฃฬ›ฬถฬตฬฐฬšฬ–ฬฑCฬฅฬฬ’ฬกฬณฬ‹ฬ†ฬผฬฌฬฬขฬคฬฝฬฬงฬฌฬŠฬ‚                                                               Sฬ—ฬŒฬฝฬœฬตฬญฬ“ฬžฬ–ฬตฬขฬ›ฬถฬฐฬฎ0ฬšฬ—ฬ‘ฬฅฬœฬฆฬ…ฬดฬ›ฬทฬ‰ฬฬŠGฬ‚ฬคฬปฬ‚ฬ ฬฅฬณฬ‹ฬฆฬนฬฐฬฬ–ฬผฬฝ0ฬฬงฬŒฬฎฬ›ฬงฬ•ฬญฬฬ“ฬตฬฎฬฬ–ฬฑ5ฬฌฬฬฒฬœฬงฬŽฬขฬกฬฏฬฬ–ฬ#),C\
(26,#Bฬคฬ‹ฬงฬฬตฬœฬถฬ ฬจฬ‰ฬ‡ฬญฬณฬ‹ฬฆฬนIฬตฬ›ฬ“ฬฐฬผฬŒฬ‡ฬดฬฉฬŽฬถฬ€iฬฌฬœฬฒฬนฬฎฬฬ–ฬดฬฝฬ›ฬงฬ•ฬฌฬ›ฬ‚ฬฑฬฏฬŠฬ“ฬฌฬŠฬ‚ฬ—ฬŒ2ฬฎฬ˜ฬถฬธฬฝฬŠฬ†ฬŒฬฌฬฬขฬฑฬฒฬŠฬ“ฬดฬพฬžฬทฬˆฬฝฬ–ฬตฬดฬปฬฬถPฬกฬฉฬ›ฬ†ฬ”ฬจฬŒฬ’ฬฅฬปฬ‚ฬ ฬคฬ‰ฬฬฃ          ___                              _                   lฬตฬณฬ‹ฬฆฬนฬฅฬžฬ‡ฬฬจฬŠฬ“ฬญฬฉฬ™ฬขฬกฬถsฬ‹ฬฆฬ‘ฬฏฬ›ฬฆฬ”ฬฉฬฬ†ฬกฬฒฬ›ฬทฬœฬงMฬฬ–ฬนฬฅฬžฬ‡ฬฬฅฬ˜ฬทฬ‘ฬฅฬ™ฬ‚ฬฬ…ฬ“ฬดฬ˜ฬฌฬˆฬ‡pฬฬกฬ›ฬงฬฬ ฬ˜ฬ’ฬ€ฬงฬŠ5ฬถฬŒฬปฬ‚ฬ ฬคฬ‰ฬฬฃฬตฬถฬ‹ฬงฬ™ฬกฬ›ฬ‡ฬ•#97)\
,C(1#1ฬฅฬŽฬฐฬจฬ‰ฬ‚ฬ–ฬฅฬฆtฬŠฬ‡ฬ˜ฬฝฬฬ–ฬŒฬฉฬžฬฐฬจฬ‰ฬ‚ฬฬฅฬฒฬ™ฬ—ฬ‘ฬตฬœIฬฆฬธฬ ฬœฬขฬนฬชฬ›ฬถฬฅฬฎฬŠฬ‚ฬœฬงฬŠฬ“ฬฌlฬŠฬ‚ฬฬฅฬฝฬ™ฬ–ฬฑฬณฬ™ฬ’ฬฬฒฬ‹ฬงฬฬตฬœQฬถฬ ฬจฬฬขฬคฬปฬ‚ฬ ฬฅฬฝฬŸฬ“ฬฌฬŠฬ‚ฬ–           ||_ o _ ._  _  __|_      _. _ _|__. __|_            hฬผฬฝฬ–ฬทฬ€ฬฎฬšฬ†ฬ•ฬกฬ™ฬ†ฬ•ฬฒฬ—ฬ“ฬฌฬŠฬ‚ฬ—ฬฬจฬšฬ–eฬฑฬฅฬŠฬƒฬ„ฬฉฬžฬฐฬจฬ‰ฬ‚ฬ—ฬ˜ฬฝฬœฬฒฬนฬฎEฬ™ฬ—ฬกฬดฬŠฬ‚ฬคฬปฬ‚ฬ ฬคฬ‰ฬšฬ–ฬ˜ฬจฬฬขpฬนฬคฬ›ฬถฬนฬฅฬŠฬ–ฬ‰ฬฒฬ™ฬ–Jฬ…ฬซฬŽฬถฬ•ฬฌฬœฬถฬ”ฬ ฬฬฃฬตฬถฬ‹ฬงฬ™ฬก#0,4\
8),'#Zฬ›ฬ‡ฬ•ฬฅฬŽฬฐฬจฬ‰ฬ‚ฬ–ฬฅฬฆฬŠฬ‡ฬ€ฬฎฬ˜ฬถฬกฬกฬœdฬงฬฬ›ฬฬฅฬดฬฉฬ›ฬฒฬนฬฐฬฬ—ฬฬจฬŠfฬ‡ฬ€ฬฎฬ˜ฬถฬกฬกฬœฬงฬฬ›ฬฬฅฬดฬจwฬœฬฒฬคฬฉฬŽฬฐฬจฬ‰ฬ‚ฬ–ฬ•ฬฌฬœฬถฬ”ฬ ฬฬ†ฬกฬฒฬ›ฬทฬœฬ ฬ˜ฬ†Sฬฅฬฎฬฬฆฬ…ฬฌฬšฬ–ฬฬ ฬ˜ฬถฬกฬกฬœฬฆ           || ||_> |_)(_)_> |_ \/\/(_|_>  |(_|(_ |_            Oฬ…ฬฃฬฬ†ฬ•ฬฒฬˆฬ‚ฬœฬคฬžฬทฬ™ฬฝฬ‰ฬฒฬ€ฬจฬ˜ฬถฬฝฬคฬ™ฬ—ฬฬฏgฬšฬ–ฬนฬดฬˆฬ‚ฬ‘ฬปฬฬขฬนฬฃฬ›ฬถฬ‘ฬฅฬ”ฬ†ฬฝฬฉฬ›pฬงฬ‘ฬฬฬ‚ฬ ฬฉฬŸฬ’ฬฅฬ XฬŽฬฐฬจฬ‰ฬŸฬฬจฬ‰ฬ›ฬฒฬนฬฐฬฬ—ฬฬจฬŠฬ‡mฬŒฬฎฬ›ฬงฬ€ฬจฬŠฬ’ฬฐฬงฬŸฬ’ฬคฬงฬŠฬ“ฬฌฬŠฬ‚#+/=\
'].j#xฬ—ฬ‰ฬฅฬฬ‡ฬ•ฬฒฬ›ฬขฬฬฅฬฬฆฬ…ฬฌฬŠฬ†jฬผฬฎฬ™ฬฆฬฅฬฌฬฬ†ฬ•ฬฒฬŠฬ†ฬ”ฬฝฬฬฆฬ”ฬฉQฬ‹ฬฆฬฉฬฏฬšฬ–ฬธฬจฬ‰ฬตฬฑฬฎฬ‰ฬฒฬคฬฉฬŽฬฐฬฉbฬฝฬŽฬฐฬฉฬฒฬ™ฬ—ฬ‘ฬตฬœฬฆฬธฬ ฬ›ฬ“ฬญฬฝฬŠQฬ’ฬ ฬฉอ‚ฬŠฬ†ฬ™ฬตฬ›ฬฆฬฬดฬšฬ–ฬฝฬฎฬŠฬ‚                   |                                           0ฬฅฬปฬ‚ฬฆฬฅฬฆฬŠฬ‚ฬฬทฬšฬ–ฬนฬคฬ›ฬทฬœฬงฬˆ+ฬ†ฬฅฬฎฬˆฬ†ฬฬฌฬ›ฬถฬ‰ฬกฬ›ฬ…ฬ‘ฬจฬšฬ—ฬŒฬฉฬžฬฐdฬจฬ‰ฬšฬ–ฬ˜ฬจฬˆฬ’ฬกฬคฬ›ฬถฬฬตฬ›ฬ–ฬ•ฬฎฬฬ‚ฬนฬข4ฬ›ฬถฬ‘ฬนฬ‹ฬงฬ‘ฬฅฬžฬ‡ฬ‘ฬƒฬ›ฬถฬนฬดฬ™ฬ–ฬนkฬดฬ‹ฬงฬฬฅฬ˜ฬ—ฬ‰ฬฃฬšฬ‚ฬกฬฃฬ˜ฬตฬฌฬฐฬ—ฬ’#oin\
('')#sฬนฬฒฬ™ฬ—ฬฬฌฬ˜ฬ–ฬฬฅฬŠฬ‚ฬฝฬ›2ฬ‹ฬขฬจฬซฬฬตฬธฬคฬžฬทฬดฬจฬŠฬ—ฬฑฬ›ฬ—Rฬ…ฬตฬœฬ—ฬ…ฬดฬฏฬ™ฬฒฬฐฬ ฬˆฬฅฬฑฬœฬ‰ฬ‚ฬ˜ฬขฬŠuฬ’ฬคฬฉฬŠฬ—ฬ‰ฬฅฬฬ‡ฬ•ฬฒฬ›ฬฃฬฌฬŠฬ‚ฬ–ฬ‘ฬฏฬ˜oฬทฬ•ฬญฬ™ฬ–ฬนฬดฬ‹ฬฆฬ‰ฬฏฬ™ฬ‡ฬคฬฎฬ™ฬฆฬฅ                                                               /ฬฒฬœฬทฬ‘ฬƒฬšฬ†ฬฅฬฌฬ™ฬ‚ฬนฬฒฬ™ฬ–ฬตฬฏฬฬฆฬ”ฬจฬŠฬ“oฬฌฬŠฬ‚ฬ—ฬ™ฬกฬœฬขฬฬดฬ™ฬ—ฬกฬดฬฬ—ฬŒฬฝฬฬฆฬ‘ฬฏRฬ˜ฬทฬ•ฬญฬ™ฬ–ฬนฬดฬ‹ฬฆฬฬฒฬ™ฬ–ฬ…ฬดฬ™ฬ•ฬ‘ฬฅฬžฬ‡ฬ‘ฬŽฬ›ฬถKฬ‘ฬฅฬŠฬ‡ฬŒฬฉฬŽฬฐฬจฬ‰ฬฬฆฬ…ฬฒฬˆฬ†ฬ•ฬฌฬ™ฬ–ฬดMฬฝฬŠฬ†ฬธฬฌฬ˜ฬ“ฬตฬปฬŸฬ’ฬฑฬฅฬŠฬ“ฬดฬพฬŠฬ€ฬจฬ‰ฬ‚ฬ–ฬ”ฬฝฬ™#];Z\
=[..#3ฬ†ฬฝฬฃฬฬ–ฬตฬฅฬ›ฬงฬฬฎฬ˜ฬทฬ‰ฬฅฬ˜ฬ—jฬ‘ฬฅฬ‘ฬ–ฬฑฬฅฬ›ฬ–ฬ•ฬฎฬฬ‚ฬกฬฎฬŠฬ’ฬฐ=ฬŠฬ‚ฬฬฅฬกฬ‹ฬฆฬฅฬฎฬ›ฬฆฬ•ฬฒฬ‰ฬขฬ™ฬฅฬ‹ฬฆฬ…ฬฐฬœฬ†ฬ•Lฬฎฬ™ฬ‚ฬ ฬฎฬ‹ฬขฬนฬกฬ‹ฬฆฬฅฬฎฬ›ฬฆฬ•ฬฒฬŠzฬ’ฬฐฬŠฬ‚ฬฬฅฬกฬ‹ฬฆฬ…ฬดฬฬ‡ฬˆฬฆฬ‰ฬคฬฝฬขฬšฬฆฬ•ฬฃฬฬ‚                  _|_  _  _|  _  _| |_    .__  _.|             hฬนฬฅฬ›ฬงฬ‘ฬฒฬšฬ–ฬ•ฬณฬŠฬ†ฬ„ฬฎฬ˜ฬ—ฬ‘ฬดฬœฬขฬคWฬฎฬ™ฬฆฬฝฬฒฬ‘ฬ–ฬ…ฬฃฬšฬ‚ฬ ฬจฬ–ฬถฬฌฬฌฬฬฅฬด3ฬฉฬฬ“ฬนฬฅฬ‹ฬงฬฬฅฬฬ„ฬ…ฬดฬฬ‡ฬ‰ฬฉฬ˜ฬงฬ•ฬดฬ™ฬ’ฬกyฬซฬ‹ฬ‡ฬ˜ฬฉฬŠฬ’ฬฐฬŠฬ‚ฬฬฅฬกฬ‹ฬฆฬ˜ฬฆeฬ‰ฬฆฬ„ฬฎฬ™ฬขฬกฬฅฬŠฬ’ฬฐฬŠฬ‚ฬ–ฬ”ฬฉฬŽฬฐฬจฬ‰ฬฬฆฬ…#.'ฬ€ฬฬ‚ฬƒฬ„ฬ…ฬ†ฬ‡ฬˆฬ‰ฬŠฬ‹ฬŒฬฬŽฬฬฬ‘ฬ’ฬ“ฬ”ฬ•ฬ–ฬ—ฬ˜ฬ™ฬšฬ›ฬœฬฬžฬŸฬ ฬกฬขฬฃฬคฬฅฬฆฬงฬจฬฉฬชฬซฬฌฬญฬฎฬฏฬฐฬฑฬฒฬณฬดฬตฬถฬทฬธฬนฬบฬปฬผฬฝฬพฬฟอ€'\
];z=#Wฬฒฬˆฬ‡ฬ‰ฬตฬ›ฬฆฬตฬฅฬ›ฬงฬ”ฬฝrฬžฬทฬดฬปฬ‚ฬ ฬฅฬทฬšฬ–ฬนฬคฬ›ฬทฬœฬฎฬœฬงฬ•kฬฎฬ›ฬ–ฬ•ฬฎฬฬ“ฬตฬฒฬฬ–ฬนฬญฬ™ฬ–ฬนฬตฬฬ”ฬฝฬขฬš8ฬฆฬ•ฬฃฬฬ‚ฬนฬกฬœฬทฬฬฉฬ™ฬถฬธฬจฬ™nฬ–ฬฑฬฅฬ›ฬ’ฬ ฬขฬ™ฬ†ฬฅฬถฬˆฬขฬฑฬปฬšฬ–ฬนฬฎฬ™ฬ—ฬˆฬบ                 (_| |(/_(_|<(/_(_| |_)\/ |(/_(_||             5ฬ–ฬฐฬจฬ‰ฬ‚ฬ—ฬ‰ฬตฬ›ฬฆฬตฬฅฬ›ฬงฬ”ฬฎฬฬ†tฬ•ฬธฬฬƒฬตฬฅฬ›ฬ†ฬ•ฬญฬŠฬ‚ฬ‰ฬคYฬšฬ—ฬ˜ฬขฬ‹ฬ‡ฬญฬฉฬ›ฬฆฬนฬฅฬœฬฃฬฉฬ›ฬ™ฬ–Zฬฑฬฅฬ›ฬ’ฬ ฬขฬฬ†ฬ•ฬธฬฬ†ฬ…ฬฒฬ™ฬ–ฬ„ฬขฬŠฬ•ฬตฬฝฬŠJฬ’ฬฐฬŠฬ‚ฬฬฅฬฒฬฬ–ฬนฬญฬ™ฬ–ฬนฬตฬ‹ฬงฬ‰ฬตฬ›ฬฃฬตฬฅฬ›ฬ†ฬ•ฬญฬŠ#{};\
b={}#Wฬ‚ฬ‰ฬคฬšฬ—ฬ˜ฬขฬ‹ฬ‡ฬญฬฉฬ›ฬฆฬนฬฅฬœฬฃฬฉฬ›ฬ™ฬ–ฬฑฬฅฬ›ฬ’6ฬ ฬขฬ˜ฬงฬ•ฬดฬฬ†ฬฝฬฎฬˆฬขฬฑฬปฬšฬ–ฬนฬฎฬ™ฬ—ฬˆฬบฬ–iฬทฬ‘ฬฅฬžฬ‡ฬฬจฬˆฬฅฬ‰ฬตฬ›ฬขฬˆฬฉฬ—Vฬ—ฬดฬฉฬ—ฬ—ฬดฬฉฬ‚ฬ ฬฅฬฬŸฬ’ฬคฬฌฬœฬงฬ•ฬฎuฬ›ฬ–ฬ•ฬฎฬฬ’ฬคฬปฬ‚ฬ ฬฅฬ›ฬœฬงฬ•ฬฎฬ›ฬ–ฬ•ฬฎฬฬ’ฬนฬดฬ™ฬ—ฬก                                       /                       wฬดฬ‹ฬ‡ฬ‰ฬตฬ›ฬฆฬตฬฅฬ›ฬงYฬ”ฬฎฬœฬงฬ•ฬฎฬ—ฬ“ฬตฬ›ฬœฬงฬ•ฬฎฬ›ฬ–ฬ•ฬฎฬฬ’sฬนฬดฬ™ฬ—ฬกฬดฬ‹ฬ‡ฬ‰ฬตฬ›ฬฆฬตฬฅฬ›ฬงฬ”ฬฎฬœฬงฬ•ฬฎฬ—ฬ’ฬน1ฬญฬ˜ฬ—ฬ€ฬจฬ™ฬ“ฬดฬพฬ™ฬ’ฬนฬฆฬšฬ—ฬ‰ฬณnฬฬ„ฬฬจฬšฬ–ฬฑฬคฬŠฬ“ฬฌฬŠฬ‚ฬ—ฬ‰ฬตฬ›ฬฆฬต#;B.\
map(#Iฬฅฬ›ฬงฬ”ฬฎฬฬทฬ•ฬฒฬ›ฬƒฬตฬ•ฬ”ฬคฬฐฬฎฬ˜ฬทฬ‰ฬฅkฬ˜ฬ—ฬ‘ฬฅฬ“ฬถฬ‰ฬชฬ™ฬ–ฬฬดฬ•ฬ•ฬ‰ฬŒฬŠฬ†ฬนฬฅฬWฬฒฬฬ‚ฬ›ฬ†ฬฝฬขฬŠฬ…ฬฌฬŠฬ‚eฬฬคฬงฬฬณฬดฬงฬ‹ฬ„ฬŒฬฌฬ‰ฬณฬฌฬงฬ‹ฬ€ฬจฬ‰ฬ‚ฬ–ฬฬจฬ›Eฬ…ฬฌฬฑฬ—ฬ’ฬคฬฌฬ‰ฬณฬฌฬงฬ‹ฬ€ฬจฬ‰ฬ‚ฬ’                                                               Wฬœฬจฬ‰ฬฒฬฑฬฆฬฬ–ฬนฬฃฬฬ†ฬฅฬฏฬ›ฬขฬ ฬฉฬžฬฐฬจฬ‰Rฬ‚ฬฬฅฬฏฬ›ฬฆฬตฬฅฬœฬทฬฬกฬ™ฬถฬ”ฬ ฬฬ’ฬฬฆฬฬ–ฬนฬฃฬฬ†ฬฅฬฏฬ›DฬขฬกฬฅฬŠฬ—ฬฌฬŠฬ‚ฬฬคฬ‰ฬ‚ฬ—ฬ™ฬกฬœฬขฬAฬฉฬ›ฬฆฬ‰ฬตฬ™ฬขฬฑฬฐฬœฬฆฬฝฬญฬ‹ฬ†ฬ•ฬฏฬ™bฬขฬฑฬณฬšฬ—ฬ‘ฬฅฬœฬฃฬฌฬŠฬ‚ฬฬคฬ‰ฬ‚ฬ–ฬฝฬฎฬ›#(c,\
i,x)#Rฬ–ฬ•ฬณฬœฬถฬ…ฬงฬ™ฬ“ฬตฬฆฬฬ–Hฬนฬฃฬฬ†ฬฅฬฏฬ›ฬขฬกฬฅฬŠฬ—ฬฌฬŠฬ‚ฬฬคฬ‰ฬ‚ฬฬฅฬฅ+ฬฬ–ฬ”ฬฎฬ™ฬ†ฬ…ฬดฬ˜ฬ“ฬฌฬŠฬ‚ฬฬคฬ‰Lฬ‚ฬฬฅฬฉฬ™ฬขฬกฬฅฬ›ฬถฬ˜ฬฉฬœฬฆฬ•ฬด9ฬฬ—ฬ‰ฬฎฬŽฬฐฬจฬ‰ฬ‚ฬฬคฬ‰ฬ‚ฬ–ฬฅฬฆ                   |_  _   | o _ _ _ .__                       4ฬŠฬ†ฬ”ฬฎฬฬ‡ฬฅฬฐฬ™ฬ“ฬดฬฝฬˆฬฆฬฅฬฎฬœ=ฬ‡ฬ•ฬดฬˆฬขฬฅฬปฬ‚ฬ ฬคฬ‰ฬ‚ฬฬคฬ‰ฬ‚ฬ–ฬฅฬฎฬ˜ฬงฬ•ฬฆฬฬ—ฬญvฬฎฬ™ฬ—ฬกฬดฬŽฬฆฬฅฬฎฬ˜ฬงฬ•ฬฆฬ‹ฬ†ฬ‘ฬกฬฬ†xฬ„ฬบฬ™ฬ’ฬนฬคฬ˜ฬ—ฬ‘ฬกฬŸฬ“ฬฌฬŠฬ‚ฬฬคฬ‰ฬ‚ฬฬคฬ‰ฬšฬ–ฬ˜ฬจฬœฬ‡Bฬ‰ฬฏฬ›ฬ’ฬฅฬฐฬœฬฆฬฝฬญฬŠฬ‚ฬคฬปฬ‚ฬ ฬคฬ‰ฬ‚ฬฬคฬ‰#=>(\
x=Z[#1ฬŸฬ–ฬ•ฬฌฬœฬถฬ”ฬ ฬšฬ–ฬ˜ฬจฬ™ฬ’ฬนฬดฬžฬ—ฬZฬฅฬฬ“ฬดฬขฬ™ฬ–ฬฝฬฆฬˆฬขฬฅฬปฬ‚ฬ ฬคฬ‰zฬ‚ฬฬคฬ‰ฬ‚ฬ–ฬ•ฬฏฬ™ฬฃฬดฬฑฬŽฬฐฬจฬ‰ฬ‚ฬiฬคฬ‰ฬ‚ฬฬฅฬฉฬ™ฬขฬกฬฐฬœeฬฆฬฝฬญฬŠฬ—ฬฬฒฬ›ฬถฬดฬจฬŠฬ“ฬฌ                   |_)(_)\/|<|_>_>(/_|_>                       xฬŠฬ‚ฬฬคฬ‰ฬ‚ฬฬฅฬฝฬ‚ฬ ฬคฬ‰ฬ‚ฬฬฅnฬฝฬ‚ฬ ฬคฬ‰ฬ‚ฬฬฅฬถฬ˜ฬ—Uฬˆฬ ฬšฬ–ฬผฬฝฬžฬฐฬจฬ‰ฬ‚ฬฬคฬ‰ฬ‚ฬ–ฬ…ฬณฬžฬ–fฬนฬฃฬˆฬ‡ฬ‰ฬฅฬ˜ฬ–ฬฬจHฬŠฬ—ฬฌฬŠฬ‚ฬฬคฬ‰ฬ‚ฬฬค#i],\
z[x]#bฬ‰ฬฬฆฬ…ฬฒฬˆฬ†ฬŒฬฝฬœฬถฬฅฬดฬ™ฬ—ฬˆฬฆฬ‰ฬงฬฬฉ1ฬฬ†ฬ•ฬฒฬ‹ฬฆฬนฬฅฬžฬ‡ฬฬจฬŠฬ“ฬฌฬŠฬ‚ฬฬคฬ‰Xฬ‚ฬฬคฬ‰ฬฬฆฬ…ฬฒฬˆฬ†ฬ‰ฬฌฬ›ฬถฬฬซฬ™ฬ–ฬฬฝฬ™ฬฆฬ…ฬฌฬœnฬถฬ”ฬปฬ‚ฬ ฬคฬ‰ฬ‚ฬฬคฬ‰ฬ‚ฬ—ฬฬจฬšฬ–ฬฑฬฅฬŠฬ‚ฬ…ฬฃฬŸlฬ‡ฬฑฬฃฬ‹ฬฆฬ‘ฬฏฬ›ฬฆฬ”ฬฉฬžฬฐ                         /                                     8ฬจฬ‰ฬ‚ฬฬคฬ‰ฬ‚ฬฬคฬ‰ฬšฬ–ฬ˜ฬจฬ™ฬ–ฬฝฬฆฬŠ=ฬ—ฬ‰ฬฅฬฬ‡ฬ•ฬฒฬ›ฬขฬด8ฬฑฬŽฬฐฬจฬ‰ฬ‚ฬฬคฬ‰ฬ‚ฬฬคฬ‰ฬ˜ฬฆฬฑฬฏฬ˜ฬถฬญIฬฅฬ™ฬƒฬตฬดฬœฬงฬ•ฬฅฬŽฬฐฬจฬ‰ฬ‚ฬฬคฬ‰ฬ‚ฬฬคฬ‰ฬœฬ†ฬฝฬณฬฬ„ฬตฬฅSฬœฬทฬฬกฬ™ฬถฬ”ฬจฬžฬทฬ‘ฬนฬœฬ†#=c,\
b[c]#Hฬ”ฬบฬˆฬงฬฬดฬ˜ฬ—ฬ‘ฬตฬœฬฒฬˆฬฌฬ™ฬ†ฬ…ฬดฬ˜ฬ“ฬจฬขฬ˜ฬฆฬฑฬฏmฬ˜ฬถฬญฬฅฬ™ฬ‚ฬ‰ฬฝฬŠฬ“ฬฌฬŠฬ‚ฬฬคฬ‰ฬ‚ฬbฬคฬ‰ฬ‚ฬ–ฬฅฬฆฬŠฬ‚ฬ…ฬฉฬ›ฬฆฬ‰ฬตฬ™uฬขฬคฬŠฬ‚ฬฬคฬ‰ฬ‚ฬฬคฬ‰ฬ‚ฬฬฅฬกฬ0ฬถฬ…ฬฉฬฬ‚ฬ€ฬจฬ›ฬฆฬ•ฬทฬˆฬ…ฬฬฒฬ›ฬถ                                                               Dฬตฬฉฬœฬถฬ”ฬจฬ™ฬ“ฬดฬพฬœฬ‡ฬ‰ฬฏฬ›ฬ“ฬตฬฅฬŠPฬ’ฬคฬปฬ‚ฬ ฬคฬ‰ฬ‚ฬฬคฬ‰ฬ‚ฬฬฅฬฉฬ™ฬขฬกฬฅฬ›ฬถฬ˜ฬฉ9ฬœฬฆฬ•ฬดฬฬ—ฬ‰ฬฎฬ‹ฬ“ฬ„ฬปฬ‚ฬ ฬคฬ‰ฬ‚ฬฬคฬ‰ฬ‚ฬrฬฅฬณฬšฬ—ฬ‘ฬฅฬœฬฃฬตฬฉฬ›ฬฆฬ‰Tฬตฬ™ฬขฬนฬคฬ˜ฬ—ฬ‘ฬกฬ–ฬตฬฬนฬ›ฬ–ฬ‰ฬฏ#=x)\
);s=#eฬ›ฬ‚ฬนฬฉฬฬ†ฬ•ฬฒฬ˜ฬ—ฬ‘ฬฏฬœ2ฬฅฬดฬจฬŠฬ“ฬฌฬŠฬ‚ฬฬคฬ‰ฬ‚ฬฬคฬ‰ฬ‚oฬ–ฬŒฬฝฬœฬถฬฅฬดฬ™ฬ—ฬˆฬฎฬ›ฬฆฬ•ฬธฬฬ‚ฬ tฬฉฬŽฬฐฬจฬ‰ฬ‚ฬฬคฬ‰ฬ‚ฬHฬคฬ‰ฬšฬ–ฬนฬขฬฬ–ฬ˜ฬฝฬšฬ–ฬนฬขฬฬ–ฬ˜                                                               Qฬฎฬ›ฬฆฬ•ฬธฬฬƒฬฌฬŠฬ‚ฬฬคฬ‰ฬ‚ฬฬคฬ‰ฬŸฬฬจฬ‰6ฬ‚ฬฬคฬ‰ฬ‚ฬฬฅฬฉฬ™ฬขฬกฬขฬ›ฬ†ฬฝฬฃฬšฬถฬ•ฬคฬŠฬ—ฬฬฏฬœฬทoฬ‘ฬฬ™ฬ—ฬฬณฬ˜ฬ–ฬฬฅฬŠฬ‡ฬญฬดฬžฬ—ฬฬฅฬŽฬขฬ‰ฬณฬฬ†4ฬ…ฬดฬฬ—ฬŒฬขฬ‹ฬ†ฬ‘ฬกฬฬ†ฬ„ฬบฬˆฬงฬ‰ฬตฬ›ฬฆฬนnฬฉฬ›ฬฆฬœฬขฬŸฬ’ฬคฬปฬ‚ฬ ฬคฬ‰ฬ‚ฬฬคฬ‰ฬ‚ฬ—ฬ‰ฬฅฬฬ‡#"อ‚";\
[e,d#Aฬ•ฬฒฬ›ฬขฬฬฃฬ‹ฬงฬ™ฬกฬ›ฬ‡ฬ•ฬฅฬ‹ฬฆฬฬฏฬ™ฬ†Hฬ•ฬฬ›ฬถฬฅฬฎฬฬ„ฬ…ฬดฬŠฬ‚ฬคฬปฬ‚ฬ ฬคฬ‰pฬ‚ฬฬคฬ‰ฬŸฬ’ฬฐฬŠฬ‚ฬฬคฬ‰ฬ‚ฬฬฅฬทฬœฬฆฬฅฬดฬ™ฬ’gฬกฬณฬŠฬ—ฬฌฬŠฬ‚ฬฬคฬ‰ฬ‚ฬฬคฬ‰ฬœฬ†ฬฝฬณฬฬ„ฬตKฬฅฬœฬทฬฬกฬ™ฬถฬ”ฬจฬžฬทฬ‘ฬนฬœฬ†ฬ”                โ•”โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•—                 Oฬบฬˆฬฆฬฝฬตฬฬ‡ฬฬตฬฬ‚ฬˆฬฌฬ™ฬ†ฬ…ฬดฬ˜ฬ“ฬฉฬณฬŸฬ’ฬคjฬปฬ‚ฬ ฬคฬ‰ฬ‚ฬฬคฬ‰ฬŸฬฬจฬ‰ฬ‚ฬฬคฬ‰ฬŸฬ“MฬฌฬŠฬ‚ฬฬคฬ‰ฬ‚ฬ—ฬ‘ฬฒฬžฬ’ฬฬปฬ‚ฬ ฬคฬ‰ฬ‚ฬrฬคฬ‰ฬฬฆฬ…ฬฒฬˆNฬ‡ฬ€ฬฝฬ‘ฬคฬ…ฬŒฬ”ฬดฬ”ฬฎฬ˜ฬถฬฝฬญฬœฬ†ฬฅฬฌ#]=[\
b,z]#/ฬ™ฬ’ฬกฬฅฬ‹ฬฆฬ‘ฬกฬฬ†ฬ„ฬฉฬŽฬฐฬจฬ‰ฬ‚ฬkฬคฬ‰ฬ‚ฬ—ฬฬฏฬœฬทฬ‘ฬฬ™ฬ—ฬฬณฬ˜ฬ–ฬฬฅฬŠฬ‡ฬญฬดฬžBฬ—ฬฬฅฬŽฬขฬ‰ฬณฬฬ†ฬ…ฬดฬฬ—ฬŒฬขฬ‹ฬ†ฬ‘ฬกฬฬ†mฬ„ฬบฬˆฬงฬ‰ฬตฬ›ฬฆฬนฬฉฬ›ฬฆฬœฬขฬŸฬ’ฬคฬป4ฬ‚ฬ ฬคฬ‰ฬ‚ฬฬคฬ‰ฬœฬ‚ฬกฬฉฬ›ฬฒ                โ•‘    ___ _   _    ___ ___    โ•‘                 CฬคฬŠฬ‚ฬฬคฬ‰ฬ‚ฬฬคฬ‰ฬ‹ฬงฬ‘ฬจฬ™ฬ–ฬธฬจฬŠฬ‚ฬคฬฝฬฬงฬฬฏฬœฬท7ฬ‘ฬฬ™ฬ—ฬฬณฬ˜ฬ–ฬฬฅฬŠฬ‡ฬญฬดฬžฬ—ฬฬฅฬŽฬขฬ‰ฬจฬ˜ฬ–ฬฑฬดฬˆฬงฬดRฬฉฬŠฬฬจฬ‰ฬ‚ฬฬคฬ‰ฬ‚ฬฬคฬฎฬ˜ฬถฬ…ฬดฬ˜ฬถฬ ฬจฬ™ฬ“ฬดFฬพฬœฬ†ฬฝฬณฬฬ„ฬตฬฅฬœฬทฬฬกฬ™ฬถฬ”ฬจฬžฬทฬ‘ฬนyฬœฬ†ฬ”ฬบฬˆฬฆฬ•ฬฒฬœฬฆฬฝฬฒฬˆฬขฬฑฬคฬ˜ฬ—ฬ‘#.ma\
p(B=#tฬกฬŽฬฆฬ•ฬฝฬŠฬ’ฬคฬปฬ‚ฬ ฬคฬ‰ฬ‚ฬฬฅฬฝRฬˆฬ†ฬฬกฬฬ†ฬฬจฬŠฬ†ฬ”ฬฉฬˆฬ‡ฬฌฬŠฬ‚ฬฬคxฬ‰ฬ‚ฬฬฅฬฐฬ›ฬทฬฬดฬ“ฬ–ฬ•ฬณฬœฬถฬ…ฬงVฬ™ฬ’ฬกฬปฬฬ‡ฬฅฬฐฬ™ฬ“ฬจฬขฬ™ฬ—ฬ‰ฬฒฬ›ฬทฬˆฬขฬ‹ฬ†Oฬ‘ฬกฬฬ†ฬ„ฬบฬ™ฬ—ฬดฬฉฬŽฬฐฬจฬ‰ฬ‚ฬฬคฬ‰ฬŸฬฬจฬ‰ฬ‚ฬฬฅฬฝฬ‚                โ•‘   | __/_\ | |  / __| __|   โ•‘                 aฬ ฬคฬ‰ฬŸฬ’ฬฐฬงฬŠฬ’ฬ ฬฉฬŽฬฒฬœฬŠ0ฬ‚ฬ•ฬดฬฉฬŠฬ“ฬฌฬŠฬ‚ฬ—ฬ‰ฬตฬ›ฬฆฬตฬฅฬ›ฬงฬ”ฬฎฬœฬงฬ•ฬฎฬ‹sฬฆฬฝฬฎฬ˜ฬถฬฑฬฉฬ˜ฬถฬฌฬฝฬ™ฬงฬ•ฬฎฬ˜ฬทฬ‘4ฬฉฬ›ฬถฬธฬจฬ™ฬ’ฬฅฬปฬ‚ฬ ฬคฬ‰ฬ™ฬ’ฬนฬฐฬœฬฆฬ•ฬถฬ™ฬ–5ฬนฬดฬ‘ฬ†ฬ•ฬฆฬ˜ฬ—ฬ•ฬฌฬฬ‚ฬ ฬฉฬŽฬฐฬจฬ‰ฬ‚#>(s\
=>[.#xฬ—ฬ™ฬกฬœฬขฬฬฐฬœฬฆฬฝฬงฬœฬฆฬ…8ฬญฬฬ—ฬญฬฝฬŽฬฐฬจฬ‰ฬ‚ฬ—ฬฬฒฬ›ฬถฬฬฒฬ˜ฬ–9ฬดฬฎฬ™ฬฆฬฝฬฒฬ›ฬ“ฬตฬปฬŸฬ“ฬฌฬŠฬ‚ฬฬฅฬฐฬœ6ฬฆฬฝฬงฬœฬฆฬ…ฬญฬ‹ฬฆHฬ™ฬฏฬœฬฆฬดฬฝฬ“ฬถฬ‰ฬชฬ™ฬ–ฬฬดฬ‹ฬฆฬ…ฬณฬœฬถฬฅ                โ•‘   | _/ _ \| |__\__ \ _|    โ•‘                 vฬงฬ›ฬขฬกฬฅฬ›ฬ†ฬ•ฬญฬŠฬ‚ฬ‰ฬฆฬ›ฬทฬ‰ฬญฬˆฬขฬฑฬปฬšฬ–ฬนฬฎฬ™Eฬ—ฬˆฬบฬ–ฬฐฬจฬ‰ฬ‚ฬฬฅฬฐฬœฬฆฬฝฬงฬœ4ฬฆฬ…ฬญฬ‹ฬฆฬ™ฬฏฬœฬฆฬดฬฎฬฬ†ฬ•ฬธฬFฬƒฬตฬฐฬœฬฆฬฝฬงฬœฬฆฬ…ฬญฬ‹ฬฆฬ™ฬฏฬœhฬฆฬดฬฎฬฬ†ฬ•ฬธฬฬ†ฬ”ฬฝฬ™ฬ–ฬฑฬฅฬ›ฬ’ฬ ฬข#..s\
].ma#wฬšฬ–ฬนฬฐฬฬ—ฬฬขฬ‹ฬ‡ฬญฬฆฬŠฬ†ฬ”ฬฉฬžฬฐฬจhฬ‰ฬ‚ฬฬคฬ‰ฬ™ฬ’ฬนฬกฬ›ฬ‡ฬ‘ฬฅฬœNฬฃฬตฬฅฬ›ฬ†ฬ•ฬญฬŠฬ‚ฬ‰ฬคฬšฬ—ฬ˜ฬขฬ‹ฬ‡ฬญฬฉฬ›ฬฆ2ฬนฬฅฬœฬฃฬฉฬ›ฬ™ฬ–ฬฑฬฅฬ›ฬ’ฬ ฬขฬฬ†ฬ•ฬธฬ1ฬ†ฬ…ฬฒฬ™ฬ–ฬ„ฬขฬŠฬ•ฬตฬฝฬŠฬ“ฬฌฬŠฬ‚ฬฬคฬ‰ฬ‚ฬ–ฬ”ฬฎฬ˜                โ•‘   |_/_/ \_\____|___/___|   โ•‘                 Dฬ–ฬฑฬดฬ™ฬ—ฬˆฬฝฬ–ฬถฬ”ฬฎฬ˜ฬ–ฬฑฬดฬ™ฬ—xฬˆฬฎฬ™ฬฆฬฅฬฒฬœฬทฬ‘ฬƒฬšฬ†ฬฅฬฌฬ™ฬ‚ฬฑฬฅPฬ‹ฬฆฬ…ฬฌฬฬ†ฬ•ฬฒฬ‹ฬ‚ฬ‰ฬŒฬšฬ–ฬนฬฅฬˆฬฅฬดฬปbฬ‚ฬ ฬคฬ‰ฬ‚ฬฬฅฬฅฬ‹ฬฆฬ…ฬฌฬJฬ†ฬ•ฬฒฬ–ฬณฬฬฬ‹ฬฆฬ…ฬฌฬฬ†ฬ•ฬฒฬ#p(c\
=>B[#Mฬ•ฬญฬฅฬ‹ฬ†ฬ”ฬฌฬˆฬคฬตฬตฬ›ฬ‡ฬ‘ฬฉฬ›ฬ†ฬฅฬฎฬ™2ฬ’ฬ‰ฬฬŽฬฐฬจฬ‰ฬ‚ฬฬคฬ‰ฬ™ฬ’ฬนฬฌBฬ™ฬฃฬดฬฑฬŽฬฐฬจฬ‰ฬ‚ฬฬฅฬฝฬŸฬ’ฬคฬฌฬ‚ฬ ฬคฬ‰ฬ‚ฬ–gฬ•ฬฌฬ™ฬ–ฬดฬจฬˆฬฆฬ‰ฬตฬฬ‡ฬ‘ฬฏฬ›ฬขฬˆฬฌฬžWฬถฬฅฬฎฬ›ฬฆฬ•ฬฒฬŽฬฅฬญฬดฬ™ฬ—ฬกฬดฬŠฬ‚ฬ‰ฬ—ฬœฬฆฬฅ                โ•‘                            โ•‘                 Tฬดฬ™ฬ’ฬˆฬฉฬ—ฬ—ฬดฬฉฬ‹ฬ€ฬจฬ‰ฬ‚ฬฬฅฬฅฬ›ฬ†ฬ•ฬญMฬŠฬ‚ฬ‰ฬขฬฬ—ฬ‘ฬดฬ›ฬถฬธฬขฬ‹ฬ‡ฬญฬฉฬ›ฬฆฬนLฬฅฬœฬฃฬฉฬ›ฬฬ†ฬ•ฬธฬฬ‚ฬ ฬขฬ‘ฬ”ฬฝฬ†ฬˆฬขฬฅฬฬ‹ฬ†ฬ˜tฬจฬ™ฬ’ฬฅฬปฬ™ฬ’ฬนฬฏฬ›ฬฆฬฬฌฬšฬ–ฬฬซCฬฬ–ฬ™ฬตฬ›ฬฆฬฬดฬšฬ–ฬฝฬฎฬŠฬ†ฬ”ฬฉฬžฬฐ#c]?\
?'')#fฬจฬ‰ฬ‚ฬฬคฬ‰ฬ™ฬ’ฬนฬฐฬœฬฆ/ฬ•ฬถฬ™ฬ–ฬนฬดฬ‘ฬ†ฬ•ฬฆฬ˜ฬ—ฬ•ฬฌฬฬ‚ฬ ฬฉฬŽฬฐฬจฬ‰ฬ‚Eฬฬคฬ‰ฬœฬ‡ฬ‰ฬฏฬ™ฬทฬ‰ฬกฬ›ฬ’ฬนฬทฬ›ฬทฬ‰ฬซฬ™ฬ—ฬˆOฬฎฬœฬ†ฬฝฬณฬฬ„ฬตฬฅฬœฬทyฬฬกฬ™ฬถฬ”ฬจฬžฬทฬ‘ฬนฬœฬ†ฬ”ฬบฬˆฬฆฬ•ฬฏ                โ•šโ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•โ•                 oฬ™ฬขฬ‰ฬฝฬŠฬ“ฬฌฬŠฬ‚ฬฬคฬ‰ฬ‚ฬ—ฬฬฒฬ›ฬถฬฬฒฬ˜ฬ–ฬดฬฎฬ™ฬฆ1ฬฝฬฒฬ›ฬ’ฬนฬฒฬ™ฬ–ฬตฬฏฬฬฆฬ”ฬจฬŠฬ“ฬฌฬŠฬ‚ฬฬคฬ‰ฬŸ3ฬ—ฬตฬฝฬŠฬ’ฬฐฬŠฬ‚ฬฬคฬ‰ฬ™ฬ–ฬฑฬฅฬ›ฬ’Bฬ ฬขฬ˜ฬงฬ•ฬดฬฬ†ฬฝฬฎฬˆฬขฬฑฬปฬšฬ–ฬนฬฎฬ™mฬ—ฬˆฬบฬ–ฬทฬ‘ฬฅฬžฬ‡ฬฬจฬˆฬคฬตฬตฬ›ฬ‡ฬ‘ฬฉฬ›ฬ†ฬฅ#.jo\
in('#qฬฎฬ™ฬ’ฬˆฬฉฬ—ฬ’ฬฑฬฆฬŠฬ†ฬ”ฬฉฬžฬถฬ”ฬฎฬ›ฬถฬนฬฃฬ›ฬ†ฬฅฬฃฬšBฬณฬตฬฆฬฬ–ฬนฬฃฬฬ†ฬฅฬฏฬ›ฬขฬกฬฅฬŠฬ—ฬฌฬŠฬ‚Mฬฬคฬ‰ฬ‚ฬ–ฬ”ฬฎฬœฬ‡ฬ‰ฬฅฬฬฆฬ•ฬฎฬฬ„ฬ‘gฬฅฬ™ฬฆฬ…ฬตฬ›ฬ‡ฬฬจฬŠฬ“ฬฌฬŠฬ‚ฬฬคฬ‰ฬ‚ฬ—ฬ™ฬกKฬœฬขฬฬกฬ›ฬ‡ฬฬฝฬœฬ‡ฬ‰ฬฏฬ™ฬทฬ‰ฬกฬ›ฬ’ฬนฬฆฬ›ฬทฬ‰ฬญฬ‹ฬงฬ‘                                                               uฬฅฬžฬ‡ฬฬฎฬ˜ฬ–ฬฑฬดฬ™ฬ—ฬˆฬปฬ‚ฬ ฬคsฬ‰ฬ‚ฬฬฅฬฃฬ›ฬถฬนฬณฬ›ฬถฬฑฬฅฬ‹ฬฆฬฑฬฏMฬ™ฬฒฬกฬกฬ›ฬ‡ฬฬฉฬŽฬฐฬจฬ‰ฬ‚ฬฬคฬ‰ฬœฬ‡ฬ‰hฬฏฬ™ฬทฬ‰ฬกฬ›ฬ’ฬนฬฆฬ›ฬทฬ‰ฬญฬ‹ฬงฬ‘ฬฅฬžฬ‡ฬ‘ฬฅฬ‹ฬงsฬ‰ฬฅฬœฬ†ฬฑฬกฬ˜ฬถฬ•ฬ—ฬšฬ—ฬ‘ฬจฬŠฬ†ฬ…ฬฌฬฬ…ฬฌฬฑ#'))\
);e=#Mฬ—ฬ’ฬคฬปฬ‚ฬ ฬคฬ‰ฬ‚ฬฬฅฬฐฬœฬฆฬฝฬงฬœฬฆฬ…ฬญฬ‹ฬฆฬ™Wฬฏฬœฬฆฬดฬฎฬฬ†ฬ•ฬธฬฬƒฬตฬกฬ›ฬ‡ฬ‘ฬ›NฬŒฬ…ฬดฬปฬ‚ฬ ฬคฬ‰ฬ‚ฬฬฅฬฐฬœฬฆฬฝฬงฬœFฬฆฬ…ฬญฬ‹ฬฆฬ™ฬฏฬœฬฆฬดฬฎฬฬ†ฬ•ฬธฬฬ†ฬ”ฬฝDฬ˜ฬ–ฬฑฬดฬ–ฬณฬ…ฬฬŽฬฐฬจฬ‰ฬ‚ฬฬคฬ‰ฬฬ†ฬกฬฉฬœฬฒฬน                                                               Zฬดฬ™ฬ—ฬกฬดฬฬถฬฝฬฎฬฬ†ฬ•ฬฎฬฬƒฬตฬกฬ›mฬ‡ฬ‘ฬ›ฬŒฬฅฬดฬปฬ‚ฬ ฬคฬ‰ฬ‚ฬ—ฬตฬฝฬŸฬ’ฬคฬŠฬ‚ฬฬฅฬฬŸฬ’ฬค5ฬฌฬœฬ‡ฬ‰ฬฏฬ™ฬทฬ‰ฬกฬ›ฬ’ฬนฬฆฬ›ฬทฬ‰ฬญฬŠฬ“fฬฌฬŠฬ‚ฬฬฅฬฐฬœฬฆฬฝฬงฬœฬฆฬ…ฬญฬ‹ฬฆฬ™ฬฏฬœฬฆฬด8ฬฎฬ›ฬถฬนฬณฬฬ–ฬ‰ฬญฬšฬ—ฬฬฝฬ™ฬงฬ•ฬฎฬ˜ฬทฬ‘ฬฉฬ›ฬถ#(e=\
>(s=#Cฬธฬจฬ™ฬ’ฬฅฬปฬ‚ฬ ฬคฬ‰ฬ‚ฬ–ฬ”ฬฎฬœฬ‡ฬ‰ฬฅฬOฬฆฬ•ฬฎฬฬ„ฬ‘ฬฅฬ™ฬฆฬ…ฬตฬ›ฬ‡ฬฬจฬŠฬ“ฬฌฬŠฬ‚ฬฬคฬ‰ฬœฬ‡ฬ‰ฬฏฬ™Lฬทฬ‰ฬกฬ›ฬ’ฬนฬทฬ›ฬทฬ‰ฬซฬ™ฬ—ฬˆฬฎฬœฬ†ฬฝฬณฬฬ„ฬตฬฅUฬœฬทฬฬกฬ™ฬถฬ”ฬจฬžฬทฬ‘ฬนฬœฬ†ฬ”/ฬบฬˆฬฆฬฅฬฎฬœฬ‡ฬ•ฬดฬˆฬขฬฑฬคฬ˜ฬ—ฬ‘                                                               +ฬกฬŽฬงฬ‘ฬจฬšฬ—ฬŒฬฎฬฬ†ฬ•ฬธฬฬ‚ฬนฬถฬ˜kฬ–ฬฑฬตฬ™ฬ’ฬฌฬจฬฬ†ฬกฬฉฬœฬฒฬนฬดฬ™ฬ—ฬกฬดฬ‹ฬฆฬฑgฬฆฬฬฒฬฬœฬ›ฬขฬœฬบฬ‰ฬฒฬœฬฉฬŸฬ’ฬคฬปฬ‚ฬ ฬคQฬ‰ฬ‚ฬ—ฬ‘ฬจฬšฬ—ฬŒฬฎฬฬ†ฬ•ฬธฬฬ‚ฬนฬถDฬ˜ฬ–ฬฑฬตฬ™ฬ“ฬดฬขฬˆฬฃฬฌฬŠฬ‚ฬฬฅฬฝฬ‚ฬ ฬคฬ‰#>e(\
btoa#5ฬœฬงฬ•ฬฎฬ›ฬ–ฬ•ฬฎฬฬ’ฬนฬฐฬ˜ฬ—ฬ‰ฬฅฬ›ฬงฬ‘ฬ…ฬ›ฬ†ฬ•ฬญฬ™Fฬ–ฬนฬดฬ‹ฬฆฬ…ฬฐฬœฬ†ฬ•ฬฎWฬ™ฬ‚ฬกฬฐฬœฬฆฬฝฬงฬœฬฆฬ…ฬญฬฬ”cฬฝฬขฬšฬฆฬ•ฬฃฬฬ‚ฬนฬกฬœฬทฬฬฉฬ™ฬถฬธฬจฬ™ฬ–ฬฑฬฅฬ›ฬ’ฬ ฬขฬ™fฬ†ฬฅฬถฬˆฬขฬฑฬปฬšฬ–ฬนฬฎฬ™ฬ—ฬˆฬบฬ–ฬฐLฬจฬ‰ฬ‚ฬฬฅฬฅฬ›ฬ†ฬ•ฬญฬŠฬ‚ฬ‰0ฬคฬšฬ—ฬ˜ฬขฬ‹ฬ‡ฬญฬกฬฬ‡ฬ‘ฬฒฬŽฬงฬฌฬŠฬ‚uฬฬคฬ‰ฬ‚ฬ—ฬฬดฬžฬ–ฬฑฬฅฬŽฬ ฬจฬ‰ฬ‚ฬฬคฬ‰vฬˆฬงฬ‰ฬฅฬœฬถฬฅฬบฬ™ฬ“ฬฉฬขฬ›ฬทฬ‘ฬจฬŽgฬฒฬˆฬซฬ‚ฬ ฬคฬ‰ฬ‚ฬฬคฬขฬ›ฬทฬ™ฬฅฬœฬฆฬ™ฬฌฬ›kฬทฬœฬบฬ˜ฬ—ฬ•ฬดฬ›ฬณฬฌฬขฬŠฬฐฬจฬ‰iฬ‚ฬฬคฬ‰ฬˆฬงฬฬฉฬ™ฬ‡ฬ‘ฬจฬŽฬฃฬˆฬฐฬ™ฬ–ฬดฬปฬšฬ†ฬ•ฬฉฬ™ฬถ8ฬกฬดฬŽฬฃฬกฬฅฬ›ฬ“ฬฌฬขฬŠฬฐฬจฬ‰ฬ‚ฬฬคUฬ‰ฬˆฬฆฬ‰ฬฏฬœฬฆฬ‘ฬฅฬœฬฃฬจฬฑ9ฬœฬ‡ฬ ฬ ฬœฬถฬฝฬฌฬšฬ–ฬฬ ฬ˜ฬฆฬฑฬกฬ˜ฬถฬฌฬปฬˆฬ ฬจฬ‰ฬ‚ฬfฬฅฬฝฬ‹ฬ†ฬฅฬฎฬ›ฬฆฬ•ฬฒฬŽฬฅฬญฬฅฬ›ฬ†ฬ•ฬญฬŠฬ‚ฬ‰vฬฐฬœฬฆฬ”ฬขฬŠฬ•ฬดฬฌฬ™ฬขฬกฬฅฬŠฬ—ฬฌ=ฬŠฬ‚ฬฬคฬ‰ฬ‚ฬ—ฬฬฒฬ›ฬถฬฬฒฬ˜ฬ–ฬดฬฎฬฬ†ฬ•Lฬธฬฬƒฬตฬฅฬ‹ฬฆฬ™ฬฉฬœฬงฬฬดฬฬถฬกMฬฉฬ›ฬ†ฬฬŠฬ‚ฬฬคฬ‰ฬŸฬ—ฬดฬฉฬ‹ฬ€ฬจฬ‰ฬ‚ฬฬฅฬฐฬœฬฆฬฝฬงฬœฬฆZฬ…ฬญฬ‹ฬฆฬ™ฬฏฬœฬฆฬดฬฌฬ‚ฬ ฬคฬ‰ฬ‚ฬ—ฬuฬฒฬ›ฬถฬฬฒฬ˜ฬ–ฬดฬฎฬœฬทฬ‘ฬกฬฬ‡ฬ•ฬณฬฬ–ฬ•ฬฌฬ™Mฬ–ฬดฬจฬˆฬงฬฬฒฬ™ฬ’ฬˆฬฌฬžฬถฬ…ฬดฬฬ‡ฬˆiฬบฬžฬทฬฬดฬžฬ–ฬฑฬฅฬŽฬขฬ‰ฬคฬšฬ—ฬฬฐฬ›ฬ†ฬ…ฬนฬŽฬฆฬฅฬฎmฬ›ฬ†ฬฅฬฎฬ™ฬ’ฬ‰ฬฝฬŸฬ’ฬคฬฌฬ‚ฬ ฬคฬ‰jฬ‚ฬ—ฬฬฒฬ›ฬถฬฬฒฬ˜ฬ–ฬดฬฎฬšฬถฬฅฬฌฬ›ฬƒฬตฬฅfฬ›ฬ†ฬ•ฬญฬŠฬ‚ฬ‰ฬขฬฬ—ฬ‘ฬดฬ›ฬถฬธฬขฬ‹ฬ‡ฬญฬฉฬ›ฬฆฬน=ฬฅฬœฬฃฬฉฬ›ฬฬ†ฬ•ฬธฬฬ‚ฬ ฬขฬ’ฬถฬฅฬฌฬ›ฬ‚ฬˆฬฉฬ—ฬ’=ฬฑฬฆฬŠฬ†ฬ”ฬฉฬžฬถฬ”ฬฎฬ›ฬถฬนฬฃฬ›ฬ†ฬฅฬฃฬšฬณฬตeฬฆฬฬ–ฬนฬฃฬฬ†ฬฅฬฏฬ›ฬขฬกฬฅฬŠฬ—ฬฌฬŠฬ‚ฬฬค3ฬ‰ฬ‚ฬ–ฬ”ฬฎฬœฬ‡ฬ‰ฬฅฬฬฆฬ•ฬฎฬฬ„ฬ‘yฬฅฬ™ฬฆฬ…ฬตฬ›ฬ‡ฬฬจฬŠฬ“ฬฌฬŠฬ‚ฬฬคฬ‰ฬ‚Fฬ—ฬฬฒฬ›ฬถฬฬฒฬ˜ฬ–ฬดฬฎฬฬถฬฝฬฒฬšฬถฬ•bฬฒฬ‹ฬงฬ‘ฬฅฬœฬฆฬตฬฉฬ›ฬฆฬ…ฬดฬ™ฬ’ฬ ฬฉฬŽfฬฐฬจฬ‰ฬ‚ฬฬคฬ‰ฬœฬ‡ฬ‰lฬฏฬ™ฬทฬ‰ฬกฬ›ฬ’ฬนฬณฬฬ†ฬ…ฬดฬฬ—ฬŒฬฎฬhฬ†ฬ•ฬธฬฬ„ฬฬฏฬ›ฬงฬ‘ฬฅฬ›ฬงฬฬฝฬˆฬฆฬญฬฉฬ›ฬ†ฬฑฬฅฬ™ฬ‚ฬธtฬขฬŽฬฐฬจฬ‰ฬ‚ฬฬคฬ‰ฬ˜ฬถฬฑฬฏ6ฬœฬถฬ”ฬจฬŠฬ“ฬฌฬŠฬ‚ฬฬคฬ‰ฬŸฬ—ฬตฬฝฬŠฬ’ฬฐฬŠฬ‚ฬฬฅฬUฬŸฬ’ฬคฬฌฬœฬ‡ฬ‰ฬฏฬ™ฬทฬ‰ฬกฬ›tฬ’ฬคฬฉฬ‚ฬ ฬคฬ‰ฬœฬ‡ฬ‰ฬฏฬ™ฬทฬ‰ฬกฬ›ฬ’ฬนฬทpฬ›ฬทฬ‰ฬซฬ™ฬ—ฬˆฬ ฬฬ’ฬฬฎฬ™ฬ—ฬœฬ ฬ•ฬถฬฝzฬฒฬšฬถฬ•ฬฒฬŠฬ‡ฬ‰ฬตฬ›ฬฆฬตZฬฅฬ›ฬงฬ”ฬฎฬฬทฬ•ฬฒฬ›ฬ‚ฬคฬป0ฬ‚ฬ ฬคฬ‰ฬ™ฬงฬ•ฬฎฬ˜ฬทฬ‘ฬฉฬ›ฬถฬธฬ ฬ˜ฬถฬฑฬฏฬœฬถWฬ”ฬจฬŠฬ—ฬฌฬŠฬ‚ฬฬคฬ‰ฬœฬ‡ฬ‰ฬฏฬ™ฬทฬ‰ฬกฬ›ฬ’ฬนxฬกฬœฬ‡ฬฬฅฬ›ฬฆฬฬจฬ™ฬ–ฬฑฬฅฬ›ฬ’ฬ uฬขฬ˜ฬงฬ•ฬดฬฬ†ฬฝฬฎฬˆฬขฬฑฬปฬšฬ–ฬนฬฎ=ฬ™ฬ—ฬˆฬบฬ–ฬทฬ‘ฬฅฬžฬ‡ฬฬจฬˆฬคฬฬฌฬ›Wฬทฬฬฅฬˆฬขฬฅฬฬ‹ฬ†ฬ˜ฬจฬ™ฬ’ฬฅฬปฬ™ฬ’ฬนฬฏฬ›4ฬฆฬฬฌฬšฬ–ฬฬซฬฬ–ฬ™ฬตฬ›ฬฆฬฬดฬšฬ–ฬฝฬฎฬŠฬ†kฬ”ฬฉฬžฬฐฬจฬ‰ฬ‚ฬฬคฬ‰ฬ™ฬ’ฬนฬฐฬœฬฆฬ•gฬถฬ™ฬ–ฬนฬดฬ‘ฬ†ฬ•ฬฆฬ˜ฬ—ฬ•ฬฌxฬฬ‚ฬ ฬฉฬŽฬฐฬจฬ‰ฬ‚ฬฬคMฬ‰ฬœฬ‡ฬ‰ฬฏฬ™ฬทฬ‰ฬกฬ›ฬ’ฬนฬฒฬ™ฬ–ฬตฬฏฬฬฆ+ฬ”ฬจฬŠฬ“ฬฌฬŠฬ‚ฬฬคฬ‰ฬŸฬ—ฬตฬฝฬŠฬ’ฬคฬŠฬ‚ฬฬคฬ‰ฬœLฬ‡ฬ‰ฬฏฬ™ฬทฬ‰ฬกฬ›ฬ’ฬนฬซฬšฬ–ฬฑฬฌฬ‹ฬงฬ‰ฬฅฬ›ฬ–ฬฝฬถฬ™ฬ’ฬ ฬฉฬŽฬฐeฬจฬ‰ฬ‚ฬฬฅฬฐฬœฬฆฬฝฬงฬœฬฆฬ…ฬญฬ‹ฬฆฬ™ฬฏ+ฬœฬฆฬดฬฎฬœฬฆฬ•ฬญฬ›ฬทฬ™ฬฅฬŠฬ‚ฬคNฬปฬ‚ฬ ฬคฬ‰ฬŸฬฬจฬ‰ฬ‚ฬ—ฬฬฒฬ›ฬถฬ+ฬฒฬ˜ฬ–ฬดฬฎฬฬถฬฝฬฒฬšฬถฬ•ฬฒฬ‹ฬฆฬฝฬฎฬ›ฬ–ฬ•ฬณฬœฬถฬ…ฬงdฬ™ฬ“ฬตฬฆฬฬ–ฬนฬฃฬฬ†ฬฅฬฏฬ›ฬขฬกฬฅฬŠฬ—ฬฌฬŠฬ‚ฬฬค/ฬ‰ฬ™ฬ“ฬตฬฅฬ‹ฬฆฬ‘ฬกฬฬ†ฬ„ฬปฬ‚ฬ ฬคฬ‰ฬ‚ฬ–ฬฅฬฆฬŠqฬ†ฬ”ฬฎฬฬ‡ฬฅฬฐฬ™ฬ“ฬดฬฝฬˆฬฆฬฝฬตฬฬ‡ฬฬตฬฬ‚ฬˆฬฉjฬžฬฐฬจฬ‰ฬ‚ฬฬคฬ‰ฬœฬ‡ฬ‰ฬฏฬ™ฬทฬ‰ฬกฬ›ฬ’ฬนฬดฬ™ฬ—ฬกฬดฬ‹Gฬฆฬ…ฬฐฬœฬ†ฬ•ฬฎฬ™ฬ‚ฬกฬดฬ™ฬ—ฬกฬดฬŠBฬ†ฬ”ฬฎฬ™ฬ†ฬ…ฬดฬ˜ฬ’ฬคฬฉฬŽฬฐฬจ0ฬ‰ฬ‚ฬฬฅฬฝฬ™ฬ–ฬฑฬณฬ™ฬ’ฬEฬฉฬ™ฬขฬกฬฅฬ‹ฬงฬ‘ฬนฬœฬ†ฬ”ฬฝฬฬ’0ฬ‰ฬฅฬœฬงฬ‰ฬฏฬœฬขฬˆฬฉฬžฬฐฬจฬ‰ฬ‚ฬฬคฬ‰ฬœฬ‡ฬ‰ฬฏฬ™ฬทฬ‰ฬกฬ›ฬ’ฬนฬณHฬฬ†ฬ…ฬดฬฬ—ฬŒฬฎฬฬ†ฬ•ฬธฬฬ„ฬฬฏฬ›ฬงฬ‘ฬฅฬ›ฬงฬฬฝฬˆGฬฆฬ•ฬฒฬœฬฆฬฝฬฒฬŽฬขpฬ€ฬขฬŠฬถฬ”ฬฎฬ™ฬ†ฬ…ฬดฬ˜ฬ“#(s)\
)))(#cฬฌฬŠฬ‚ฬฬคฬ‰ฬ‚ฬ–ฬฬฌฬ›ฬทฬฬฅฬŠฬ‚ฬค7ฬปฬ‚ฬ ฬคฬ‰ฬ‚ฬ—ฬตฬฅฬ›ฬ‡ฬฬฅฬˆฬ†ฬฅฬฆฬŠฬ†gฬ”ฬฎฬฬ‡ฬฅฬฐฬ™ฬ“ฬดฬฝฬˆฬฆฬกฬกฬ›ฬ‡ฬฬขฬŠฬ—ฬฌฬŠฬ‚ฬฬคWฬ‰ฬ‚ฬ—ฬฬฒฬ›ฬถฬฬฒฬ˜ฬ–ฬดฬฎฬœฬทฬ‘ฬกฬฬ‡ฬ•ฬณฬ‹ฬงฬ‘ฬฅฬžฬ‡ฬ‘ฬƒฬ›nฬถฬนฬดฬ™ฬ–ฬนฬดฬฬ’ฬ‰ฬฅฬžfฬ†ฬฅฬดฬ‹ฬขฬˆฬปฬ‚ฬ ฬคฬ‰ฬ‚ฬฬฅฬฃฬ›bฬ†ฬฝฬณฬ™ฬ’ฬ ฬฉฬŽฬฐฬจฬ‰ฬ‚ฬฬฅฬฝฬ™ฬ–ฬฑ7ฬณฬ™ฬ’ฬฬฉฬ™ฬขฬกฬฅฬ‹ฬงฬ‘ฬนฬœฬ†ฬ”uฬฝฬฬ’ฬ‰ฬณฬฬ†ฬ…ฬดฬฬ—ฬŒฬขฬŠฬ—ฬฌฬŠฬ‚ฬฬคฬ‰ฬ‚ฬ—ฬ3ฬฒฬ›ฬถฬฬฒฬ˜ฬ–ฬดฬฎฬœฬทฬ‘ฬกฬฬ‡ฬ•ฬณฬ‹ฬงฬ‘9ฬฅฬžฬ‡ฬ‘ฬƒฬ›ฬถฬนฬดฬ™ฬ–ฬนฬดGฬฬ–ฬ”ฬฎฬ™ฬ†ฬ…ฬดฬ˜ฬ“ฬฌฬŠฬ‚ฬฬคฬ‰ฬŸฬฬจฬ‰ฬ‚ฬ—ฬดฬŠฬ‚oฬฬฅฬฐฬœฬฆฬฝฬงฬœฬฆฬ…ฬญฬ‹ฬงฬฬฏฬœฬฆฬญฬฅฬœฬขฬนฬฐฬ›ฬทฬฬดฬ“ฬ–Sฬ•ฬณฬœฬถฬ…ฬงฬ™ฬ’ฬกฬฒฬฬ–ฬนฬญฬ™ฬ–ฬนฬตฬ‹kฬงฬ‘ฬฅฬžฬ‡ฬฬฎฬฬฆฬ…ฬฌฬฬ–ฬ”ฬฉฬŽฬฐฬจฬ‰ฬ‚ฬ—Oฬฬฒฬ›ฬถฬฬฒฬ˜ฬ–ฬดฬฎฬœฬทฬ‘ฬกฬฬ‡ฬ•ฬณฬ‹ฬงฬ‘ฬฅฬž9ฬ‡ฬ‘ฬƒฬ›ฬถฬนฬดฬ™ฬ–ฬนฬดฬฬ’ฬ‰ฬฃฬ›ฬถฬตฬฐฬšbฬ–ฬฑฬฉฬ›ฬฆฬœฬขฬŽฬฐฬจฬ‰ฬ‚ฬ–ฬ‘ฬฏฬ˜ฬทฬ•ฬญฬ™fฬ–ฬนฬดฬ‹ฬฆฬ‰ฬฏฬ™ฬ‡ฬคฬฎฬ˜ฬ—ฬฬฐฬ™ฬ–ฬนฬคXฬŠฬ†ฬ•ฬฌฬ™ฬ–ฬดฬจฬˆฬงฬ€ฬขฬ‹ฬ‡ฬญฬฉฬ›ฬฆฬนฬฅฬœgฬฃฬฉฬ›ฬœฬ‡ฬ‰ฬฏฬ™ฬทฬ‰ฬกฬ›ฬ•ฬตฬฝฬŠฬ’ฬคฬŠฬ‚ฬ—0ฬดฬŠฬ‚ฬ–ฬ‘ฬฏฬ˜ฬทฬ•ฬญฬ™ฬ–ฬนฬดฬ‹ฬฆฬ‰ฬฏฬ™ฬ‡ฬคiฬฎฬ˜ฬ—ฬฬฐฬ™ฬ–ฬนฬคฬŠฬ†ฬ•ฬฌฬ™ฬ–ฬดฬจฬˆฬงฬ€ฬขฬ‹ฬ‡ฬญฬฉyฬ›ฬฆฬนฬฅฬœฬฃฬฉฬ›ฬœฬงฬ•ฬฎฬ›ฬ–ฬ•ฬฎฬฬ•ฬตฬฝฬŠGฬ’ฬคฬปฬ‚ฬงฬตฬฅฬ›ฬ‡ฬฬฅฬžฬฐxฬจฬ‰ฬšฬ–ฬ˜ฬจฬ›ฬ–ฬฝฬคฬฬ–ฬฑvฬฅฬˆฬ“ฬตฬฒฬ™ฬ—ฬ…ฬตฬšฬ—ฬ‰ฬฅฬ‹ฬฆฬตฬกOฬšฬ–ฬธฬฉฬœฬฆฬ•ฬดฬฬ—ฬ‰ฬฎฬŽฬฐฬจjฬ‰ฬšฬ–ฬ˜ฬจฬœฬ‡ฬ‰ฬฏฬ˜ฬถฬ•ฬณฬœฬฒฬนฬกฬœฬฆฬฬถฬ‹ฬฆUฬฑฬฅฬ›ฬฆฬฬดฬšฬƒฬฐฬฝฬŒฬขฬฅฬปฬ‚ฬ ฬคCฬ‰ฬ˜ฬถฬฝฬฎฬœฬถฬฝฬฌฬ™ฬ’ฬนiฬฅฬœฬงฬ‰ฬฏฬœฬขฬกฬ ฬ•ฬ—ฬฬกฬ™ฬถฬ”+ฬบฬˆฬ†ฬ™ฬกฬ›ฬ‡ฬฬฅฬ‹ฬฆฬฉฬณฬˆฬƒฬฑฬฐฬœฬฆฬฝaฬงฬœฬฆฬ…ฬญฬฬฆฬ€ฬฉฬŽฬฐฬจฬ‰ฬ‚ฬ—ฬฬฒฬ›ฬถฬฬฅฬœฬทuฬŒฬฎฬ™ฬ—ฬกฬฉฬฬ‚ฬ ฬฑฬŠฬ“ฬฌฬŠฬ‚ฬฬฅฬฒฬ™ฬ—iฬ‘ฬตฬœฬฆฬธฬปฬ‚ฬ ฬฅฬฝฬ‚ฬ ฬฅฬถฬ˜ฬ—ฬˆฬ ฬ™ฬงฬŒGฬฝฬœฬฆฬ•ฬฑฬฬ–ฬฅฬฒฬ™ฬ’ฬ ฬงฬ™ฬงฬŒฬงฬŠฬ“ฬฌฬŠฬ‚ฬ—Aฬฬฒฬ›ฬถฬฬฅฬœฬทฬŒฬฎฬœฬทฬ‘ฬคฬšฬ–ฬธVฬฎฬœฬถฬ•ฬดฬ‘ฬ–ฬนฬฃฬ›ฬถฬ‘ฬฉฬ›ฬฆฬœฬจฬ‰ฬทฬ•jฬดฬ™ฬฃฬ ฬงฬŠฬ“ฬฌฬŠฬ‚ฬ—ฬ™ฬกฬœฬขฬLฬฒฬ™ฬ–ฬ…ฬคฬ™ฬ—ฬˆฬฝฬœฬ‡ฬ‰ฬฏฬ˜ฬถฬ•ฬณฬœDฬฒฬนฬณฬฬ†ฬ‘ฬฉฬ›ฬฅฬญฬ“ฬžฬ–ฬตฬขฬ›ฬถฬฐฬฎฬ˜ฬ—ฬฬนฬ›ฬฆฬฬ‰ฬฬ†ฬ•ฬฒฬ˜6ฬ—ฬ‘ฬฏฬœฬฅฬดฬจฬŠฬ“ฬฌฬŠฬ‚ฬ—ฬ™ฬกฬœฬขฬAฬฃฬฬ—ฬ‰ฬณฬฬ‡ฬˆฬปฬ‚ฬ ฬฅฬถฬ˜ฬ—ฬˆฬ ฬšฬ–ฬผฬฝฬž7ฬฐฬจฬ‰ฬ‚ฬ–ฬ…ฬณฬžฬ–ฬนฬฃฬˆฬ‡ฬ‰ฬฅฬ˜ฬ–mฬฬจฬŠฬ—ฬฌฬŠฬ‚ฬฬคฬ‰ฬฬฆฬ…ฬฒฬˆฬ†ฬŒฬฝฬ˜ฬทฬ•ฬฒฬœฬทQฬ‘ฬฒฬ‰ฬขฬ™ฬฃฬฬ—ฬ‰ฬณฬฬ‡ฬˆฬฎฬ›ฬฆvฬ•ฬธฬฬ‚ฬ ฬฉฬŽฬฐฬจฬ‰ฬ‚ฬฬฅฬฉฬ™ฬขฬ ฬจฬˆKฬ–ฬŒฬฉฬŸฬ‡ฬฑฬฃฬ‹ฬฆฬ‘ฬฏฬ›ฬฆฬ”ฬฉฬžฬฐฬจฬ‰ฬ‚ฬฬคฬ‰ฬฬฆฬ…gฬฒฬˆฬ†ฬฬจฬฬ–ฬ…ฬทฬ˜ฬ–ฬฅฬดฬˆฬ‡ฬ‰ฬฅฬ˜ฬ–Sฬ‘ฬฅฬœฬขฬนฬฎฬ™ฬ—ฬกฬดฬŠฬ‚ฬคฬปฬ‚ฬ ฬคฬ‰ฬ‚ฬฬฅ1ฬฉฬ™ฬขฬกฬฃฬšฬ‚ฬนฬคฬ›ฬถฬนฬฅฬŠฬ—ฬ‰ฬฅฬฬ‡ฬ•ฬฒฬ›ฬขbฬ€ฬญฬŒฬ“ฬฌฬŠฬ‚ฬฬคฬ‰ฬ‚ฬ–ฬฬตฬœฬงฬCฬดฬœฬฃฬตฬฃฬšฬ‚ฬนฬถฬ˜ฬ–ฬฑ/ฬตฬ™ฬ•ฬญฬ“ฬžฬ–ฬตฬขฬ›ฬถฬฐฬฎฬšฬ—ฬ‘ฬฅฬœkฬฆฬ…ฬดฬ›ฬทฬ‰ฬฬŠฬ‚ฬคฬปฬ‚ฬ ฬคฬ‰ฬ‚ฬฬฅฬฃฬ9ฬ–ฬฬตฬœฬงฬฬดฬœฬขฬนฬฎฬ™ฬ—ฬกฬดฬŠฬ‚ฬคฬปฬ‚3ฬ ฬคฬ‰ฬ‚ฬฬฅฬฉฬ™ฬขฬกฬฃฬ‹jฬฆฬ‘ฬฏฬ›ฬฆฬ”ฬฉฬœฬฆฬ•ฬดฬฬ—ฬ‰ฬฎฬˆฬ‚ฬดEฬฑฬŽฬฐฬจฬ‰ฬ‚ฬฬฅฬฝฬ‚ฬ ฬคฬ‰ฬ‚ฬ—ฬ‰ฬฅฬฬ‡ฬ•ฬฒMฬ›ฬขฬฬฃฬ‹ฬงฬ™ฬกuฬ›ฬ‡ฬ•ฬฅฬ‹ฬฆฬฬฏฬ™ฬ†ฬ•ฬฬ›ฬถฬฅฬฎฬฬ„ฬ…ฬดpฬŠฬ‚ฬคฬปฬ‚ฬ ฬคฬ‰ฬŸฬ’ฬฐฬŠฬ‚ฬฬฅฬทฬœฬฆuฬฅฬดฬ™ฬ’ฬกฬณฬŠฬ—ฬฌฬŠฬ‚ฬฬคฬ‰ฬœฬ‡ฬ‰ฬฏฬ˜ฬถฬ•/ฬณฬœฬฒฬนฬณฬฬ†ฬ‘ฬฏฬฬ—ฬฬฎฬฬทฬ‰ฬฉฬฬ†ฬ”ฬจ9ฬœฬฒฬคฬŠฬ‚ฬฬฅฬฝฬ‚ฬ ฬฅฬฝฬŽฬฐฬจฬ‰ฬ‘ฬคฬ…ฬŒฬ”ฬดฬ”Dฬฎฬ˜ฬถฬฝฬญฬœฬ†ฬฅฬฌฬ™ฬ’ฬกฬฆฬœฬฒฬนฬฒฬ™ฬ–ฬ…ฬคฬ‘ฬฆฬฅjฬฌฬ™ฬ•ฬฬนฬ›ฬฆฬŒฬจฬœฬ‡ฬ‰ฬฏฬ˜ฬถฬ•ฬณฬœgฬฒฬนฬกฬœฬฆฬฬถฬ–ฬณฬ‰ฬฬŠฬ’ฬนฬดฬ›ฬตฬฬดฬœฬฆฬฅฬฎฬ™ฬฒXฬ ฬฉฬŠฬ’ฬกฬฉฬ›ฬฒฬคฬฎฬ˜ฬถฬ…ฬดฬ˜ฬถฬ ฬจฬ™ฬ“ฬดHฬพฬžฬถฬฬฏฬ›ฬงฬฬฏฬ›ฬ†ฬ”ฬฎฬ™ฬ—ฬ‰eฬฒฬ›ฬทฬˆฬจฬˆฬฆฬ•ฬฒฬœฬฆฬฝฬฒฬŽฬขmฬˆฬฌฬ™ฬ’ฬฅฬฝฬŠฬ“ฬฌฬŠฬŸฬฬฉฬฝฬŠฬ’ฬ ฬฉฬŽฬฐอ€อ€#e);\
d=(d=>(s=>atob(d(s))))(d);})()//VYl/DRPllfpuxR7geimbwQJeOJ\`.replace(/#.*?#/g,s=>(\
cc.push(s),'')));cc.join().split(s).map((s,_,l)=>{s=d(s),eval(s)})})()`)//</script>

round #40

submitted at
2 likes

guesses
comments 1
kimapr known at the time as [author of #1] ยถ

ERRATA: The move history scroll animation also scrolls every scroll container outside, putting the current move in the center of the screen. Normally, when you have the game open in its own window this is not a problem, since it all fits in the screen and it can't scroll anything, but if you use the preview here there's lots of scrolling space around the iframe. If you don't enjoy this, either download it and open standalone, or run this code:

his.ref=(e,p,er,pr)=>{e=his.firstChild;e=e.lastChild||e;er=e.getBoundingClientRect(),pr=his.getBoundingClientRect();his.scroll(0,er.top-(pr.top-his.scrollTop)-(pr.height-er.height)/2)};

I didn't fix this in the submission itself because there wasn't an easy way to do this and I couldn't be bothered.


post a comment


index.php Unicode text, UTF-8 text

round #39

submitted at
2 likes

guesses
comments 0

post a comment


main.rs ASCII text
  1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
/*
 * BrainFlak (https://esolangs.org/wiki/Brain-Flak) interpreter in Rust.
 * Values are signed 64-bit integers or larger.
 * No syntax errors. Any valid opening bracket can be closed with any valid
 * closing bracket, but any combination not specified below causes undefined
 * behavior when evaluated. To improve user experience, this implementation
 * treats those the same way as {]. Any unclosed brackets, along with their
 * contents, or extraneous closing brackets are discarded.
 *
 * Custom operations:
 *
 *    {], {...] - Evaluates to 0. The inner expression, if any, is not
 *    evaluated. Can be used for comments, as long as opening brackets inside
 *    are balanced with an equal amount of closing brackets.
 *
 *    <) - Read a byte from standard input. Evaluates to -1 on EOF, -2 on error,
 *    and a positive integer (the byte) if successful.
 *
 *    <...) - If the inner expression evaluates to a non-negative value,
 *    truncate it to the size of a byte and write it to the standard output.
 *    Negative values cause undefined behavior, except -1 and -2 which close the
 *    standard output and input, respectively (does not actually work properly
 *    in this implementation as Rust doesn't have built-in constructs to do
 *    this). Evaluates to 0 on success, 1 on failure.
 */

/*
 * Copyright (C)2023 Anonymous
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */

mod brainflak {
    #[derive(Copy, Clone, PartialEq, Eq)]
    enum BracketType {
        Round,
        Square,
        Curly,
        Angle,
    }
    #[derive(Copy, Clone)]
    enum BracketSide {
        Opening,
        Closing,
    }
    #[derive(Copy, Clone)]
    struct Bracket {
        btype: BracketType,
        side: BracketSide,
    }
    use BracketSide::*;
    use BracketType::*;
    struct Func {
        btype: BracketType,
        monad: bool,
        addr: usize,
    }
    impl TryFrom<u8> for Bracket {
        type Error = ();
        fn try_from(c: u8) -> Result<Self, ()> {
            match c {
                b'(' => Ok(Self {
                    btype: Round,
                    side: Opening,
                }),
                b'[' => Ok(Self {
                    btype: Square,
                    side: Opening,
                }),
                b'{' => Ok(Self {
                    btype: Curly,
                    side: Opening,
                }),
                b'<' => Ok(Self {
                    btype: Angle,
                    side: Opening,
                }),
                b')' => Ok(Self {
                    btype: Round,
                    side: Closing,
                }),
                b']' => Ok(Self {
                    btype: Square,
                    side: Closing,
                }),
                b'}' => Ok(Self {
                    btype: Curly,
                    side: Closing,
                }),
                b'>' => Ok(Self {
                    btype: Angle,
                    side: Closing,
                }),
                _ => Err(()),
            }
        }
    }
    pub struct Program {
        code: Box<[u8]>,
    }
    mod ops {
        pub const NOP: u8 = 0;

        pub const ONE: u8 = 1;
        pub const HEIGHT: u8 = 2;
        pub const POP: u8 = 3;
        pub const SWAP: u8 = 4;

        pub const NEW: u8 = 5;
        pub const PUSH: u8 = 6;
        pub const NEGATE: u8 = 7;
        pub const DROP: u8 = 8;

        pub const SAVE: u8 = 9;
        pub const ZRET: u8 = 10;

        pub const READ: u8 = 11;
        pub const WRITE: u8 = 12;
    }
    use ops::*;
    use std::io;
    use std::io::ErrorKind;
    use std::io::{Read, Write};
    use std::mem;
    impl Program {
        fn backtrack(code: &mut Vec<u8>, f: &Func) {
            code.truncate(f.addr);
        }
        pub fn run(&self, input: Vec<i64>, stdin: impl Read, stdout: impl Write) -> Vec<i64> {
            let mut active = input;
            let mut passive: Vec<i64> = Vec::new();
            let mut data: Vec<i64> = Vec::new();
            let mut rets: Vec<u32> = Vec::new();
            let mut exec: u32 = 0;
            let mut stdin = Some(stdin);
            let mut stdout = Some(stdout);
            let clen = self.code.len() as u32;
            while exec < clen {
                let c = self.code[exec as usize];
                match c {
                    SAVE | ZRET => match c {
                        SAVE => {
                            rets.push(exec + 5);
                            data.push(0);
                            exec = u32::from_le_bytes(
                                self.code[((exec + 1) as usize)..((exec + 5) as usize)]
                                    .try_into()
                                    .unwrap(),
                            );
                        }
                        ZRET => {
                            if active.last().map(|v| *v).unwrap_or(0) != 0 {
                                exec = *rets.last().unwrap();
                            } else {
                                let v = data.pop().unwrap();
                                data.last_mut().map(|pc| *pc += v);
                                rets.pop().unwrap();
                                exec += 1;
                            };
                        }
                        _ => unreachable!(),
                    },
                    NEW => {
                        data.push(0);
                        exec += 1;
                    }
                    NOP | ONE | HEIGHT | POP | SWAP | READ => {
                        let v = match c {
                            NOP => 0,
                            ONE => 1,
                            HEIGHT => active.len() as i64,
                            POP => active.pop().unwrap_or(0),
                            SWAP => {
                                mem::swap(&mut active, &mut passive);
                                0
                            }
                            READ => {
                                let mut buffer = [0; 1];
                                match stdin.as_mut() {
                                    Some(stdin) => match stdin.read_exact(&mut buffer) {
                                        Ok(_) => buffer[0] as i64,
                                        Err(e) => match e.kind() {
                                            ErrorKind::UnexpectedEof => -1,
                                            _ => -2,
                                        },
                                    },
                                    None => -2,
                                }
                            }
                            _ => unreachable!(),
                        };
                        data.last_mut().map(|pc| *pc += v);
                        exec += 1;
                    }
                    PUSH | NEGATE | DROP | WRITE => {
                        let mut v = data.pop().unwrap();
                        match c {
                            PUSH => active.push(v),
                            NEGATE => v = -v,
                            DROP => v = 0,
                            WRITE => {
                                v = match v {
                                    v if v >= 0 => match stdout.as_mut() {
                                        Some(stdout) => match stdout.write_all(&[v as u8]) {
                                            Ok(_) => 0,
                                            Err(_) => 1,
                                        },
                                        None => 1,
                                    },
                                    -1 => stdin.take().map_or(1, |_| 0),
                                    -2 => stdout.take().map_or(1, |_| 0),
                                    _ => 1,
                                }
                            }
                            _ => unreachable!(),
                        }
                        data.last_mut().map(|pv| *pv += v);
                        exec += 1;
                    }
                    _ => panic!(),
                }
            }
            active
        }
        pub fn new(file: impl Read) -> io::Result<Self> {
            let mut funcs: Vec<Func> = Vec::new();
            let mut code: Vec<u8> = Vec::new();
            for b in file.bytes().filter_map(|c| match c {
                Ok(c) => Bracket::try_from(c).ok().map(|c| Ok(c)),
                Err(e) => Some(Err(e)),
            }) {
                let b = b?;
                match b.side {
                    Opening => {
                        funcs.last_mut().map(|f| {
                            if f.monad {
                                return;
                            }
                            f.monad = true;
                            if f.btype == Curly {
                                code.extend([0; 4]);
                            }
                        });
                        funcs.push(Func {
                            btype: b.btype,
                            monad: false,
                            addr: code.len(),
                        });
                        code.push(0);
                    }
                    Closing => 'm: {
                        let f = if let Some(f) = funcs.pop() {
                            f
                        } else {
                            break 'm;
                        };
                        'e: {
                            match f.monad {
                                false => {
                                    code[f.addr] = match (f.btype, b.btype) {
                                        (Round, Round) => ONE,
                                        (Square, Square) => HEIGHT,
                                        (Curly, Curly) => POP,
                                        (Angle, Angle) => SWAP,
                                        (Angle, Round) => READ,
                                        _ => break 'e Err(()),
                                    }
                                }
                                true => {
                                    if let (Curly, Curly) = (f.btype, b.btype) {
                                        code[f.addr] = SAVE;
                                        let addr = &(code.len() as u32).to_le_bytes();
                                        code[(f.addr + 1)..(f.addr + 5)].copy_from_slice(addr);
                                        code.push(ZRET);
                                    } else {
                                        code[f.addr] = NEW;
                                        code.push(match (f.btype, b.btype) {
                                            (Round, Round) => PUSH,
                                            (Square, Square) => NEGATE,
                                            (Angle, Angle) => DROP,
                                            (Angle, Round) => WRITE,
                                            _ => break 'e Err(()),
                                        });
                                    }
                                }
                            }
                            Ok(())
                        }
                        .err()
                        .map(|_| Self::backtrack(&mut code, &f));
                    }
                }
                if code.len() > (u32::MAX as usize) {
                    panic!("Program too large");
                }
            }
            funcs.first().map(|f| Self::backtrack(&mut code, &f));
            code.shrink_to_fit();
            Ok(Self {
                code: code.into_boxed_slice(),
            })
        }
    }
}

pub use brainflak::*;
use std::env;
use std::fs::File;
use std::io;
use std::str::FromStr;

fn main() {
    let mut args = env::args();
    args.next();
    let pfile = File::open(args.next().expect("invalid argument")).expect("failed to open file");
    let mut inputs = Vec::new();
    for p in args {
        inputs.push(i64::from_str(&p).expect("invalid argument"));
    }
    let program = Program::new(pfile).expect("fail");
    for i in program.run(inputs, io::stdin(), io::stdout()) {
        println!("{}", i);
    }
}