https://www.algopedia.ro/wiki/index.php?action=history&feed=atom&title=FTL 2026-08-19T07:36:40Z Revision history for this page on the wiki MediaWiki 1.44.2 https://www.algopedia.ro/wiki/index.php?title=FTL&diff=6731&oldid=prev 2013-06-19T11:30:36Z

<p></p> <p><b>New page</b></p><div>&lt;pre&gt;/*<br /> Nume program : FTL.c<br /> Nume concurent : Alexandru Pacurar<br /> */<br /> #include &lt;stdio.h&gt;<br /> #include &lt;stdlib.h&gt;<br /> int dec[30],v1[5],v2[5];<br /> <br /> int main()<br /> {<br /> int a,sum,s,p,i,j,n,max;<br /> char c;<br /> i=0;<br /> max=0;<br /> scanf(&quot;%d&quot;,&amp;dec[i]);<br /> if(dec[i]&gt;max)<br /> max=dec[i];<br /> n=1;<br /> c=getchar();<br /> i++;<br /> while(c==&#039; &#039;)<br /> {<br /> scanf(&quot;%d&quot;,&amp;dec[i]);<br /> if(dec[i]&gt;max)<br /> max=dec[i];<br /> n++;<br /> c=getchar();<br /> i++;<br /> }<br /> if(n&lt;=2)<br /> {<br /> if(n==2)<br /> {<br /> i=0;<br /> while(dec[i]==0)<br /> i++;<br /> a=dec[i];<br /> i++;<br /> while(dec[i]==0)<br /> i++;<br /> if(a==dec[i])<br /> dec[i]--;<br /> else<br /> {<br /> if(a&gt;dec[i])<br /> {<br /> a=dec[i];<br /> i=0;<br /> while(dec[i]==0)<br /> i++;<br /> dec[i]=a;<br /> }<br /> else<br /> dec[i]=a;<br /> }<br /> }<br /> else<br /> {<br /> i=0;<br /> while(dec[i]==0)<br /> i++;<br /> dec[i]=0;<br /> }<br /> }<br /> else<br /> {<br /> i=0;<br /> a=dec[i];<br /> p=1;<br /> j=4;<br /> while(a&gt;0)<br /> {<br /> v1[j]=a%2;<br /> p=p*10;<br /> a=a/2;<br /> j--;<br /> }<br /> i++;<br /> a=dec[i];<br /> p=1;<br /> j=4;<br /> while(a&gt;0)<br /> {<br /> v2[j]=a%2;<br /> p=p*10;<br /> a=a/2;<br /> j--;<br /> }<br /> j=0;<br /> if(v1[j]!=v2[j])<br /> v1[j]=1;<br /> j++;<br /> if(v1[j]!=v2[j])<br /> v1[j]=1;<br /> j++;<br /> if(v1[j]!=v2[j])<br /> v1[j]=1;<br /> j++;<br /> if(v1[j]!=v2[j])<br /> v1[j]=1;<br /> j++;<br /> if(v1[j]!=v2[j])<br /> v1[j]=1;<br /> i=2;<br /> for(j=0;j&lt;5;j++)<br /> v2[j]=0;<br /> while(i&lt;n)<br /> {<br /> a=dec[i];<br /> p=1;<br /> j=4;<br /> while(a&gt;0)<br /> {<br /> v2[j]=a%2;<br /> p=p*10;<br /> a=a/2;<br /> j--;<br /> }<br /> j=0;<br /> if(v1[j]!=v2[j])<br /> v1[j]=1;<br /> else<br /> v1[j]=0;<br /> j++;<br /> if(v1[j]!=v2[j])<br /> v1[j]=1;<br /> else<br /> v1[j]=0;<br /> j++;<br /> if(v1[j]!=v2[j])<br /> v1[j]=1;<br /> else<br /> v1[j]=0;<br /> j++;<br /> if(v1[j]!=v2[j])<br /> v1[j]=1;<br /> else<br /> v1[j]=0;<br /> j++;<br /> if(v1[j]!=v2[j])<br /> v1[j]=1;<br /> else<br /> v1[j]=0;<br /> for(j=0;j&lt;5;j++)<br /> v2[j]=0;<br /> i++;<br /> }<br /> p=10000;<br /> s=0;<br /> for(j=0;j&lt;5;j++)<br /> {<br /> s=v1[j]*p+s;<br /> p=p/10;<br /> }<br /> p=1;<br /> sum=0;<br /> while(s&gt;0)<br /> {<br /> sum=sum+s%10*p;<br /> s=s/10;<br /> p=p*2;<br /> }<br /> i=0;<br /> if(sum==0 || sum&gt;max)<br /> sum=1;<br /> while(dec[i]&lt;sum)<br /> i++;<br /> dec[i]=dec[i]-sum;<br /> }<br /> printf(&quot;%d&quot;,dec[0]);<br /> i=1;<br /> while(i&lt;n)<br /> {<br /> printf(&quot; %d&quot;,dec[i]);<br /> i++;<br /> }<br /> printf(&quot;\n&quot;);<br /> return 0;<br /> }&lt;/pre&gt;</div>

Cristian