<?xml version="1.0"?>
<rss version="2.0">
   <channel>
      <title>The Tower of Hanoi Problem by yongjun zheng</title>
      <link>https://padlet.com/yzheng99/rlykr7aauwue</link>
      <description></description>
      <language>en-us</language>
      <pubDate>2016-09-28 08:41:31 UTC</pubDate>
      <lastBuildDate>2021-03-01 13:39:57 UTC</lastBuildDate>
      <webMaster>hello@padlet.com</webMaster>
      <image>
         <url></url>
      </image>
      <item>
         <title>Table 1</title>
         <author></author>
         <link>https://padlet.com/yzheng99/rlykr7aauwue/wish/127817350</link>
         <description><![CDATA[<div>package week2;<br><br>public class Test {<br><br>	public static void main(String[] args) {<br>		for (int n = 0; n &lt;= 100; n++) {<br>			if(n%4 == 0) {<br>			System.out.println(n); }<br>			}<br>	}<br><br>}</div>]]></description>
         <enclosure url="" />
         <pubDate>2016-10-03 09:49:40 UTC</pubDate>
         <guid>https://padlet.com/yzheng99/rlykr7aauwue/wish/127817350</guid>
      </item>
   </channel>
</rss>
