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

<channel>
	<title>Sippert, Tiago A. S. &#187; recursao</title>
	<atom:link href="http://sippert.com.br/tag/recursao/feed/" rel="self" type="application/rss+xml" />
	<link>http://sippert.com.br</link>
	<description>Desenvolvimento de Sistemas e Websites</description>
	<lastBuildDate>Fri, 27 Nov 2009 23:10:51 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.8.4</generator>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
			<item>
		<title>Algoritmo: O imperador Lu Zhin Du</title>
		<link>http://sippert.com.br/algoritmos/algoritmo-o-imperador-lu-zhin-du-cc/</link>
		<comments>http://sippert.com.br/algoritmos/algoritmo-o-imperador-lu-zhin-du-cc/#comments</comments>
		<pubDate>Sat, 13 Sep 2008 14:22:01 +0000</pubDate>
		<dc:creator>sippert</dc:creator>
				<category><![CDATA[algoritmos]]></category>
		<category><![CDATA[recursao]]></category>

		<guid isPermaLink="false">http://sippert.com.br/?p=223</guid>
		<description><![CDATA[




Algoritmo de Maratona de Programação utilizando recursão:
#include&#60;iostream&#62;
using namespace std;
int m,n,k,mat[100][100],vis[100][100];
bool recursao(int i, int j){
	if(j==n-1) return true;
	vis[i][j]=1;
	bool parcial=false;
	if((j&#60;n-1)&#38;&#38;(!vis[i][j+1])&#38;&#38;(abs(mat[i][j+1]-mat[i][j])==k)) parcial=recursao(i,j+1);
	if((!parcial)&#38;&#38;(i&#62;0)&#38;&#38;(!vis[i-1][j])&#38;&#38;(abs(mat[i-1][j]-mat[i][j])==k)) parcial=recursao(i-1,j);
	if((!parcial)&#38;&#38;(j&#62;0)&#38;&#38;(!vis[i][j-1])&#38;&#38;(abs(mat[i][j-1]-mat[i][j])==k)) parcial=recursao(i,j-1);
	if((!parcial)&#38;&#38;(i&#60;m-1)&#38;&#38;(!vis[i+1][j])&#38;&#38;(abs(mat[i+1][j]-mat[i][j])==k)) parcial=recursao(i+1,j);
	return parcial;
}
int main(){
	int t=1;
	while((cin &#62;&#62; m &#62;&#62; n &#62;&#62; k)&#38;&#38;(m!=0)&#38;&#38;(n!=0)){
		memset(vis,0,sizeof(vis));
		for(int i=0;i&#60;m;i++)
			for(int j=0;j&#60;n;j++)
				cin &#62;&#62; mat[i][j];
		bool resposta=false;
		for(int i=0;((i&#60;m)&#38;&#38;(!resposta));i++) resposta=recursao(i,0);
		cout &#60;&#60; "Instancia " &#60;&#60; t++ &#60;&#60; endl &#60;&#60; ((resposta)?"sim":"nao") &#60;&#60; endl &#60;&#60; endl;
	}
	return 0;
}





]]></description>
		<wfw:commentRss>http://sippert.com.br/algoritmos/algoritmo-o-imperador-lu-zhin-du-cc/feed/</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
	</channel>
</rss>
