https://www.algopedia.ro/wiki/index.php?action=history&feed=atom&title=Primul-joc 2026-04-12T14:13:40Z Revision history for this page on the wiki MediaWiki 1.44.2 https://www.algopedia.ro/wiki/index.php?title=Primul-joc&diff=6727&oldid=prev 2013-06-19T11:27:07Z

<p>Created page with &quot;&lt;pre&gt;<span class="autocomment">Nume program : primul-joc.c Nume concurent : Priboi Radu si Alex Mitrofan: </span> #include &lt;stdio.h&gt; #include &lt;stdlib.h&gt; int v[30],v1[30],m16[30],m8[30],m4[30],m2[30]...&quot;</p> <p><b>New page</b></p><div>&lt;pre&gt;/*<br /> Nume program : primul-joc.c<br /> Nume concurent : Priboi Radu si Alex Mitrofan<br /> */<br /> #include &lt;stdio.h&gt;<br /> #include &lt;stdlib.h&gt;<br /> <br /> int v[30],v1[30],m16[30],m8[30],m4[30],m2[30],m1[30];<br /> <br /> int main()<br /> {int i,n,c1,j,n1,n2,cv,sm16,sm8,sm4,sm2,sm1,nrm;<br /> char c;<br /> i=0;<br /> do {<br /> scanf(&quot;%d&quot;,&amp;v[i]);<br /> c=fgetc(stdin);<br /> i++;<br /> } while (c!=&#039;\n&#039;);<br /> n=i;<br /> j=0;<br /> c1=0;<br /> for (i=0;i&lt;n;i++)<br /> if (v[i]!=0) {<br /> c1++;<br /> v1[j]=i;<br /> j++;<br /> }<br /> n1=j;<br /> if (c1==1) {<br /> i=0;<br /> while (v[i]==0)<br /> i++;<br /> v[i]=0;<br /> }<br /> if (c1==2) {<br /> if (v[v1[0]]==v[v1[1]])<br /> v[v1[0]]--;<br /> else<br /> if (v[v1[0]]&gt;v[v1[1]])<br /> v[v1[0]]=v[v1[1]];<br /> else<br /> if (v[v1[0]]&lt;v[v1[1]])<br /> v[v1[1]]=v[v1[0]];<br /> }<br /> else {<br /> for (i=0;i&lt;n;i++) {<br /> cv=v[i];<br /> while (cv&gt;=16) {<br /> m16[i]++;<br /> cv=cv-16;<br /> }<br /> while (cv&gt;=8) {<br /> m8[i]++;<br /> cv=cv-8;<br /> }<br /> while (cv&gt;=4) {<br /> m4[i]++;<br /> cv=cv-4;<br /> }<br /> while (cv&gt;=2) {<br /> m2[i]++;<br /> cv=cv-2;<br /> }<br /> while (cv&gt;=1) {<br /> m1[i]++;<br /> cv--;<br /> }<br /> }<br /> sm16=0;<br /> for (i=0;i&lt;n;i++)<br /> sm16=sm16+m16[i];<br /> sm8=0;<br /> for (i=0;i&lt;n;i++)<br /> sm8=sm8+m8[i];<br /> sm4=0;<br /> for (i=0;i&lt;n;i++)<br /> sm4=sm4+m4[i];<br /> sm2=0;<br /> for (i=0;i&lt;n;i++)<br /> sm2=sm2+m2[i];<br /> sm1=0;<br /> for (i=0;i&lt;n;i++)<br /> sm1=sm1+m1[i];<br /> if (sm16%2==1)<br /> sm16=1;<br /> else<br /> sm16=0;<br /> if (sm8%2==1)<br /> sm8=1;<br /> else<br /> sm8=0;<br /> if (sm4%2==1)<br /> sm4=1;<br /> else<br /> sm4=0;<br /> if (sm2%2==1)<br /> sm2=1;<br /> else<br /> sm2=0;<br /> if (sm1%2==1)<br /> sm1=1;<br /> else<br /> sm1=0;<br /> if (sm16+sm8+sm4+sm2+sm1&gt;=1) {<br /> if (sm16==1) {<br /> i=0;<br /> while (m16[i]==0)<br /> i++;<br /> v[i]=v[i]-16;<br /> }<br /> else<br /> if (sm8==1) {<br /> i=0;<br /> while (m8[i]==0)<br /> i++;<br /> v[i]=v[i]-8;<br /> }<br /> else<br /> if (sm4==1) {<br /> i=0;<br /> while (m4[i]==0)<br /> i++;<br /> v[i]=v[i]-4;<br /> }<br /> else<br /> if (sm2==1) {<br /> i=0;<br /> while (m2[i]==0)<br /> i++;<br /> v[i]=v[i]-2;<br /> }<br /> else<br /> if (sm1==1) {<br /> i=0;<br /> while (m1[i]==0)<br /> i++;<br /> v[i]--;<br /> }<br /> }<br /> else {<br /> i=0;<br /> while (v[i]==0)<br /> i++;<br /> if (n1%2==0)<br /> v[i]--;<br /> else<br /> v[i]=0;<br /> }<br /> }<br /> printf(&quot;%d&quot;,v[0]);<br /> for (i=1;i&lt;n;i++)<br /> printf(&quot; %d&quot;,v[i]);<br /> printf(&quot;\n&quot;);<br /> return 0;<br /> }&lt;pre&gt;</div>

Cristian