<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Rust on Locus Solus | Nagi's Blog</title><link>https://x-nagi.com/tags/rust.html</link><description>Recent content in Rust on Locus Solus | Nagi's Blog</description><generator>Hugo</generator><language>en-US</language><lastBuildDate>Mon, 06 Jun 2022 01:34:24 -0400</lastBuildDate><atom:link href="https://x-nagi.com/tags/rust/index.xml" rel="self" type="application/rss+xml"/><item><title>Fixing A Rust Binary (Hack-A-Sat 2022 Once Unop a Djikstar)</title><link>https://x-nagi.com/post/has2022-rust-patching.html</link><pubDate>Mon, 06 Jun 2022 01:34:24 -0400</pubDate><guid>https://x-nagi.com/post/has2022-rust-patching.html</guid><description>&lt;h2 id="description"&gt;Description&lt;/h2&gt;&#10;&lt;p&gt;&lt;a href="https://x-nagi.com/file/challenge.tar.gz"&gt;My Challenge File Archive&lt;/a&gt;&lt;/p&gt;&#10;&lt;p&gt;The challenge is a Dijkstra algorithm problem. We are given 3 CSV files which contain distances between the stars, and we are asked to find a path from our ship “ShippyMcShipFace” to the destination “Honolulu”. Normal Dijkstra seems not to work on this challenge; perhaps the cost is not simply the sum of all distances.&lt;/p&gt;</description></item><item><title>*CTF 2021 Reverse*5</title><link>https://x-nagi.com/post/starctf2021.html</link><pubDate>Tue, 19 Jan 2021 09:02:47 +0800</pubDate><guid>https://x-nagi.com/post/starctf2021.html</guid><description>&lt;p&gt;The endless exams finally ended, and after half a year I returned to competing with my AAA teammates—and to staying up all night. We solved five of the six reverse-engineering challenges. The remaining one, &lt;code&gt;RL_Env&lt;/code&gt;, appeared to involve machine learning; I did not even understand what it was asking us to do.&lt;/p&gt;</description></item></channel></rss>