<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	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:media="http://search.yahoo.com/mrss/"
		>
<channel>
	<title>Comments for LoBlog</title>
	<atom:link href="http://loblog.wordpress.com/comments/feed/" rel="self" type="application/rss+xml" />
	<link>http://loblog.wordpress.com</link>
	<description>Tante Lore's Weblog</description>
	<lastBuildDate>Mon, 12 Oct 2009 09:59:38 +0000</lastBuildDate>
	<generator>http://wordpress.com/</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>Comment on Programming Challenge: The 3n+1 problem by shamsa</title>
		<link>http://loblog.wordpress.com/2007/03/29/programming-challenge-the-3n1-problem/#comment-6544</link>
		<dc:creator>shamsa</dc:creator>
		<pubDate>Mon, 12 Oct 2009 09:59:38 +0000</pubDate>
		<guid isPermaLink="false">http://loblog.wordpress.com/2007/03/29/programming-challenge-the-3n1-problem/#comment-6544</guid>
		<description>how can I use this code but in Java???</description>
		<content:encoded><![CDATA[<p>how can I use this code but in Java???</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Acer Travelmate 4002: Optisches Laufwerk tauschen by Valter Simoes</title>
		<link>http://loblog.wordpress.com/2007/11/12/acer-travelmate-4002-optisches-laufwerk-tauschen/#comment-6540</link>
		<dc:creator>Valter Simoes</dc:creator>
		<pubDate>Fri, 17 Jul 2009 12:31:41 +0000</pubDate>
		<guid isPermaLink="false">http://loblog.wordpress.com/2007/11/12/acer-travelmate-4002-optisches-laufwerk-tauschen/#comment-6540</guid>
		<description>Thanks man. You save me a lot of work. Take care.</description>
		<content:encoded><![CDATA[<p>Thanks man. You save me a lot of work. Take care.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Programming Challenge: The 3n+1 problem by ahmad daneshvar</title>
		<link>http://loblog.wordpress.com/2007/03/29/programming-challenge-the-3n1-problem/#comment-6539</link>
		<dc:creator>ahmad daneshvar</dc:creator>
		<pubDate>Sat, 11 Jul 2009 13:45:33 +0000</pubDate>
		<guid isPermaLink="false">http://loblog.wordpress.com/2007/03/29/programming-challenge-the-3n1-problem/#comment-6539</guid>
		<description>hello
i submit this program but i get (Time limit exceeded) error.
my program run in 3.000 sec.
Pleas help me to correct that.
my code:

#include &quot;iostream&quot;
using namespace std;

int main(){
	unsigned int inI,
		inJ;
	int	counter,MaxCounter;
	do{
		MaxCounter=0;
		cin&gt;&gt;inI&gt;&gt;inJ;
		cout&lt;&lt;inI&lt;&lt;&quot; &quot;&lt;&lt;inJ&lt;1){
				curpos=(curpos%2)?(3*curpos)+1:curpos/2;
				counter++;
			}
			if (counter&gt;MaxCounter) MaxCounter=counter;
			inI++;
		}while(inI&lt;=inJ);
		cout&lt;&lt;MaxCounter&lt;&lt;&quot;\n&quot;;
	}while(inI);
	return 0;
}</description>
		<content:encoded><![CDATA[<p>hello<br />
i submit this program but i get (Time limit exceeded) error.<br />
my program run in 3.000 sec.<br />
Pleas help me to correct that.<br />
my code:</p>
<p>#include &#8220;iostream&#8221;<br />
using namespace std;</p>
<p>int main(){<br />
	unsigned int inI,<br />
		inJ;<br />
	int	counter,MaxCounter;<br />
	do{<br />
		MaxCounter=0;<br />
		cin&gt;&gt;inI&gt;&gt;inJ;<br />
		cout&lt;&lt;inI&lt;&lt;&quot; &quot;&lt;&lt;inJ&lt;1){<br />
				curpos=(curpos%2)?(3*curpos)+1:curpos/2;<br />
				counter++;<br />
			}<br />
			if (counter&gt;MaxCounter) MaxCounter=counter;<br />
			inI++;<br />
		}while(inI&lt;=inJ);<br />
		cout&lt;&lt;MaxCounter&lt;&lt;&quot;\n&quot;;<br />
	}while(inI);<br />
	return 0;<br />
}</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Programming Challenge: The 3n+1 problem by marcin</title>
		<link>http://loblog.wordpress.com/2007/03/29/programming-challenge-the-3n1-problem/#comment-6538</link>
		<dc:creator>marcin</dc:creator>
		<pubDate>Wed, 24 Jun 2009 09:30:50 +0000</pubDate>
		<guid isPermaLink="false">http://loblog.wordpress.com/2007/03/29/programming-challenge-the-3n1-problem/#comment-6538</guid>
		<description>It is a good solution: 
#include
#include
using namespace std;

long cycleLen(unsigned long n)
{
     int len=1;
     while(n!=1)
     {
         if(n%2==1)
         {
                  n=3*n+1;
         }
         else
         {
                  n=n/2;    
         }
         len=len+1;
     }   
     return len;
}
void swap(unsigned long&amp; i, unsigned long&amp; j)
{
     unsigned long tmp=0;
     tmp=i;
     i=j;
     j=tmp;
}
int main()
{
     unsigned long i=0,oldi=0;
     unsigned long j=0,oldj=0;
     unsigned long max=0;
     unsigned long tmp=0;
     while(cin&gt;&gt;i &amp;&amp; cin&gt;&gt;j)
     {        
         oldi=i;
         oldj=j;     
         if(i&gt;j)
         {
                swap(i,j);
         }         
         for(unsigned long p=i;p&lt;=j;p++)
         {     
               tmp=cycleLen(p);    
               if(max&lt;tmp)
               {
                   max=tmp;
               }
         }
         cout&lt;&lt;oldi&lt;&lt;&quot; &quot;&lt;&lt;oldj&lt;&lt;&quot; &quot;&lt;&lt;max&lt;&lt;&quot;\n&quot;;        
         max=0;
     }
     return 0;
}

if input is 

10 1

output should be
1 10 20
:)</description>
		<content:encoded><![CDATA[<p>It is a good solution:<br />
#include<br />
#include<br />
using namespace std;</p>
<p>long cycleLen(unsigned long n)<br />
{<br />
     int len=1;<br />
     while(n!=1)<br />
     {<br />
         if(n%2==1)<br />
         {<br />
                  n=3*n+1;<br />
         }<br />
         else<br />
         {<br />
                  n=n/2;<br />
         }<br />
         len=len+1;<br />
     }<br />
     return len;<br />
}<br />
void swap(unsigned long&amp; i, unsigned long&amp; j)<br />
{<br />
     unsigned long tmp=0;<br />
     tmp=i;<br />
     i=j;<br />
     j=tmp;<br />
}<br />
int main()<br />
{<br />
     unsigned long i=0,oldi=0;<br />
     unsigned long j=0,oldj=0;<br />
     unsigned long max=0;<br />
     unsigned long tmp=0;<br />
     while(cin&gt;&gt;i &amp;&amp; cin&gt;&gt;j)<br />
     {<br />
         oldi=i;<br />
         oldj=j;<br />
         if(i&gt;j)<br />
         {<br />
                swap(i,j);<br />
         }<br />
         for(unsigned long p=i;p&lt;=j;p++)<br />
         {<br />
               tmp=cycleLen(p);<br />
               if(max&lt;tmp)<br />
               {<br />
                   max=tmp;<br />
               }<br />
         }<br />
         cout&lt;&lt;oldi&lt;&lt;&quot; &quot;&lt;&lt;oldj&lt;&lt;&quot; &quot;&lt;&lt;max&lt;&lt;&quot;\n&quot;;<br />
         max=0;<br />
     }<br />
     return 0;<br />
}</p>
<p>if input is </p>
<p>10 1</p>
<p>output should be<br />
1 10 20<br />
 <img src='http://s.wordpress.com/wp-includes/images/smilies/icon_smile.gif' alt=':)' class='wp-smiley' /> </p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Programming Challenge: The 3n+1 problem by sazzadur rahaman</title>
		<link>http://loblog.wordpress.com/2007/03/29/programming-challenge-the-3n1-problem/#comment-6530</link>
		<dc:creator>sazzadur rahaman</dc:creator>
		<pubDate>Thu, 16 Apr 2009 08:37:53 +0000</pubDate>
		<guid isPermaLink="false">http://loblog.wordpress.com/2007/03/29/programming-challenge-the-3n1-problem/#comment-6530</guid>
		<description>#include

unsigned short length(unsigned long n);


int main()
{
	
	unsigned long i,a,b,x,y;
	 int max = 0;
	 int temp = 0;

	while(scanf(&quot;%lu %lu&quot;,&amp;a,&amp;b)==2)
	{
		 x = a;
		 y = b;

		if(a &gt; b)
		{
			a = y;
			b = x;
		}
		
		for(i = a;imax)
			{
				max = temp;
			}
		}

		printf(&quot;%lu %lu %d\n&quot;,a,b,max);
		max = 0;
	}
	return 0;
}

int length(unsigned long n)
{
	int len = 1;

	while(n!=1)
	{
		if(n%2==1)
		{
			n = 3*n + 1;
		}
		else
		{
			n = n/2;
		}

		len++;
	}
	return len;
}</description>
		<content:encoded><![CDATA[<p>#include</p>
<p>unsigned short length(unsigned long n);</p>
<p>int main()<br />
{</p>
<p>	unsigned long i,a,b,x,y;<br />
	 int max = 0;<br />
	 int temp = 0;</p>
<p>	while(scanf(&#8220;%lu %lu&#8221;,&amp;a,&amp;b)==2)<br />
	{<br />
		 x = a;<br />
		 y = b;</p>
<p>		if(a &gt; b)<br />
		{<br />
			a = y;<br />
			b = x;<br />
		}</p>
<p>		for(i = a;imax)<br />
			{<br />
				max = temp;<br />
			}<br />
		}</p>
<p>		printf(&#8220;%lu %lu %d\n&#8221;,a,b,max);<br />
		max = 0;<br />
	}<br />
	return 0;<br />
}</p>
<p>int length(unsigned long n)<br />
{<br />
	int len = 1;</p>
<p>	while(n!=1)<br />
	{<br />
		if(n%2==1)<br />
		{<br />
			n = 3*n + 1;<br />
		}<br />
		else<br />
		{<br />
			n = n/2;<br />
		}</p>
<p>		len++;<br />
	}<br />
	return len;<br />
}</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Programming Challenge: The 3n+1 problem by sazzadur rahaman</title>
		<link>http://loblog.wordpress.com/2007/03/29/programming-challenge-the-3n1-problem/#comment-6529</link>
		<dc:creator>sazzadur rahaman</dc:creator>
		<pubDate>Thu, 16 Apr 2009 08:36:08 +0000</pubDate>
		<guid isPermaLink="false">http://loblog.wordpress.com/2007/03/29/programming-challenge-the-3n1-problem/#comment-6529</guid>
		<description>when ever I submitted this problem...
I got wrong ans...
cn any one help me to get rid of the porb...

plssssssssssssssss...


#include

unsigned short length(unsigned long n);


int main()
{
	
	unsigned long i,a,b,x,y;
	 int max = 0;
	 int temp = 0;

	while(scanf(&quot;%lu %lu&quot;,&amp;a,&amp;b)==2)
	{
		 x = a;
		 y = b;

		if(a &gt; b)
		{
			a = y;
			b = x;
		}
		
		for(i = a;imax)
			{
				max = temp;
			}
		}

		printf(&quot;%lu %lu %d\n&quot;,a,b,max);
		max = 0;
	}
	return 0;
}

int length(unsigned long n)
{
	int len = 1;

	while(n!=1)
	{
		if(n%2==1)
		{
			n = 3*n + 1;
		}
		else
		{
			n = n/2;
		}

		len++;
	}
	return len;
}</description>
		<content:encoded><![CDATA[<p>when ever I submitted this problem&#8230;<br />
I got wrong ans&#8230;<br />
cn any one help me to get rid of the porb&#8230;</p>
<p>plssssssssssssssss&#8230;</p>
<p>#include</p>
<p>unsigned short length(unsigned long n);</p>
<p>int main()<br />
{</p>
<p>	unsigned long i,a,b,x,y;<br />
	 int max = 0;<br />
	 int temp = 0;</p>
<p>	while(scanf(&#8220;%lu %lu&#8221;,&amp;a,&amp;b)==2)<br />
	{<br />
		 x = a;<br />
		 y = b;</p>
<p>		if(a &gt; b)<br />
		{<br />
			a = y;<br />
			b = x;<br />
		}</p>
<p>		for(i = a;imax)<br />
			{<br />
				max = temp;<br />
			}<br />
		}</p>
<p>		printf(&#8220;%lu %lu %d\n&#8221;,a,b,max);<br />
		max = 0;<br />
	}<br />
	return 0;<br />
}</p>
<p>int length(unsigned long n)<br />
{<br />
	int len = 1;</p>
<p>	while(n!=1)<br />
	{<br />
		if(n%2==1)<br />
		{<br />
			n = 3*n + 1;<br />
		}<br />
		else<br />
		{<br />
			n = n/2;<br />
		}</p>
<p>		len++;<br />
	}<br />
	return len;<br />
}</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Programming Challenge: The 3n+1 problem by NN</title>
		<link>http://loblog.wordpress.com/2007/03/29/programming-challenge-the-3n1-problem/#comment-6528</link>
		<dc:creator>NN</dc:creator>
		<pubDate>Mon, 13 Apr 2009 15:48:17 +0000</pubDate>
		<guid isPermaLink="false">http://loblog.wordpress.com/2007/03/29/programming-challenge-the-3n1-problem/#comment-6528</guid>
		<description>The Common Lisp guy doesn&#039;t realize that the judge will run the program on a larger set of numbers, thus vastly increasing the run time.  Try 1...999999 instead.</description>
		<content:encoded><![CDATA[<p>The Common Lisp guy doesn&#8217;t realize that the judge will run the program on a larger set of numbers, thus vastly increasing the run time.  Try 1&#8230;999999 instead.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Programming Challenge: The 3n+1 problem by Phoenix</title>
		<link>http://loblog.wordpress.com/2007/03/29/programming-challenge-the-3n1-problem/#comment-6526</link>
		<dc:creator>Phoenix</dc:creator>
		<pubDate>Thu, 02 Apr 2009 18:31:06 +0000</pubDate>
		<guid isPermaLink="false">http://loblog.wordpress.com/2007/03/29/programming-challenge-the-3n1-problem/#comment-6526</guid>
		<description>I submitted your solution to the online judge and got the verdict wrong answer.</description>
		<content:encoded><![CDATA[<p>I submitted your solution to the online judge and got the verdict wrong answer.</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Toshiba P10 schaltet sich ab by Jann</title>
		<link>http://loblog.wordpress.com/2006/03/08/toshiba-p10-schaltet-sich-ab/#comment-6517</link>
		<dc:creator>Jann</dc:creator>
		<pubDate>Fri, 23 Jan 2009 19:23:49 +0000</pubDate>
		<guid isPermaLink="false">http://loblog.wordpress.com/2006/03/08/toshiba-p10-schaltet-sich-ab/#comment-6517</guid>
		<description>Moin,

vielen Dank für die Anleitung. Die Reinigung hat damit perfekt geklappt. Vorbereitung ist alles! Nach über 5 Jahren war da jede Menge Staub drin (das da überhaupt noch gekühlt werden konnte...?).

Viele Grüße

Jann</description>
		<content:encoded><![CDATA[<p>Moin,</p>
<p>vielen Dank für die Anleitung. Die Reinigung hat damit perfekt geklappt. Vorbereitung ist alles! Nach über 5 Jahren war da jede Menge Staub drin (das da überhaupt noch gekühlt werden konnte&#8230;?).</p>
<p>Viele Grüße</p>
<p>Jann</p>
]]></content:encoded>
	</item>
	<item>
		<title>Comment on Acer Travelmate 4002: Optisches Laufwerk tauschen by FLO</title>
		<link>http://loblog.wordpress.com/2007/11/12/acer-travelmate-4002-optisches-laufwerk-tauschen/#comment-6515</link>
		<dc:creator>FLO</dc:creator>
		<pubDate>Tue, 20 Jan 2009 16:33:58 +0000</pubDate>
		<guid isPermaLink="false">http://loblog.wordpress.com/2007/11/12/acer-travelmate-4002-optisches-laufwerk-tauschen/#comment-6515</guid>
		<description>Danke, hat mir geholfen das Keyboard in 5min zu wechseln.</description>
		<content:encoded><![CDATA[<p>Danke, hat mir geholfen das Keyboard in 5min zu wechseln.</p>
]]></content:encoded>
	</item>
</channel>
</rss>
