<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom" xmlns:thr="http://purl.org/syndication/thread/1.0">
  <title type="html">0x90: PKU-P1298-The-Hardest-Problem-Ever에 달린 최근 댓글/트랙백 목록</title>
  <id>http://risio.net/tc/</id>
  <link rel="alternate" type="text/html" hreflang="ko" href="http://risio.net/tc/" />
  <subtitle type="html">NOP</subtitle>
  <updated>2012-01-07T02:18:45-05:00</updated>
  <generator>Textcube 1.7.7 : Con moto</generator>
  <entry>
    <title type="html">t1g3r님의 댓글</title>
    <link rel="alternate" type="text/html" href="http://risio.net/tc/35#comment45" />
    <author>
      <name>(t1g3r)</name>
    </author>
    <id>http://risio.net/tc/35#comment45</id>
    <published>2009-04-25T00:54:13-05:00</published>
    <summary type="html">아이러니하게도 hardest problem이라는데 가장 많이 풀렸군요 ^^;;</summary>
  </entry>
  <entry>
    <title type="html">Cai님의 댓글</title>
    <link rel="alternate" type="text/html" href="http://risio.net/tc/35#comment46" />
    <author>
      <name>(Cai)</name>
    </author>
    <id>http://risio.net/tc/35#comment46</id>
    <published>2009-04-25T15:31:20-05:00</published>
    <summary type="html">ㅎㅎ 그러게요 :)

아이러닉한 제목이 컨셉인듯 -_-ㅋㅋ
간단한 Caesar cipher 문제인데 말이죠 ㅎㅎ

근데.. 어제 이문제보다 더 쉬운 문제를 찾아버렸네요 -0-;;</summary>
  </entry>
</feed>

