https://www.algopedia.ro/wiki/index.php?action=history&feed=atom&title=Auto-vortex 2026-08-19T04:35:04Z Revision history for this page on the wiki MediaWiki 1.44.2 https://www.algopedia.ro/wiki/index.php?title=Auto-vortex&diff=6732&oldid=prev 2013-06-19T11:31:16Z

<p>Created page with &quot;&lt;pre&gt;<span class="autocomment">Nume program : auto-vortex.c Nume concurent : Ulmeanu Vlad , Matei Lascu: </span> #include&lt;stdio.h&gt; #include&lt;stdlib.h&gt; #include&lt;time.h&gt; /* Strategia jocului consta in...&quot;</p> <p><b>New page</b></p><div>&lt;pre&gt;/*<br /> Nume program : auto-vortex.c<br /> Nume concurent : Ulmeanu Vlad , Matei Lascu<br /> */<br /> #include&lt;stdio.h&gt;<br /> #include&lt;stdlib.h&gt;<br /> #include&lt;time.h&gt;<br /> <br /> /*<br /> <br /> Strategia jocului consta in determinarea paritatii, astfel:<br /> - o stare numita &#039;para&#039; este cea in care toate puterile lui 2<br /> din reprezentarea jocului apar de un nr. par de ori in toate stivele;<br /> acesta este echivalent cu S1 XOR S2 XOR .. XOR Sn = 0;<br /> - orice stare care nu este &#039;para&#039; este numita &#039;impara&#039;.<br /> <br /> La fiecare pas (mutare) se testeaza paritatea.<br /> Strategia se bazeaza pe urmatoarele doua teoreme:<br /> T1- dintr-o stare impara se poate ajunge intr-o stare para printr-o<br /> mutare convenabila, conform strategiei ;<br /> T2 - dintr-o stare para se poate ajunge intr-o stare impara prin orice fel<br /> de mutare (random);<br /> <br /> # Nu stiu daca se incadreaza in timp/mutare si memorie.<br /> */<br /> <br /> int v[30];<br /> <br /> int main()<br /> {<br /> srand(time(NULL));<br /> <br /> int i=0,j,exor,m,rz,x,l=0,p,a;<br /> char c;<br /> <br /> do<br /> {<br /> fscanf(stdin,&quot;%d&quot;,&amp;v[i]);<br /> c=fgetc(stdin);<br /> i++;<br /> }while(c==&#039; &#039;);<br /> <br /> m=i;<br /> <br /> exor=v[0]^v[1];<br /> <br /> for(j=2; j&lt;i; j++)<br /> exor=exor^v[j];<br /> <br /> if(exor!=0)<br /> {<br /> x=0;<br /> rz=v[x]^exor;<br /> while(rz&gt;=v[x])<br /> {<br /> x++;<br /> rz=v[x]^exor;<br /> }<br /> v[x]=rz;<br /> }<br /> else<br /> {<br /> x=0;<br /> while(v[x]==0)<br /> x++;<br /> p=v[x];<br /> v[x]=rand()%p;<br /> }<br /> <br /> for(j=0; j&lt;m; j++)<br /> {<br /> fprintf(stdout,&quot;%d&quot;,v[j]);<br /> if(j!=m-1)<br /> fprintf(stdout,&quot; &quot;);<br /> }<br /> <br /> fprintf(stdout,&quot;\n&quot;);<br /> <br /> return 0;<br /> }&lt;/pre&gt;</div>

Cristian