<?xml version="1.0" encoding="UTF-8"?>
<rss xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" version="2.0">
  <channel>
    <title>topic Re: Holiday Fun: The Advent of Code using SAS in SAS Programming</title>
    <link>https://communities.sas.com/t5/SAS-Programming/Holiday-Fun-The-Advent-of-Code-using-SAS/m-p/519123#M140563</link>
    <description>&lt;P&gt;Interesting. The Dec 6 problem asks for locations that are near any points in a given set. You can use the&amp;nbsp;DISTANCE function in SAS/IML (which supports Manhatten distance) to solve the problem. A similar&amp;nbsp;idea was discussed in &lt;A href="https://blogs.sas.com/content/iml/2016/09/28/distance-between-two-group.html" target="_self"&gt;this blog post about nearest neighbors.&lt;/A&gt;&lt;/P&gt;</description>
    <pubDate>Thu, 06 Dec 2018 14:14:14 GMT</pubDate>
    <dc:creator>Rick_SAS</dc:creator>
    <dc:date>2018-12-06T14:14:14Z</dc:date>
    <item>
      <title>Holiday Fun: The Advent of Code using SAS</title>
      <link>https://communities.sas.com/t5/SAS-Programming/Holiday-Fun-The-Advent-of-Code-using-SAS/m-p/518967#M140499</link>
      <description>&lt;P&gt;Hi All,&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Has anyone else out there been doing the &lt;A href="https://adventofcode.com" target="_self"&gt;Advent of Code&lt;/A&gt; this holiday season?&amp;nbsp; You get a fun little coding puzzle every day of the advent season (December 1 through 25).&amp;nbsp;&amp;nbsp;They can be done using any programming tool or language, but naturally I'm doing them all in SAS.&amp;nbsp;&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;I'd love to compare solutions if anyone else is interested.&amp;nbsp; In several cases, I've come up with one proc-oriented solution and another data-step-only solution (frequently involving hash objects).&amp;nbsp; I've already learned a few new tricks.&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Unfortunately, you won't find me on the &lt;A href="https://adventofcode.com/2018/leaderboard" target="_self"&gt;leaderboard&lt;/A&gt;.&amp;nbsp; You get there by being one of the first few to submit a correct solution after each day's problem goes live at midnight (Eastern time).&amp;nbsp; If I'm up writing code after midnight, it's only because something has gone very, very wrong.&amp;nbsp; &lt;span class="lia-unicode-emoji" title=":slightly_smiling_face:"&gt;🙂&lt;/span&gt;&lt;/P&gt;
&lt;P&gt;&amp;nbsp;&lt;/P&gt;
&lt;P&gt;Josh Horstman&lt;/P&gt;</description>
      <pubDate>Wed, 05 Dec 2018 22:32:05 GMT</pubDate>
      <guid>https://communities.sas.com/t5/SAS-Programming/Holiday-Fun-The-Advent-of-Code-using-SAS/m-p/518967#M140499</guid>
      <dc:creator>jmhorstman</dc:creator>
      <dc:date>2018-12-05T22:32:05Z</dc:date>
    </item>
    <item>
      <title>Re: Holiday Fun: The Advent of Code using SAS</title>
      <link>https://communities.sas.com/t5/SAS-Programming/Holiday-Fun-The-Advent-of-Code-using-SAS/m-p/519123#M140563</link>
      <description>&lt;P&gt;Interesting. The Dec 6 problem asks for locations that are near any points in a given set. You can use the&amp;nbsp;DISTANCE function in SAS/IML (which supports Manhatten distance) to solve the problem. A similar&amp;nbsp;idea was discussed in &lt;A href="https://blogs.sas.com/content/iml/2016/09/28/distance-between-two-group.html" target="_self"&gt;this blog post about nearest neighbors.&lt;/A&gt;&lt;/P&gt;</description>
      <pubDate>Thu, 06 Dec 2018 14:14:14 GMT</pubDate>
      <guid>https://communities.sas.com/t5/SAS-Programming/Holiday-Fun-The-Advent-of-Code-using-SAS/m-p/519123#M140563</guid>
      <dc:creator>Rick_SAS</dc:creator>
      <dc:date>2018-12-06T14:14:14Z</dc:date>
    </item>
  </channel>
</rss>

