<?xml version="1.0" encoding="UTF-8"?><rss version="0.92">
<channel>
	<title>Studiose</title>
	<link>http://studiose.org</link>
	<description>Well I guess that&#039;s that.</description>
	<lastBuildDate>Wed, 26 May 2010 09:44:50 +0000</lastBuildDate>
	<docs>http://backend.userland.com/rss092</docs>
	<language>en</language>
	<!-- generator="WordPress/3.0.1" -->

	<item>
		<title>Project Euler #4</title>
		<description><![CDATA["Find the largest palindrome made from the product of two 3-digit numbers." This one also took a bit more time than I would have liked, but after fixing the problem I understood how I missed it. Before if the left value ( left * right ) was higher it'd be considered the "largest" palindrome, which [...]]]></description>
		<link>http://studiose.org/2010/05/26/project-euler-4/</link>
			</item>
	<item>
		<title>Project Euler #3</title>
		<description><![CDATA["Find the largest prime factor of a composite number." Woo, that one was harder than I would have liked. Okay, well not so much hard, but tedious. My first couple iterations of this program took more than 20 minutes to find number I eventually found out I didn't need! But I eventually optimized it and [...]]]></description>
		<link>http://studiose.org/2010/05/25/project-euler-3/</link>
			</item>
	<item>
		<title>Project Euler #2</title>
		<description><![CDATA["Find the sum of all the even-valued terms in the Fibonacci sequence which do not exceed four million." Just finished problem 2 of Project Euler. Another simple one, sadly I was set back a good 30 minutes because of an evil semi-colon hiding in the mist of my syntax. Anyways, here's my solution in C++: [...]]]></description>
		<link>http://studiose.org/2010/05/25/project-euler-2/</link>
			</item>
	<item>
		<title>Project Euler #1</title>
		<description><![CDATA["Add all the natural numbers below one thousand that are multiples of 3 or 5." Started working on the Project Euler problems. Just going to work my way through all of them one at a time. I'm hoping it'll be an amazing learning experience. The solution to problem #1 in C++: int Problem1() { for( int [...]]]></description>
		<link>http://studiose.org/2010/05/25/project-euler-1/</link>
			</item>
	<item>
		<title>MString</title>
		<description><![CDATA[Programmed my own little string class based off std::string. It's nothing special, but it's nice to have my function to edit while I need it, this way I don't need to make tons of code changes over 10 different files to do one thing, instead I can just add the function to the class or [...]]]></description>
		<link>http://studiose.org/2010/05/25/mstring/</link>
			</item>
</channel>
</rss>
