<?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"
	>

<channel>
	<title>Founds</title>
	<atom:link href="http://blog.dataparksearch.org/feed" rel="self" type="application/rss+xml" />
	<link>http://blog.dataparksearch.org</link>
	<description>Just DataparkSearch weblog</description>
	<pubDate>Sun, 28 Sep 2008 13:51:12 +0000</pubDate>
	<generator>http://wordpress.org/?v=2.6.1</generator>
	<language>en</language>
			<item>
		<title>dpsearch-4.51-27092008</title>
		<link>http://blog.dataparksearch.org/128</link>
		<comments>http://blog.dataparksearch.org/128#comments</comments>
		<pubDate>Sun, 28 Sep 2008 13:51:12 +0000</pubDate>
		<dc:creator>Maxime</dc:creator>
		
		<category><![CDATA[DataparkSearch]]></category>

		<guid isPermaLink="false">http://blog.dataparksearch.org/?p=128</guid>
		<description><![CDATA[Changes from version 4.50, added to the previous snapshot:

SubDocCnt command has been added. Use it to specity the maximal number of sub-documents indexed per one document.
SubDocLevel command has been added. Use it to specify maximal nesting level for sub-documents.
HrefSection proccessing has been fixed in XML parser.
$(url.directory) meta-variable has been added.
storedoc.cgi accepts now the name of [...]]]></description>
		<wfw:commentRss>http://blog.dataparksearch.org/128/feed</wfw:commentRss>
		</item>
		<item>
		<title>Color maps of Neo PopRank</title>
		<link>http://blog.dataparksearch.org/124</link>
		<comments>http://blog.dataparksearch.org/124#comments</comments>
		<pubDate>Sat, 13 Sep 2008 11:21:52 +0000</pubDate>
		<dc:creator>Maxime</dc:creator>
		
		<category><![CDATA[43N39E]]></category>

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

		<guid isPermaLink="false">http://blog.dataparksearch.org/?p=124</guid>
		<description><![CDATA[In addition to maps of the New Zealand&#8217;s Internet (TLD .nz) I made similar maps for the Belgian Internet (TLD .be). Each point on a map matching a site in one or another segment of the Internet. The color of point depends on the value of Neo PopRank for corresponding site in search engine 43N [...]]]></description>
		<wfw:commentRss>http://blog.dataparksearch.org/124/feed</wfw:commentRss>
		</item>
		<item>
		<title>dpsearch-4.51-11082008</title>
		<link>http://blog.dataparksearch.org/122</link>
		<comments>http://blog.dataparksearch.org/122#comments</comments>
		<pubDate>Tue, 12 Aug 2008 06:18:42 +0000</pubDate>
		<dc:creator>Maxime</dc:creator>
		
		<category><![CDATA[DataparkSearch]]></category>

		<guid isPermaLink="false">http://blog.dataparksearch.org/?p=122</guid>
		<description><![CDATA[Changes since version 4.50 are:

allin&#60;section&#62;: operator has been added to the search query language.
storedoc.cgi takes now document from remote host if it unable to fetch it from stored database.


1. The operator allin&#60;section&#62;:, where &#60;section&#62; is the name of a section, defined in sections.conf file (or in any dpsearch&#8217;s configuration file by Section command) with non-zero [...]]]></description>
		<wfw:commentRss>http://blog.dataparksearch.org/122/feed</wfw:commentRss>
		</item>
		<item>
		<title>www/dpsearch</title>
		<link>http://blog.dataparksearch.org/117</link>
		<comments>http://blog.dataparksearch.org/117#comments</comments>
		<pubDate>Wed, 30 Jul 2008 14:42:53 +0000</pubDate>
		<dc:creator>Maxime</dc:creator>
		
		<category><![CDATA[DataparkSearch]]></category>

		<guid isPermaLink="false">http://blog.dataparksearch.org/117</guid>
		<description><![CDATA[FreeBSD’s port www/dpsearch has been updated to the latest version of DataparkSearch released, 4.50.
Share This
]]></description>
		<wfw:commentRss>http://blog.dataparksearch.org/117/feed</wfw:commentRss>
		</item>
		<item>
		<title>Text Messaging Outrage</title>
		<link>http://blog.dataparksearch.org/114</link>
		<comments>http://blog.dataparksearch.org/114#comments</comments>
		<pubDate>Sun, 27 Jul 2008 11:18:35 +0000</pubDate>
		<dc:creator>Maxime</dc:creator>
		
		<category><![CDATA[Algorithms and technologies]]></category>

		<guid isPermaLink="false">http://blog.dataparksearch.org/?p=114</guid>
		<description><![CDATA[My solution for the Text Messaging Outrage problem of Round 1C of Google Code Jam 2008 contest:

#include &#60;stdio.h&#62;
#include &#60;string.h&#62;
#include &#60;stdlib.h&#62;

typedef struct {
  int num;
  long long freq;
} FREQ;

int cmpF(const void *v1, const void *v2) {
  FREQ *e1 = (FREQ*)v1, *e2 = (FREQ*)v2;
  if (e1-&#62;freq &#60; e2-&#62;freq) return 1;
  if (e1-&#62;freq [...]]]></description>
		<wfw:commentRss>http://blog.dataparksearch.org/114/feed</wfw:commentRss>
		</item>
		<item>
		<title>DataparkSearch 4.50</title>
		<link>http://blog.dataparksearch.org/112</link>
		<comments>http://blog.dataparksearch.org/112#comments</comments>
		<pubDate>Sat, 26 Jul 2008 20:28:41 +0000</pubDate>
		<dc:creator>Maxime</dc:creator>
		
		<category><![CDATA[DataparkSearch]]></category>

		<guid isPermaLink="false">http://blog.dataparksearch.org/?p=112</guid>
		<description><![CDATA[A new version, 4.50, of DataparkSearch Engine has been released. Changes since version 4.49 are:

Default value for PopRankSkipSameSite command has been changed to &#8220;yes&#8221;.
Possible memory leak has been fixed for a sub-document indexed from stored database.
The strict option has been added for Section command.
A word break has been added for French-style contractions.
Big lists of Russian [...]]]></description>
		<wfw:commentRss>http://blog.dataparksearch.org/112/feed</wfw:commentRss>
		</item>
		<item>
		<title>Numbers</title>
		<link>http://blog.dataparksearch.org/110</link>
		<comments>http://blog.dataparksearch.org/110#comments</comments>
		<pubDate>Sat, 26 Jul 2008 07:08:45 +0000</pubDate>
		<dc:creator>Maxime</dc:creator>
		
		<category><![CDATA[Algorithms and technologies]]></category>

		<guid isPermaLink="false">http://blog.dataparksearch.org/?p=110</guid>
		<description><![CDATA[My solution for the Numbers problem of Round 1A of Google Code Jam 2008 contest. It works too long for Large input.


#!/usr/bin/perl
use Math::BigFloat;
use POSIX;

$N = &#60;STDIN&#62;;

for ($iN = 0; $iN &#60; $N; $iN++) {
    $n = &#60;STDIN&#62;;
    $sqfive = Math::BigFloat-&#62;new(5);
    $sqfive-&#62;bsqrt();
    $three = [...]]]></description>
		<wfw:commentRss>http://blog.dataparksearch.org/110/feed</wfw:commentRss>
		</item>
		<item>
		<title>Minimum Scalar Product</title>
		<link>http://blog.dataparksearch.org/108</link>
		<comments>http://blog.dataparksearch.org/108#comments</comments>
		<pubDate>Sat, 26 Jul 2008 03:35:51 +0000</pubDate>
		<dc:creator>Maxime</dc:creator>
		
		<category><![CDATA[Algorithms and technologies]]></category>

		<guid isPermaLink="false">http://blog.dataparksearch.org/?p=108</guid>
		<description><![CDATA[My solution for the Minimum Scalar Product problem of Round 1A of Google Code Jam 2008:


#include &#60;stdio.h&#62;
#include &#60;string.h&#62;
#include &#60;stdlib.h&#62;

int cmpA(const void *v1, const void *v2) {
  int *e1 = (int*)v1, *e2 = (int*)v2;
  if (*e1 &#60; *e2) return 1;
  if (*e1 &#62; *e2) return -1;
  return 0;
}
int cmpB(const void *v1, const [...]]]></description>
		<wfw:commentRss>http://blog.dataparksearch.org/108/feed</wfw:commentRss>
		</item>
		<item>
		<title>Train Timetable</title>
		<link>http://blog.dataparksearch.org/105</link>
		<comments>http://blog.dataparksearch.org/105#comments</comments>
		<pubDate>Sun, 20 Jul 2008 09:26:33 +0000</pubDate>
		<dc:creator>Maxime</dc:creator>
		
		<category><![CDATA[Algorithms and technologies]]></category>

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

		<guid isPermaLink="false">http://blog.dataparksearch.org/?p=105</guid>
		<description><![CDATA[My solution for the Train Timetable task of Google Code Jam 2008 qualification round:


#include &#60;stdio.h&#62;
#include &#60;string.h&#62;
#include &#60;stdlib.h&#62;

typedef struct {
  int d[24*60];
  int a[24*60];
} STATION;

main () {
  char str[4096];
  STATION A, B;

  int N, T, NA, NB;
  int i, iN;
  int dh, dm, ah, am;
  int resultA, resultB;

 [...]]]></description>
		<wfw:commentRss>http://blog.dataparksearch.org/105/feed</wfw:commentRss>
		</item>
		<item>
		<title>Saving the Universe</title>
		<link>http://blog.dataparksearch.org/101</link>
		<comments>http://blog.dataparksearch.org/101#comments</comments>
		<pubDate>Sun, 20 Jul 2008 09:08:13 +0000</pubDate>
		<dc:creator>Maxime</dc:creator>
		
		<category><![CDATA[Algorithms and technologies]]></category>

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

		<guid isPermaLink="false">http://blog.dataparksearch.org/?p=101</guid>
		<description><![CDATA[My solution for the Saving the Universe task of Google Code Jam 2008 qualification round:


#include &#60;stdio.h&#62;
#include &#60;string.h&#62;
#include &#60;stdlib.h&#62;

typedef struct {
  char *name;
  int num;
} ENGINE;

int cmpEngines(const void *v1, const void *v2) {
  ENGINE *e1 = (ENGINE*)v1, *e2 = (ENGINE*)v2;
  return strcmp(e1-&#62;name, e2-&#62;name);
}

int askEngineNum(char *name, ENGINE *base, int numb) {
  ENGINE [...]]]></description>
		<wfw:commentRss>http://blog.dataparksearch.org/101/feed</wfw:commentRss>
		</item>
	</channel>
</rss>
