<?xml version="1.0" encoding="iso-8859-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>Computer Programming</title>
		<link>http://quantumcore.forumotion.com/computer-programming-f7/-t1.htm</link>
		<description>Talk about computer programming and scripting.</description>
		<lastBuildDate>Tue, 22 Jan 2008 14:25:11 GMT</lastBuildDate>
		<ttl>10</ttl>
		<image>
			<title>Computer Programming</title>
			<url>http://hitskin.com/themes/10/05/88/i_logo.jpg</url>
			<link>http://quantumcore.forumotion.com/computer-programming-f7/-t1.htm</link>
		</image>
		<item>
			<title>A permutation problem</title>
			<link>http://quantumcore.forumotion.com/computer-programming-f7/a-permutation-problem-t20.htm</link>
			<dc:creator>Fantasist</dc:creator>
			<description>I had an assignment in C and I still haven't cracked a certain problem. I had to generate all combinations of 3-digit numbers from 1, 2 and 3, non-repeating. If it was repeating, it's simple. It's something like this:



Code:for&#40;i=1; i&lt;=3; i++&#41;&#123;

  for&#40;j=1; j&lt;=3; j++&#41;&#123;

    for&#40;k=1; k&lt;=3; k++&#41;&#123;

      printf&#40;&quot;\n%d%d%d&quot;, i, j, k&#41;;

    &#125;

  &#125;

&#125;



But my teach  ...</description>
			<category>Computer Programming</category>
			<pubDate>Tue, 22 Jan 2008 14:25:11 GMT</pubDate>
			<comments>http://quantumcore.forumotion.com/computer-programming-f7/a-permutation-problem-t20.htm#31</comments>
			<guid>http://quantumcore.forumotion.com/computer-programming-f7/a-permutation-problem-t20.htm</guid>
		</item>
	</channel>
</rss>