<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	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/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Free Lancers Unite &#187; c#</title>
	<atom:link href="http://freelancersunite.net/tag/c/feed/" rel="self" type="application/rss+xml" />
	<link>http://freelancersunite.net</link>
	<description>&#34;look upon my works ye mighty and despair&#34;</description>
	<lastBuildDate>Fri, 16 Jul 2010 02:41:50 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.0.1</generator>
		<item>
		<title>Project Euler Problem #102!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-102/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-102/#comments</comments>
		<pubDate>Fri, 16 Jul 2010 02:41:50 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[csharp]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=760</guid>
		<description><![CDATA[Problem 102 says: Three distinct points are plotted at random on a Cartesian plane, for which -1000 ≤ x, y ≤ 1000, such that a triangle is formed. Consider the following two triangles: A(-340,495), B(-153,-910), C(835,-947) X(-175,41), Y(-421,-714), Z(574,-645) It can be verified that triangle ABC contains the origin, whereas triangle XYZ does not. This [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-102/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #75!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-75/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-75/#comments</comments>
		<pubDate>Wed, 05 May 2010 13:00:58 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[csharp]]></category>
		<category><![CDATA[mono]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=722</guid>
		<description><![CDATA[Problem #75 says: It turns out that 12 cm is the smallest length of wire that can be bent to form an integer sided right angle triangle in exactly one way, but there are many more examples. 12 cm: (3,4,5) 24 cm: (6,8,10) 30 cm: (5,12,13) 36 cm: (9,12,15) 40 cm: (8,15,17) 48 cm: (12,16,20) [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-75/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #51!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-51/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-51/#comments</comments>
		<pubDate>Fri, 26 Feb 2010 18:39:28 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[csharp]]></category>
		<category><![CDATA[mono]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=654</guid>
		<description><![CDATA[Problem #51 says: By replacing the 1st digit of *3, it turns out that six of the nine possible values: 13, 23, 43, 53, 73, and 83, are all prime. By replacing the 3rd and 4th digits of 56**3 with the same digit, this 5-digit number is the first example having seven primes among the [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-51/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #60!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-60/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-60/#comments</comments>
		<pubDate>Tue, 23 Feb 2010 04:53:09 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[csharp]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=648</guid>
		<description><![CDATA[Problem #60 says: The primes 3, 7, 109, and 673, are quite remarkable. By taking any two primes and concatenating them in any order the result will always be prime. For example, taking 7 and 109, both 7109 and 1097 are prime. The sum of these four primes, 792, represents the lowest sum for a [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-60/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #142!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-142/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-142/#comments</comments>
		<pubDate>Sat, 26 Dec 2009 17:01:19 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[csharp]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=613</guid>
		<description><![CDATA[Problem #142 say: Find the smallest x + y + z with integers x > y > z > 0 such that x + y, x − y, x + z, x − z, y + z, y − z are all perfect squares. Now one can brute force this by looping over x, y [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-142/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #145!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-145/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-145/#comments</comments>
		<pubDate>Wed, 02 Dec 2009 04:44:36 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[Math]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=602</guid>
		<description><![CDATA[Problem #145 says: Some positive integers n have the property that the sum [ n + reverse(n) ] consists entirely of odd (decimal) digits. For instance, 36 + 63 = 99 and 409 + 904 = 1313. We will call such numbers reversible; so 36, 63, 409, and 904 are reversible. Leading zeroes are not [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-145/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #206!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-206/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-206/#comments</comments>
		<pubDate>Fri, 27 Nov 2009 01:25:23 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[csharp]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=597</guid>
		<description><![CDATA[Problem #206 says: Find the unique positive integer whose square has the form 1_2_3_4_5_6_7_8_9_0, where each “_” is a single digit. The range of number to check can be narrowed down with a calculator and some common sense. Then its just a square and check procedure. Solution is in c# and requires the .Net 4.0 [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-206/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Project Euler Problem #50!</title>
		<link>http://freelancersunite.net/project_euler/project-euler-problem-50/</link>
		<comments>http://freelancersunite.net/project_euler/project-euler-problem-50/#comments</comments>
		<pubDate>Thu, 05 Nov 2009 15:28:54 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Project Euler]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[csharp]]></category>
		<category><![CDATA[mono]]></category>
		<category><![CDATA[programming]]></category>
		<category><![CDATA[project euler]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=575</guid>
		<description><![CDATA[(updates on the site. pagerank just hit 3 on google. hopefully this will increase traffic a bit. and this post is the first post on the site done in windows 7 (took 6 hours for my pc to update ) Problem #50 says: The prime 41, can be written as the sum of six consecutive [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/project_euler/project-euler-problem-50/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Nifty Gtk Snippets.</title>
		<link>http://freelancersunite.net/software/nifty-gtk-snippets/</link>
		<comments>http://freelancersunite.net/software/nifty-gtk-snippets/#comments</comments>
		<pubDate>Fri, 21 Aug 2009 04:37:36 +0000</pubDate>
		<dc:creator>Serinox</dc:creator>
				<category><![CDATA[Software]]></category>
		<category><![CDATA[c#]]></category>
		<category><![CDATA[gtk]]></category>
		<category><![CDATA[image]]></category>
		<category><![CDATA[mono]]></category>
		<category><![CDATA[pixbuf]]></category>

		<guid isPermaLink="false">http://freelancersunite.net/?p=533</guid>
		<description><![CDATA[So in my recent works with Gtk I&#8217;ve come across (and written) some useful snippets so I thought I&#8217;d post a few of them. The first comes from this site (its in Spanish), this snippet allows you to take a System.Drawing.Image to a Gdk.Pixbuf and it looks like this (slightly modified to fix an ambiguous [...]]]></description>
		<wfw:commentRss>http://freelancersunite.net/software/nifty-gtk-snippets/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
