<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>Comments on: How To Do Well in Programming Competitions</title>
	<atom:link href="http://www.jakevoytko.com/blog/2007/11/08/how-to-do-well-in-programming-competitions/feed/" rel="self" type="application/rss+xml" />
	<link>http://www.jakevoytko.com/blog/2007/11/08/how-to-do-well-in-programming-competitions/</link>
	<description>Ye Olde Computer Science Blogge</description>
	<lastBuildDate>Fri, 18 Jun 2010 17:23:52 +0000</lastBuildDate>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0</generator>
	<item>
		<title>By: Batu Malai</title>
		<link>http://www.jakevoytko.com/blog/2007/11/08/how-to-do-well-in-programming-competitions/comment-page-1/#comment-9911</link>
		<dc:creator>Batu Malai</dc:creator>
		<pubDate>Sat, 14 Nov 2009 15:56:15 +0000</pubDate>
		<guid isPermaLink="false">http://www.jakevoytko.com/blog/2007/11/08/how-to-do-well-in-programming-competitions/#comment-9911</guid>
		<description>Write a program that reverses the string contents of a stack (the top and bottom elements exchange positions, the second last element exchange positions, and so forth until the entire stack is reversed). Hint: You may use a second stack. The following diagram illustrates the exchange process.

A
	        I
B
	        H
C		G
D	
F
E		E
F		D
G		C
H		B
I		A

please help me to the programming in struktur data.

thanks</description>
		<content:encoded><![CDATA[<p>Write a program that reverses the string contents of a stack (the top and bottom elements exchange positions, the second last element exchange positions, and so forth until the entire stack is reversed). Hint: You may use a second stack. The following diagram illustrates the exchange process.</p>
<p>A<br />
	        I<br />
B<br />
	        H<br />
C		G<br />
D<br />
F<br />
E		E<br />
F		D<br />
G		C<br />
H		B<br />
I		A</p>
<p>please help me to the programming in struktur data.</p>
<p>thanks</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: 40 Years Old</title>
		<link>http://www.jakevoytko.com/blog/2007/11/08/how-to-do-well-in-programming-competitions/comment-page-1/#comment-9906</link>
		<dc:creator>40 Years Old</dc:creator>
		<pubDate>Wed, 24 Jun 2009 22:52:51 +0000</pubDate>
		<guid isPermaLink="false">http://www.jakevoytko.com/blog/2007/11/08/how-to-do-well-in-programming-competitions/#comment-9906</guid>
		<description>When I entered a programming contest in high school, it was assumed that all schools used the Apple IIe and BASIC.  I remember we &quot;accidentally&quot; cheated by doing a soft-reboot (PR#6) from the command line.  This disabled the NO RUN feature that was installed.  If you&#039;re young and get a chance to go, definately go!</description>
		<content:encoded><![CDATA[<p>When I entered a programming contest in high school, it was assumed that all schools used the Apple IIe and BASIC.  I remember we &#8220;accidentally&#8221; cheated by doing a soft-reboot (PR#6) from the command line.  This disabled the NO RUN feature that was installed.  If you&#8217;re young and get a chance to go, definately go!</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: Matt</title>
		<link>http://www.jakevoytko.com/blog/2007/11/08/how-to-do-well-in-programming-competitions/comment-page-1/#comment-1512</link>
		<dc:creator>Matt</dc:creator>
		<pubDate>Wed, 05 Dec 2007 04:49:29 +0000</pubDate>
		<guid isPermaLink="false">http://www.jakevoytko.com/blog/2007/11/08/how-to-do-well-in-programming-competitions/#comment-1512</guid>
		<description>I actually competed in an ACM contest, and the best info I can give is program in C if possible. Also the best practice is actually setting a time limit to do the problems in.</description>
		<content:encoded><![CDATA[<p>I actually competed in an ACM contest, and the best info I can give is program in C if possible. Also the best practice is actually setting a time limit to do the problems in.</p>
]]></content:encoded>
	</item>
	<item>
		<title>By: jordan widel</title>
		<link>http://www.jakevoytko.com/blog/2007/11/08/how-to-do-well-in-programming-competitions/comment-page-1/#comment-581</link>
		<dc:creator>jordan widel</dc:creator>
		<pubDate>Fri, 09 Nov 2007 22:45:02 +0000</pubDate>
		<guid isPermaLink="false">http://www.jakevoytko.com/blog/2007/11/08/how-to-do-well-in-programming-competitions/#comment-581</guid>
		<description>When i get better at C++ I would love to enter some competitions.
Nice Read</description>
		<content:encoded><![CDATA[<p>When i get better at C++ I would love to enter some competitions.<br />
Nice Read</p>
]]></content:encoded>
	</item>
</channel>
</rss>
