<?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/"
	xmlns:media="http://search.yahoo.com/mrss/"
	>

<channel>
	<title></title>
	<atom:link href="http://ciju.wordpress.com/feed/" rel="self" type="application/rss+xml" />
	<link>http://ciju.wordpress.com</link>
	<description>few problems, approaches and solutions</description>
	<lastBuildDate>Wed, 13 Aug 2008 17:40:17 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<cloud domain='ciju.wordpress.com' port='80' path='/?rsscloud=notify' registerProcedure='' protocol='http-post' />
<image>
		<url>http://www.gravatar.com/blavatar/78cfb03ca82b7e442e0d6a8301350686?s=96&#038;d=http://s.wordpress.com/i/buttonw-com.png</url>
		<title></title>
		<link>http://ciju.wordpress.com</link>
	</image>
			<item>
		<title>min-cost perfect matching</title>
		<link>http://ciju.wordpress.com/2008/08/10/min-cost-perfect-matching/</link>
		<comments>http://ciju.wordpress.com/2008/08/10/min-cost-perfect-matching/#comments</comments>
		<pubDate>Sat, 09 Aug 2008 23:44:48 +0000</pubDate>
		<dc:creator>ciju</dc:creator>
				<category><![CDATA[algorithms]]></category>
		<category><![CDATA[programming]]></category>

		<guid isPermaLink="false">http://ciju.wordpress.com/?p=103</guid>
		<description><![CDATA[If you would like to play with a minimum-cost perfect matching, klein-tardos.cc1 is a C++ implementation. It requires indexedlist.h and priqueue.h. The intent of the implementation was to know how the algorithm works. Also, most of the C++ I know is from my experience with this problem. So use should probably be limited to understanding [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=ciju.wordpress.com&blog=3808858&post=103&subd=ciju&ref=&feed=1" />]]></description>
		<wfw:commentRss>http://ciju.wordpress.com/2008/08/10/min-cost-perfect-matching/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">ciju</media:title>
		</media:content>
	</item>
		<item>
		<title>my desktop customizations</title>
		<link>http://ciju.wordpress.com/2008/08/10/my-desktop-customizations/</link>
		<comments>http://ciju.wordpress.com/2008/08/10/my-desktop-customizations/#comments</comments>
		<pubDate>Sat, 09 Aug 2008 21:50:18 +0000</pubDate>
		<dc:creator>ciju</dc:creator>
				<category><![CDATA[general]]></category>

		<guid isPermaLink="false">http://ciju.wordpress.com/?p=78</guid>
		<description><![CDATA[I have Ubuntu installed on my machine. Its nice and easy to work on. Even then, I have my own set of customizations to add to the system.
The most drastic customization is disabling the window decorations. I have always found it of no use, except for controlling the window, which could easily be made into [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=ciju.wordpress.com&blog=3808858&post=78&subd=ciju&ref=&feed=1" />]]></description>
		<wfw:commentRss>http://ciju.wordpress.com/2008/08/10/my-desktop-customizations/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">ciju</media:title>
		</media:content>
	</item>
		<item>
		<title>Four Cards, Gnome, and Goblin</title>
		<link>http://ciju.wordpress.com/2008/07/24/four-cards-gnome-and-goblin/</link>
		<comments>http://ciju.wordpress.com/2008/07/24/four-cards-gnome-and-goblin/#comments</comments>
		<pubDate>Thu, 24 Jul 2008 01:04:14 +0000</pubDate>
		<dc:creator>ciju</dc:creator>
				<category><![CDATA[puzzles]]></category>

		<guid isPermaLink="false">http://ciju.wordpress.com/2008/07/24/four-cards-gnome-and-goblin/</guid>
		<description><![CDATA[Another interesting puzzle, Four Cards, from here. 

Four cards are placed on a square table, one card at each corner. A blind gnome and an evil goblin take turns to play the following game. The blind gnome gets to choose a subset of the four cards and flip them simultaneously. If all four cards are [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=ciju.wordpress.com&blog=3808858&post=67&subd=ciju&ref=&feed=1" />]]></description>
		<wfw:commentRss>http://ciju.wordpress.com/2008/07/24/four-cards-gnome-and-goblin/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">ciju</media:title>
		</media:content>
	</item>
		<item>
		<title>splitting pdf slides: 4-up to 1-up</title>
		<link>http://ciju.wordpress.com/2008/07/21/splitting-pdf-slides-4-up-to-1-up/</link>
		<comments>http://ciju.wordpress.com/2008/07/21/splitting-pdf-slides-4-up-to-1-up/#comments</comments>
		<pubDate>Mon, 21 Jul 2008 04:24:39 +0000</pubDate>
		<dc:creator>ciju</dc:creator>
				<category><![CDATA[hacks]]></category>

		<guid isPermaLink="false">http://ciju.wordpress.com/?p=39</guid>
		<description><![CDATA[
Many 4-up slides are quite inconvenient for onscreen reading. And quite a few times, no other options are available. Here is a small and rough solution to the problem. First, you need to have Python on your system. Download and extract the pyPdf package. Download code from here, to the source directory of the pyPdf [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=ciju.wordpress.com&blog=3808858&post=39&subd=ciju&ref=&feed=1" />]]></description>
		<wfw:commentRss>http://ciju.wordpress.com/2008/07/21/splitting-pdf-slides-4-up-to-1-up/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">ciju</media:title>
		</media:content>
	</item>
		<item>
		<title>Beust Sequence! aka sequence of numbers without repeating digits.</title>
		<link>http://ciju.wordpress.com/2008/06/30/beust-sequence-aka-sequence-of-numbers-without-repeating-digits/</link>
		<comments>http://ciju.wordpress.com/2008/06/30/beust-sequence-aka-sequence-of-numbers-without-repeating-digits/#comments</comments>
		<pubDate>Mon, 30 Jun 2008 01:49:15 +0000</pubDate>
		<dc:creator>ciju</dc:creator>
				<category><![CDATA[algorithms]]></category>
		<category><![CDATA[programming]]></category>

		<guid isPermaLink="false">http://ciju.wordpress.com/2008/06/29/beust-sequence-aka-sequence-of-numbers-without-repeating-digits/</guid>
		<description><![CDATA[Original statement for the problem is here . The problem asks to generate a sequence of increasing numbers with no digits repeating in same number. The problem is quite similar to generating permutations, except for the part that number couldn&#8217;t start with 0. Here is my take over the problem. There are three basic things [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=ciju.wordpress.com&blog=3808858&post=34&subd=ciju&ref=&feed=1" />]]></description>
		<wfw:commentRss>http://ciju.wordpress.com/2008/06/30/beust-sequence-aka-sequence-of-numbers-without-repeating-digits/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">ciju</media:title>
		</media:content>
	</item>
		<item>
		<title>twiddling with weblogger.el (emacs + wordpress)</title>
		<link>http://ciju.wordpress.com/2008/06/06/twiddling-with-webloggerel-emacs-wordpress/</link>
		<comments>http://ciju.wordpress.com/2008/06/06/twiddling-with-webloggerel-emacs-wordpress/#comments</comments>
		<pubDate>Fri, 06 Jun 2008 07:05:44 +0000</pubDate>
		<dc:creator>ciju</dc:creator>
				<category><![CDATA[hacks]]></category>

		<guid isPermaLink="false">http://ciju.wordpress.com/2008/06/06/some-twiddling-with-webloggerel-emacs-wordpress/</guid>
		<description><![CDATA[Although wordpress.com provides a feature rich editor, I prefer writing my posts in emacs. Edit (in emacs), copy, paste (to wordpress) is possible, but more interesting would be to post from withing emacs. Thats were  weblogger.el  comes in.  Here is some help on how to  set it up. But still, I [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=ciju.wordpress.com&blog=3808858&post=14&subd=ciju&ref=&feed=1" />]]></description>
		<wfw:commentRss>http://ciju.wordpress.com/2008/06/06/twiddling-with-webloggerel-emacs-wordpress/feed/</wfw:commentRss>
		<slash:comments>4</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">ciju</media:title>
		</media:content>
	</item>
		<item>
		<title>google treasure hunt</title>
		<link>http://ciju.wordpress.com/2008/06/03/google-treasure-hunt/</link>
		<comments>http://ciju.wordpress.com/2008/06/03/google-treasure-hunt/#comments</comments>
		<pubDate>Tue, 03 Jun 2008 23:44:53 +0000</pubDate>
		<dc:creator>ciju</dc:creator>
				<category><![CDATA[algorithms]]></category>
		<category><![CDATA[programming]]></category>

		<guid isPermaLink="false">http://ciju.wordpress.com/2008/06/03/treasure-hunt-google/</guid>
		<description><![CDATA[Two problems from Google treasure hunt, which although not quite tough, but nevertheless were interesting.
One was about a robot starting from top left corner of a matrix, trying to reach the bottom right corner. Robot could only go right or down. The problem was to find the number of unique possible paths. My first thought [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=ciju.wordpress.com&blog=3808858&post=10&subd=ciju&ref=&feed=1" />]]></description>
		<wfw:commentRss>http://ciju.wordpress.com/2008/06/03/google-treasure-hunt/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">ciju</media:title>
		</media:content>
	</item>
		<item>
		<title>Problem 4-2</title>
		<link>http://ciju.wordpress.com/2008/06/02/problem-4-2/</link>
		<comments>http://ciju.wordpress.com/2008/06/02/problem-4-2/#comments</comments>
		<pubDate>Mon, 02 Jun 2008 07:09:28 +0000</pubDate>
		<dc:creator>ciju</dc:creator>
				<category><![CDATA[algorithms]]></category>
		<category><![CDATA[clrs]]></category>
		<category><![CDATA[programming]]></category>

		<guid isPermaLink="false">http://ciju.wordpress.com/2008/06/02/problem-4-2/</guid>
		<description><![CDATA[Problem:
Given, an array of size  with distinct elements such that  for each element . Note that the array should be missing an integer from range [], as the array has size  and the range has  elements. The only way to access elements is through function

bit_access(int * A, int i, int j)

which [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=ciju.wordpress.com&blog=3808858&post=6&subd=ciju&ref=&feed=1" />]]></description>
		<wfw:commentRss>http://ciju.wordpress.com/2008/06/02/problem-4-2/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">ciju</media:title>
		</media:content>
	</item>
		<item>
		<title>subtleties of programming</title>
		<link>http://ciju.wordpress.com/2008/05/30/subtleties-of-programming/</link>
		<comments>http://ciju.wordpress.com/2008/05/30/subtleties-of-programming/#comments</comments>
		<pubDate>Fri, 30 May 2008 00:51:02 +0000</pubDate>
		<dc:creator>ciju</dc:creator>
				<category><![CDATA[programming]]></category>

		<guid isPermaLink="false">http://ciju.wordpress.com/2008/05/30/subtilities-of-programming/</guid>
		<description><![CDATA[While coding for the  problem-2.3-7 , some how I was not in my default mode of not thinking while coding. To test my programs I was writing a random array generator. One part of it was to swap two array entries.  Now, the most straight forward way to swap two array elements is

int [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=ciju.wordpress.com&blog=3808858&post=5&subd=ciju&ref=&feed=1" />]]></description>
		<wfw:commentRss>http://ciju.wordpress.com/2008/05/30/subtleties-of-programming/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">ciju</media:title>
		</media:content>
	</item>
		<item>
		<title>problem 2.3-7</title>
		<link>http://ciju.wordpress.com/2008/05/28/problem-23-7/</link>
		<comments>http://ciju.wordpress.com/2008/05/28/problem-23-7/#comments</comments>
		<pubDate>Wed, 28 May 2008 00:00:00 +0000</pubDate>
		<dc:creator>ciju</dc:creator>
				<category><![CDATA[algorithms]]></category>
		<category><![CDATA[clrs]]></category>
		<category><![CDATA[programming]]></category>

		<guid isPermaLink="false">http://ciju.wordpress.com/?p=4</guid>
		<description><![CDATA[Problem:
We are given a set  of  integers, and another integer . And we need to find out if there exists two integers in the set  such that there sum is .
Approach:
The straight forward answer is to calculate sum for each possible pair of elements in , and see if any of them [...]<img alt="" border="0" src="http://stats.wordpress.com/b.gif?host=ciju.wordpress.com&blog=3808858&post=4&subd=ciju&ref=&feed=1" />]]></description>
		<wfw:commentRss>http://ciju.wordpress.com/2008/05/28/problem-23-7/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
	
		<media:content url="" medium="image">
			<media:title type="html">ciju</media:title>
		</media:content>
	</item>
	</channel>
</rss>