Deprecated: Assigning the return value of new by reference is deprecated in /customers/1/f/c/dahoiv.net/httpd.www/programmering/wp-includes/cache.php on line 36

Deprecated: Assigning the return value of new by reference is deprecated in /customers/1/f/c/dahoiv.net/httpd.www/programmering/wp-includes/query.php on line 21

Deprecated: Assigning the return value of new by reference is deprecated in /customers/1/f/c/dahoiv.net/httpd.www/programmering/wp-includes/theme.php on line 507

Warning: Cannot modify header information - headers already sent by (output started at /customers/1/f/c/dahoiv.net/httpd.www/programmering/wp-includes/cache.php:36) in /customers/1/f/c/dahoiv.net/httpd.www/programmering/wp-includes/feed-rss2.php on line 2
<?xml version="1.0" encoding="UTF-8"?>
<!-- generator="wordpress/2.2.1" -->
<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/"
	>

<channel>
	<title>Programming</title>
	<link>http://dahoiv.net/programmering</link>
	<description>- My programming projects and some linux tips</description>
	<pubDate>Sat, 20 Dec 2008 13:37:45 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.2.1</generator>
	<language>en</language>
			<item>
		<title>Bash script for SFV and uncompressing of .r00 files - NEW VERSION</title>
		<link>http://dahoiv.net/programmering/bash/bash-script-for-sfv-and-uncompressing-of-r00-files-new-version</link>
		<comments>http://dahoiv.net/programmering/bash/bash-script-for-sfv-and-uncompressing-of-r00-files-new-version#comments</comments>
		<pubDate>Sat, 20 Dec 2008 13:32:59 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[GNU/Linux]]></category>

		<category><![CDATA[Bash]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/bash/bash-script-for-sfv-and-uncompressing-of-r00-files-new-version</guid>
		<description><![CDATA[A bash script to verify the integrity of files on Linux. Simple file verification (SFV)  is file format to store CRC32 checksums. If the checksums is correct, then the script will uncompress the files. The script can be used at files of format .rar, .r00, .r01 etc and with a .sfv file. This is [...]]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/bash/bash-script-for-sfv-and-uncompressing-of-r00-files-new-version/feed</wfw:commentRss>
		</item>
		<item>
		<title>Get Ip address</title>
		<link>http://dahoiv.net/programmering/bash/get-ip-address</link>
		<comments>http://dahoiv.net/programmering/bash/get-ip-address#comments</comments>
		<pubDate>Fri, 08 Aug 2008 20:02:48 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[Perl]]></category>

		<category><![CDATA[GNU/Linux]]></category>

		<category><![CDATA[Bash]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/bash/get-ip-address</guid>
		<description><![CDATA[If you have a server with a dynamical ip address. You can use this script to get the ip address to your mail box. Maybe you have to change the smtp-server to your ISP&#8217;s smtp-server. Run &#8220;sudo crontab -e&#8221; and add &#8220;00  *    *     *     *   ~/scripts/ip&#8221; to get an email every hour.
]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/bash/get-ip-address/feed</wfw:commentRss>
		</item>
		<item>
		<title>How to disable caps lock in Linux</title>
		<link>http://dahoiv.net/programmering/gnulinux/how-to-disable-caps-lock-in-linux</link>
		<comments>http://dahoiv.net/programmering/gnulinux/how-to-disable-caps-lock-in-linux#comments</comments>
		<pubDate>Sun, 03 Aug 2008 07:46:00 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[GNU/Linux]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/gnulinux/how-to-disable-caps-lock-in-linux</guid>
		<description><![CDATA[If you want to disable the caps lock. Open the ~/.bashrc file and add:
    # Disables the caps lock button
    xmodmap -e "remove lock = Caps_Lock"
]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/gnulinux/how-to-disable-caps-lock-in-linux/feed</wfw:commentRss>
		</item>
		<item>
		<title>How to install Code::Blocks</title>
		<link>http://dahoiv.net/programmering/cpp/how-to-install-codeblocks</link>
		<comments>http://dahoiv.net/programmering/cpp/how-to-install-codeblocks#comments</comments>
		<pubDate>Thu, 24 Jul 2008 17:41:12 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[GNU/Linux]]></category>

		<category><![CDATA[C++]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/gnulinux/how-to-install-codeblocks</guid>
		<description><![CDATA[Code::Blocks is a great IDE for C++. Here is a guide to install Code::Blocks in Linux.
Open a Terminal (Applications -&#62; Accessories), and wright:
sudo gedit /etc/apt/sources.list
add these lines to the end of the file:
deb http://lgp203.free.fr/ubuntu/ gutsy universe
deb http://apt.wxwidgets.org/ gutsy-wx main
In the Terminal:
wget -q http://lgp203.free.fr/public.key -O- &#124; sudo apt-key add -
wget -q http://apt.wxwidgets.org/key.asc -O- &#124; sudo apt-key [...]]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/cpp/how-to-install-codeblocks/feed</wfw:commentRss>
		</item>
		<item>
		<title>My .emacs file</title>
		<link>http://dahoiv.net/programmering/gnulinux/my-emacs-file</link>
		<comments>http://dahoiv.net/programmering/gnulinux/my-emacs-file#comments</comments>
		<pubDate>Thu, 26 Jun 2008 04:49:34 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[GNU/Linux]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/gnulinux/my-emacs-file</guid>
		<description><![CDATA[Here is my .emacs file. Copy it to ~/ and it will modify your emacs.
]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/gnulinux/my-emacs-file/feed</wfw:commentRss>
		</item>
		<item>
		<title>Numerical solution of the stationary advection diffusion equation.</title>
		<link>http://dahoiv.net/programmering/matlab/numerical-solution-of-the-stationary-advection-diffusion-equation</link>
		<comments>http://dahoiv.net/programmering/matlab/numerical-solution-of-the-stationary-advection-diffusion-equation#comments</comments>
		<pubDate>Mon, 23 Jun 2008 19:09:28 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[Matlab]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/matlab/numerical-solution-of-the-stationary-advection-diffusion-equation</guid>
		<description><![CDATA[The stationary advection diffusion equation solved with the finite difference method.
]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/matlab/numerical-solution-of-the-stationary-advection-diffusion-equation/feed</wfw:commentRss>
		</item>
		<item>
		<title>Bash script for SFV and uncompressing of .r00 files</title>
		<link>http://dahoiv.net/programmering/bash/bash-script-for-sfv-and-uncompressing-of-r00-files</link>
		<comments>http://dahoiv.net/programmering/bash/bash-script-for-sfv-and-uncompressing-of-r00-files#comments</comments>
		<pubDate>Sat, 14 Jun 2008 18:03:09 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[GNU/Linux]]></category>

		<category><![CDATA[Bash]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/bash/bash-script-for-sfv-and-uncompressing-of-r00-files</guid>
		<description><![CDATA[A bash script to verify the integrity of files on Linux. Simple file verification (SFV)  is file format to store CRC32 checksums. If the checksums is correct, then the script will uncompress the files. The script can be used at files of format .rar, .r00, .r01 etc and with a .sfv file.
]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/bash/bash-script-for-sfv-and-uncompressing-of-r00-files/feed</wfw:commentRss>
		</item>
		<item>
		<title>Steepest Descent Iteration</title>
		<link>http://dahoiv.net/programmering/matlab/steepest-descent-iteration</link>
		<comments>http://dahoiv.net/programmering/matlab/steepest-descent-iteration#comments</comments>
		<pubDate>Sat, 07 Jun 2008 13:28:04 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[Matlab]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/matlab/steepest-descent-iteration</guid>
		<description><![CDATA[Steepest Descent Iteration ,  written   in Matlab to solve the Advection-diffusion equation. The matrix A (in A x= b) is a block pentadiagonal matrix.
]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/matlab/steepest-descent-iteration/feed</wfw:commentRss>
		</item>
		<item>
		<title>Successive over-relaxation</title>
		<link>http://dahoiv.net/programmering/matlab/successive-over-relaxation</link>
		<comments>http://dahoiv.net/programmering/matlab/successive-over-relaxation#comments</comments>
		<pubDate>Mon, 02 Jun 2008 17:17:45 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[Matlab]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/uncategorized/successive-over-relaxation</guid>
		<description><![CDATA[Successive over-relaxation (SOR),  written   in Matlab to solve the Advection-diffusion equation. The matrix A (in A x= b) is a block pentadiagonal matrix.
]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/matlab/successive-over-relaxation/feed</wfw:commentRss>
		</item>
		<item>
		<title>Quick sort</title>
		<link>http://dahoiv.net/programmering/uncategorized/quick-sort</link>
		<comments>http://dahoiv.net/programmering/uncategorized/quick-sort#comments</comments>
		<pubDate>Sat, 29 Sep 2007 17:05:54 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[Python]]></category>

		<category><![CDATA[Uncategorized]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/uncategorized/quick-sort</guid>
		<description><![CDATA[Quick sort in Python
def sort(A):
if len(A) &#60;= 1:
return A
small = []
middle = []
big = []
temp = int((A[0][0]+A[len(A)-1][0])/2)
for x in A:
if x[0] &#60; temp:
small.append(x)
elif x[0] == temp:
middle.append(x)
elif x[0] &#62; temp:
big.append(x)
A = sort(small)
A.extend(middle)
A.extend(sort(big))
return A
]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/uncategorized/quick-sort/feed</wfw:commentRss>
		</item>
		<item>
		<title>Nim</title>
		<link>http://dahoiv.net/programmering/cpp/nim</link>
		<comments>http://dahoiv.net/programmering/cpp/nim#comments</comments>
		<pubDate>Sun, 02 Sep 2007 11:03:54 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[C++]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/cpp/nim</guid>
		<description><![CDATA[Nim is a two-player game in which players take turns removing objects from distinct heaps. On each turn, a player must remove at least one object. The player who take the last object loses.
]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/cpp/nim/feed</wfw:commentRss>
		</item>
		<item>
		<title>Project Euler - problem 092</title>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-092</link>
		<comments>http://dahoiv.net/programmering/cpp/project-euler-problem-092#comments</comments>
		<pubDate>Wed, 01 Aug 2007 14:25:45 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[Project Euler]]></category>

		<category><![CDATA[C++]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/uncategorized/project-euler-problem-092</guid>
		<description><![CDATA[A number chain is created by continuously adding the square of the digits in a number to form a new number until it has been seen before.
For example,
44 -&#62; 32 -&#62; 13 -&#62; 10 -&#62; 1 -&#62; 1
85 -&#62; 89 -&#62; 145 -&#62; 42 -&#62; 20 -&#62; 4 -&#62; 16 -&#62; 37 -&#62; 58 -&#62; [...]]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/cpp/project-euler-problem-092/feed</wfw:commentRss>
		</item>
		<item>
		<title>Project Euler - problem 030</title>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-030</link>
		<comments>http://dahoiv.net/programmering/cpp/project-euler-problem-030#comments</comments>
		<pubDate>Wed, 01 Aug 2007 14:24:02 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[Project Euler]]></category>

		<category><![CDATA[C++]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/uncategorized/project-euler-problem-030</guid>
		<description><![CDATA[Surprisingly there are only three numbers that can be written as the sum of fourth powers of their digits:
1634 = 14 + 64 + 34 + 44
8208 = 84 + 24 + 04 + 84
9474 = 94 + 44 + 74 + 44
As 1 = 14 is not a sum it is not included.
The sum [...]]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/cpp/project-euler-problem-030/feed</wfw:commentRss>
		</item>
		<item>
		<title>Project Euler - problem 015</title>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-015</link>
		<comments>http://dahoiv.net/programmering/cpp/project-euler-problem-015#comments</comments>
		<pubDate>Wed, 01 Aug 2007 14:15:49 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[Project Euler]]></category>

		<category><![CDATA[C++]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/cpp/project-euler-problem-015</guid>
		<description><![CDATA[Starting in the top left corner of a 2*2 grid, there are 6 routes (without backtracking) to the bottom right corner.
How many routes are there through a 20*20 grid?
]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/cpp/project-euler-problem-015/feed</wfw:commentRss>
		</item>
		<item>
		<title>Project Euler - problem 014</title>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-014</link>
		<comments>http://dahoiv.net/programmering/cpp/project-euler-problem-014#comments</comments>
		<pubDate>Wed, 01 Aug 2007 13:19:26 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[Project Euler]]></category>

		<category><![CDATA[C++]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/cpp/project-euler-problem-014</guid>
		<description><![CDATA[The following iterative sequence is defined for the set of positive integers:
n -&#62;n/2 (n is even)
n -&#62;3n + 1 (n is odd)
Using the rule above and starting with 13, we generate the following sequence:
13 -&#62; 40 -&#62; 20 -&#62; 10 -&#62; 5 -&#62; 16 -&#62; 8 -&#62; 4 -&#62; 2 -&#62; 1
It can be seen [...]]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/cpp/project-euler-problem-014/feed</wfw:commentRss>
		</item>
		<item>
		<title>Project Euler - problem 012</title>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-012</link>
		<comments>http://dahoiv.net/programmering/cpp/project-euler-problem-012#comments</comments>
		<pubDate>Wed, 01 Aug 2007 13:17:03 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[Project Euler]]></category>

		<category><![CDATA[C++]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/uncategorized/project-euler-problem-012</guid>
		<description><![CDATA[The sequence of triangle numbers is generated by adding the natural numbers. So the 7th triangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:
1, 3, 6, 10, 15, 21, 28, 36, 45, 55, &#8230;
Let us list the factors of [...]]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/cpp/project-euler-problem-012/feed</wfw:commentRss>
		</item>
		<item>
		<title>Project Euler - problem 010</title>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-010</link>
		<comments>http://dahoiv.net/programmering/cpp/project-euler-problem-010#comments</comments>
		<pubDate>Wed, 01 Aug 2007 13:15:59 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[Project Euler]]></category>

		<category><![CDATA[C++]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/cpp/project-euler-problem-010</guid>
		<description><![CDATA[The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
Find the sum of all the primes below one million.
]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/cpp/project-euler-problem-010/feed</wfw:commentRss>
		</item>
		<item>
		<title>Project Euler - problem 009</title>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-009</link>
		<comments>http://dahoiv.net/programmering/cpp/project-euler-problem-009#comments</comments>
		<pubDate>Wed, 01 Aug 2007 13:09:50 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[Project Euler]]></category>

		<category><![CDATA[C++]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/cpp/project-euler-problem-009</guid>
		<description><![CDATA[A Pythagorean triplet is a set of three natural numbers, a&#60;b&#60;c, for which,
a² + b² = c²
For example, 3² + 4² = 9 + 16 = 25 = 5².
There exists exactly one Pythagorean triplet for which a + b + c = 1000.
Find the product abc.
]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/cpp/project-euler-problem-009/feed</wfw:commentRss>
		</item>
		<item>
		<title>Project Euler - problem 007</title>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-007</link>
		<comments>http://dahoiv.net/programmering/cpp/project-euler-problem-007#comments</comments>
		<pubDate>Wed, 01 Aug 2007 13:08:11 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[Project Euler]]></category>

		<category><![CDATA[C++]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/cpp/project-euler-problem-007</guid>
		<description><![CDATA[By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
What is the 10001st prime number?
]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/cpp/project-euler-problem-007/feed</wfw:commentRss>
		</item>
		<item>
		<title>Project Euler - problem 006</title>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-006</link>
		<comments>http://dahoiv.net/programmering/cpp/project-euler-problem-006#comments</comments>
		<pubDate>Wed, 01 Aug 2007 13:06:59 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[Project Euler]]></category>

		<category><![CDATA[C++]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/uncategorized/project-euler-problem-006</guid>
		<description><![CDATA[The sum of the squares of the first ten natural numbers is,
1² + 2² + &#8230; + 10² = 385
The square of the sum of the first ten natural numbers is,
(1 + 2 + &#8230; + 10)² = 55² = 3025
Hence the difference between the sum of the squares of the first ten natural numbers [...]]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/cpp/project-euler-problem-006/feed</wfw:commentRss>
		</item>
		<item>
		<title>Project Euler - problem 005</title>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-005</link>
		<comments>http://dahoiv.net/programmering/cpp/project-euler-problem-005#comments</comments>
		<pubDate>Wed, 01 Aug 2007 13:04:30 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[Project Euler]]></category>

		<category><![CDATA[C++]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/cpp/project-euler-problem-005</guid>
		<description><![CDATA[2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
What is the smallest number that is evenly divisible by all of the numbers from 1 to 20?
]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/cpp/project-euler-problem-005/feed</wfw:commentRss>
		</item>
		<item>
		<title>Project Euler - problem 004</title>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-004</link>
		<comments>http://dahoiv.net/programmering/cpp/project-euler-problem-004#comments</comments>
		<pubDate>Wed, 01 Aug 2007 12:51:07 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[Project Euler]]></category>

		<category><![CDATA[C++]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/cpp/project-euler-problem-004</guid>
		<description><![CDATA[A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is 9009 = 91 * 99.
Find the largest palindrome made from the product of two 3-digit numbers.
]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/cpp/project-euler-problem-004/feed</wfw:commentRss>
		</item>
		<item>
		<title>Project Euler - Problem 003</title>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-003</link>
		<comments>http://dahoiv.net/programmering/cpp/project-euler-problem-003#comments</comments>
		<pubDate>Wed, 01 Aug 2007 12:13:17 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[Project Euler]]></category>

		<category><![CDATA[C++]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/uncategorized/project-euler-problem-003</guid>
		<description><![CDATA[The prime factors of 13195 are 5, 7, 13 and 29.
What is the largest prime factor of the number 317584931803?
]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/cpp/project-euler-problem-003/feed</wfw:commentRss>
		</item>
		<item>
		<title>Project Euler - Problem 002</title>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-002</link>
		<comments>http://dahoiv.net/programmering/cpp/project-euler-problem-002#comments</comments>
		<pubDate>Wed, 01 Aug 2007 11:07:18 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[Project Euler]]></category>

		<category><![CDATA[C++]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/cpp/project-euler-problem-002</guid>
		<description><![CDATA[Each new term in the Fibonacci sequence
is generated by adding the previous two terms.
By starting with 1 and 2, the first 10 terms will be:
1, 2, 3, 5, 8, 13, 21, 34, 55, 89, &#8230;
Find the sum of all the even-valued
terms in the sequence which do not exceed one million.
]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/cpp/project-euler-problem-002/feed</wfw:commentRss>
		</item>
		<item>
		<title>Project Euler - Problem 001</title>
		<link>http://dahoiv.net/programmering/cpp/project-euler-problem-001</link>
		<comments>http://dahoiv.net/programmering/cpp/project-euler-problem-001#comments</comments>
		<pubDate>Wed, 01 Aug 2007 08:57:22 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[Project Euler]]></category>

		<category><![CDATA[C++]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/cpp/project-euler-problem-001</guid>
		<description><![CDATA[If we list all the natural numbers below
10 that are multiples of 3 or 5, we get 3, 5,
6 and 9. The sum of these multiples is 23.
Find the sum of all the multiples of 3 or 5 below 1000.
]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/cpp/project-euler-problem-001/feed</wfw:commentRss>
		</item>
		<item>
		<title>To tankser som har brutt sammen, og det eneste som fungerer er kanonene</title>
		<link>http://dahoiv.net/programmering/java/to-tankser-som-har-brutt-sammen-og-det-eneste-som-fungerer-er-kanonene</link>
		<comments>http://dahoiv.net/programmering/java/to-tankser-som-har-brutt-sammen-og-det-eneste-som-fungerer-er-kanonene#comments</comments>
		<pubDate>Wed, 01 Aug 2007 07:44:30 +0000</pubDate>
		<dc:creator>Daniel Høyer Iversen</dc:creator>
		
		<category><![CDATA[Java]]></category>

		<guid isPermaLink="false">http://dahoiv.net/programmering/uncategorized/to-tankser-som-har-brutt-sammen-og-det-eneste-som-fungerer-er-kanonene</guid>
		<description><![CDATA[Opprinnelig skrevet 03.05.2007:
Ja, da var endelig javaspillet vårt ferdig. Etter mye jobbing er det morsomt å se et resultat i hvert fall jeg er fornøyd med.
]]></description>
		<wfw:commentRss>http://dahoiv.net/programmering/java/to-tankser-som-har-brutt-sammen-og-det-eneste-som-fungerer-er-kanonene/feed</wfw:commentRss>
		</item>
	</channel>
</rss>