https://www.adonaimedrado.pro.br/wiki/index.php?action=history&feed=atom&title=Solu%C3%A7%C3%A3o%3A_Impedido_-_SPOJ_%28Luis_Bernardo%29 2026-05-27T16:39:50Z 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:_Impedido_-_SPOJ_(Luis_Bernardo)&diff=2746&oldid=prev 2009-04-29T12:25:28Z

<p>New page: &lt;code lang=&quot;c&quot;&gt; #include &lt;stdio.h&gt; #include &lt;stdlib.h&gt; char temImpedido(const int *,int, const int *, int); int main(){ int numAtacante,numDefensor,index,num; int *posicaoAtacantes;...</p> <p><b>New page</b></p><div>&lt;code lang=&quot;c&quot;&gt;<br /> #include &lt;stdio.h&gt;<br /> #include &lt;stdlib.h&gt;<br /> <br /> char temImpedido(const int *,int, const int *, int); <br /> <br /> int main(){<br /> int numAtacante,numDefensor,index,num;<br /> int *posicaoAtacantes;<br /> int *posicaoDefensores;<br /> scanf(&quot;%d %d&quot;,&amp;numAtacante,&amp;numDefensor);<br /> while((numAtacante!=0)&amp;&amp;(numDefensor!=0)){<br /> posicaoAtacantes = (int *) malloc(sizeof(int)*numAtacante);<br /> posicaoDefensores = (int *) malloc(sizeof(int)*numDefensor);<br /> for(index = 0; index&lt;numAtacante ;index++){<br /> scanf(&quot;%d&quot;,&amp;num);<br /> posicaoAtacantes[index] = num;<br /> }<br /> for(index = 0; index&lt;numDefensor ;index++){<br /> scanf(&quot;%d&quot;,&amp;num);<br /> posicaoDefensores[index] = num;<br /> }<br /> printf(&quot;%c\n&quot;,temImpedido(posicaoAtacantes,<br /> numAtacante,<br /> posicaoDefensores,<br /> numDefensor)); <br /> scanf(&quot;%d %d&quot;,&amp;numAtacante,&amp;numDefensor);<br /> }<br /> return 0;<br /> }<br /> <br /> char temImpedido(const int * atacante,int sizeA, const int * defensor,int sizeD){<br /> int index,achou,index2;<br /> int numDefensor = 0;<br /> achou = 0;<br /> for(index = 0; index&lt; sizeA;index++){<br /> numDefensor = 0;<br /> for(index2 = 0; index2 &lt; sizeD; index2++){<br /> if(defensor[index2]&lt;= atacante[index])<br /> numDefensor++;<br /> }<br /> if(numDefensor &lt; 2){<br /> achou = 1; <br /> break;<br /> }<br /> }<br /> if(achou)<br /> return 'Y';<br /> else<br /> return 'N';<br /> }<br /> &lt;/code&gt;</div>

200.17.147.2