学步园

TAG 模拟

没说N多大。。。水题就直接贴代码了。。

/* source code of submission 427279, Zhongshan University Online Judge System */<br /> #include <stdio.h></p> <p>int n,ans,last;<br /> bool equal;<br /> int candy[3000];<br /> int main(int argc, char *argv[])<br /> {<br /> while ( scanf("%d", &n) && n!=0 )<br /> {<br /> for (int i=0; i<n; ++i)<br /> {<br /> scanf("%d", &candy[i]);<br /> }<br /> ans=0;<br /> equal=true;<br /> for (int i=1; i<n; ++i)<br /> {<br /> if ( candy[i]!=candy[0] )<br /> {<br /> equal=false;<br /> break;<br /> }<br /> }<br /> if ( equal )<br /> {<br /> printf("%d %d/n", 0, candy[0]);<br /> }<br /> else<br /> {</p> <p> do<br /> {<br /> ++ans;<br /> for (int i=0; i<n; ++i)<br /> {<br /> candy[i]/=2;<br /> }<br /> last=candy[n-1];<br /> equal=true;<br /> for (int i=n-2; i>=0; --i)<br /> {<br /> candy[i+1]+=candy[i];<br /> if ( candy[i+1]%2==1 )<br /> {<br /> ++candy[i+1];<br /> }<br /> if ( i<n-2 && candy[i+1]!=candy[i+2] )<br /> {<br /> equal=false;<br /> }<br /> }<br /> candy[0]+=last;<br /> if ( candy[0]%2==1 )<br /> {<br /> ++candy[0];<br /> }<br /> equal= equal && candy[0]==candy[1];<br /> if ( equal )<br /> {<br /> break;<br /> }<br /> }<br /> while ( true );<br /> printf("%d %d/n",ans, candy[0]);<br /> }<br /> }<br /> return 0;<br /> }<br />