https://www.adonaimedrado.pro.br/wiki/index.php?action=history&feed=atom&title=Solu%C3%A7%C3%A3o%3A_Domin%C3%B3_-_OBI_%28Filipe_Teles%29 2026-05-27T20:50:28Z Revision history for this page on the wiki MediaWiki 1.26.2 https://www.adonaimedrado.pro.br/wiki/index.php?title=Solu%C3%A7%C3%A3o:_Domin%C3%B3_-_OBI_(Filipe_Teles)&diff=3005&oldid=prev 2009-06-03T12:43:21Z

<p>New page: &lt;code lang=cpp&gt; #include &lt;iostream&gt; using namespace std; typedef struct P { int n; int bucha; } peca; int main() { int entrada, esq, dir, teste = 1, cont = 0, i; peca mesa[7]; fo...</p> <p><b>New page</b></p><div>&lt;code lang=cpp&gt;<br /> <br /> #include &lt;iostream&gt;<br /> <br /> using namespace std;<br /> <br /> typedef struct P<br /> {<br /> int n;<br /> int bucha;<br /> } peca;<br /> <br /> int main()<br /> {<br /> int entrada, esq, dir, teste = 1, cont = 0, i;<br /> peca mesa[7];<br /> <br /> for (int j = 0; j &lt; 7; j++)<br /> {<br /> mesa[j].n = 0;<br /> mesa[j].bucha = 0;<br /> }<br /> <br /> cin &gt;&gt; entrada;<br /> <br /> while (entrada)<br /> {<br /> while(entrada--)<br /> {<br /> cin &gt;&gt; esq &gt;&gt; dir;<br /> <br /> if ( (esq == dir) &amp;&amp; (!mesa[esq].n) )<br /> {<br /> mesa[esq].n = 2;<br /> mesa[esq].bucha++;<br /> }<br /> else<br /> {<br /> mesa[esq].n++;<br /> mesa[esq].bucha = 0;<br /> mesa[dir].n++;<br /> mesa[dir].bucha = 0;<br /> } <br /> }<br /> <br /> i = 0;<br /> for (; i &lt; 7; i++)<br /> {<br /> if (mesa[i].n % 2)<br /> cont++; <br /> <br /> if ( (mesa[i].bucha) || (cont &gt; 2) )<br /> {<br /> cout &lt;&lt; &quot;Teste &quot; &lt;&lt; teste &lt;&lt; endl &lt;&lt; &quot;nao\n\n&quot;;<br /> break;<br /> }<br /> }<br /> <br /> if (i == 7)<br /> cout &lt;&lt; &quot;Teste &quot; &lt;&lt; teste &lt;&lt; endl &lt;&lt; &quot;sim\n\n&quot;;<br /> <br /> teste++;<br /> <br /> for (int j = 0; j &lt; 7; j++)<br /> {<br /> mesa[j].n = 0;<br /> mesa[j].bucha = 0;<br /> }<br /> <br /> cont = 0;<br /> cin &gt;&gt; entrada;<br /> }<br /> }<br /> <br /> <br /> &lt;/code&gt;</div>

200.17.147.2