锘??xml version="1.0" encoding="utf-8" standalone="yes"?>国产激情久久久久影院,99久久99久久精品国产片果冻,久久精品无码一区二区apphttp://www.shnenglu.com/luyulaile/archive/2009/07/25/91106.htmlluisluisSat, 25 Jul 2009 02:17:00 GMThttp://www.shnenglu.com/luyulaile/archive/2009/07/25/91106.htmlhttp://www.shnenglu.com/luyulaile/comments/91106.htmlhttp://www.shnenglu.com/luyulaile/archive/2009/07/25/91106.html#Feedback0http://www.shnenglu.com/luyulaile/comments/commentRss/91106.htmlhttp://www.shnenglu.com/luyulaile/services/trackbacks/91106.html鏋氫婦娉曟槸鏈綆鍗曠殑鏂規(guī)硶錛?br>铏界劧涓嶆槸鏈蹇殑銆?br>浠?鍒皀涓涓竴涓亣璁懼畠涓?鎴栬?1錛屽叾瀹冧負0錛屽鏋滄弧瓚蟲墍鏈変笉絳夊紡璁℃暟鍣ㄥ姞1錛堝鏋滅i涓暟涓?鏃舵弧瓚籌紝鍒欎笉蹇呮祴璇?1鐨勬儏鍐點傦級錛屽鏋滄渶鍚庤鏁板櫒鍊間笉涓?錛屼笉鑳芥帹鍑猴紝杈撳嚭0.
緇欏嚭涓嬮潰鐨勬祴璇曟暟鎹?br>wa浜?嬈★紝灞呯劧鏄洜涓烘暟緇勮寖鍥存病鏈夋敞鎰忓埌錛佸洤鍥у洤銆?br>涓嬮潰鏄竴浜涙祴璇曟暟鎹?br>3 2
1 1 2
<
1 2 3
<
3 2
1 1 2
>
1 1 3
>
5 1
2 1 2 3 4
=
4 3
2 1 2 3 4
<
2 1 3 2 4
<
1 2 4
=
5 3
2 1 3 2 4
>
2 3 5 2 4
>
1 1 4
>
5 3
2 1 3 2 4
>
2 3 5 2 4
>
1 1 4
=
3 2
1 1 2
<
1 1 3
<
2 1
1 1 2
>
4 3
2 1 2 3 4
<
2 1 3 2 4
<
1 2 4
=
5 2
1 1 4
=
1 2 5
=
3 2
1 1 2
<
1 2 3
>
5 2
1 1 4
=
1 2 5
=
2 1
1 1 2
>
5 3
2 1 3 2 4
>
2 3 5 2 4
>
1 1 4
>
5 3
1 2 3
<
1 1 2
>
1 3 4
=
3 2
1 1 2
<
1 1 3
<
5 1
2 1 2 3 4
=
3 2
1 1 2
<
1 2 3
>
5 3
2 1 3 2 4
>
2 3 5 2 4
>
1 1 4
>
5 3
1 2 3
<
1 1 2
>
1 3 4
=
2 1
1 1 2
>
0  0
---
絳旀
Scenario #1:
0

Scenario #2:
1

Scenario #3:
5

Scenario #4:
1

Scenario #5:
4

Scenario #6:
0

Scenario #7:
1

Scenario #8:
0

Scenario #9:
1

Scenario #10:
3

Scenario #11:
2

Scenario #12:
3

Scenario #13:
0

Scenario #14:
4

Scenario #15:
2

Scenario #16:
1

Scenario #17:
5

Scenario #18:
2

Scenario #19:
4

Scenario #20:
2

Scenario #21:
0

 



luis 2009-07-25 10:17 鍙戣〃璇勮
]]>
joj 1099 simple computer 鎺ㄨ崘棰?/title><link>http://www.shnenglu.com/luyulaile/archive/2009/07/24/91007.html</link><dc:creator>luis</dc:creator><author>luis</author><pubDate>Fri, 24 Jul 2009 02:59:00 GMT</pubDate><guid>http://www.shnenglu.com/luyulaile/archive/2009/07/24/91007.html</guid><wfw:comment>http://www.shnenglu.com/luyulaile/comments/91007.html</wfw:comment><comments>http://www.shnenglu.com/luyulaile/archive/2009/07/24/91007.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.shnenglu.com/luyulaile/comments/commentRss/91007.html</wfw:commentRss><trackback:ping>http://www.shnenglu.com/luyulaile/services/trackbacks/91007.html</trackback:ping><description><![CDATA[<table width="100%"> <tbody> <tr> <td vAlign=top>You are to write an interpreter for a simple computer. This computer uses a processor with a small number of machine instructions. Furthermore, it is equipped with 32 byte of memory, one 8-bit accumulator (accu) and a 5-bit program counter (pc). The memory contains data as well as code, which is the usual von Neumann architecture. <p>The program counter holds the address of the instruction to be executed next. Each instruction has a length of 1 byte - the highest 3 bits define the type of instruction and the lowest 5 bits define an optional operand which is always a memory address (<tt>xxxxx</tt>). For instructions that don't need an operand the lowest 5 bits have no meaning (<tt>-----</tt>). Here is a list of the machine instructions and their semantics: <p><tt>000xxxxx   STA x   </tt>store the value of the accu into memory byte x<br><tt>001xxxxx   LDA x   </tt>load the value of memory byte x into the accu<br><tt>010xxxxx   BEQ x   </tt>if the value of the accu is 0 load the value x into the pc<br><tt>011-----   NOP     </tt>no operation<br><tt>100-----   DEC     </tt>subtract 1 from the accu<br><tt>101-----   INC     </tt>add 1 to the accu<br><tt>110xxxxx   JMP x   </tt>load the value x into the pc<br><tt>111-----   HLT     </tt>terminate program<br> <p>In the beginning, program counter and accumulator are set to 0. After fetching an instruction but before its execution, the program counter is incremented. You can assume that programs will terminate. <h3>Input Specification</h3> The input file contains several test cases. Each test case specifies the contents of the memory prior to execution of the program. Byte 0 through 31 are given on separate lines in binary representation. A byte is denoted by its highest-to-lowest bits. Input is terminated by EOF. <h3>Output Specification</h3> For each test case, output on a line the value of the accumulator on termination in binary representation, again highest bits first. </td> <td vAlign=top width="4%"></td> <td vAlign=top> <h3>Sample Input</h3> <pre>00111110 10100000 01010000 11100000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00111111 10000000 00000010 11000010 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 00000000 11111111 10001001 </pre> <h3>Sample Output</h3> <pre>10000111</pre> </td> </tr> </tbody> </table> 寰堝ソ鐨勯錛屽緢瀹規(guī)槗閿欍?br>闇瑕佽綆楁満緇勬垚鍘熺悊鐨勪竴鐐圭煡璇嗭紝娌″榪囦篃鑳藉仛銆?br>鎸囦護璇戠爜錛岋紙灝嗕簩榪涘埗杞寲涓哄崄榪涘埗騫朵粠涓幏寰楁搷浣滅被鍨嬪拰绔嬪嵆鏁皒錛夊彲浠ョ敤浣嶈繍綆楋紝<br>鎸囦護鎵ц pc,accu,绔嬪嵆鏁皒閮藉彲浠ョ敤int琛ㄧず涓旀槸鍏ㄥ眬鍙橀噺錛宮emory鐢ㄦ暟緇勮〃紺恒?br>鏈夊緢澶氭敞鎰忕殑鍦版柟錛?br>pc涓嶈兘瓚呰繃32;涓嶈兘灝忎簬0.<br>accu涓嶈兘瓚呰繃256.涓嶈兘灝忎簬0.<br>鑷繁閮芥病鏈夋敞鎰忓埌銆?br>pc,accu, <img src ="http://www.shnenglu.com/luyulaile/aggbug/91007.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/luyulaile/" target="_blank">luis</a> 2009-07-24 10:59 <a href="http://www.shnenglu.com/luyulaile/archive/2009/07/24/91007.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item><item><title>joj 2199 the lost number 濂介 鍊煎緱鍋氬仛http://www.shnenglu.com/luyulaile/archive/2009/07/19/90519.htmlluisluisSun, 19 Jul 2009 06:18:00 GMThttp://www.shnenglu.com/luyulaile/archive/2009/07/19/90519.htmlhttp://www.shnenglu.com/luyulaile/comments/90519.htmlhttp://www.shnenglu.com/luyulaile/archive/2009/07/19/90519.html#Feedback1http://www.shnenglu.com/luyulaile/comments/commentRss/90519.htmlhttp://www.shnenglu.com/luyulaile/services/trackbacks/90519.html Status In/Out TIME Limit MEMORY Limit Submit Times Solved Users JUDGE TYPE stdin/stdout 3s 40960K 1071 235 Standard
In a interger sequence S there are N(N < 1000000) intergers, there is a initial number I(-2^31 < I <2^31), which is the minimun interger in S, and no two integers are the same. Now can you find the first lost interger L make the sequence is not consecutive. For example, S = { 1, -2, 2, 9, -1 }, then I = -2, and L = 0.

Input

For each case N is in the first line, and next N lines is the sequence S.

Output

Output L for each case in a single line.

Sample Input

5
1
-2
2
9
-1

Sample Output

0
涓嶇敤璧板叆鎺掑簭鐨勮鍖猴紝
鍙互鍦ㄧ嚎鎬х殑鏃墮棿鍐呭畬鎴愩?/pre>
鍏堜竴瓚熷驚鐜紝淇濆瓨杈撳叆鐨勫糿[MAX],鍚屾椂鍙壘鍑烘渶灝忕殑鍊鹼紝
鍐嶆潵涓瓚熷驚鐜互姝や負鍩哄噯瀵規(guī)瘡涓暟榪涜鏍囪錛屽姣忎釜鍑虹幇鐨刵um,mark[num-min]=1;
鐒跺悗
for(int i=0;;i++)
{if(mark[i]==0)
cout<<i+min;
break;
}
----


luis 2009-07-19 14:18 鍙戣〃璇勮
]]>
99久久做夜夜爱天天做精品| 成人资源影音先锋久久资源网| 久久久久久国产精品免费无码 | 久久天天躁狠狠躁夜夜av浪潮 | 久久99国产精品久久久| 久久精品国产亚洲AV嫖农村妇女 | 久久久久高潮毛片免费全部播放| 亚洲va久久久噜噜噜久久男同 | 99久久免费国产精品| 久久99热精品| 久久精品中文字幕第23页| 国产精品99久久久久久宅男| 久久久WWW免费人成精品| 欧美日韩精品久久久久| 国产精品中文久久久久久久| 伊人久久大香线蕉亚洲五月天 | 熟妇人妻久久中文字幕| 99久久中文字幕| 久久婷婷五月综合97色直播| 亚洲精品乱码久久久久久不卡| 亚洲精品美女久久久久99小说| 久久久久久久久久久久久久| 久久精品中文騷妇女内射| 丰满少妇人妻久久久久久| 久久久久久国产精品无码下载 | 国产精自产拍久久久久久蜜| 久久亚洲av无码精品浪潮| 亚洲av日韩精品久久久久久a| 亚洲狠狠综合久久| 亚洲精品无码久久千人斩| 久久亚洲国产中v天仙www| 色妞色综合久久夜夜| 精品国产福利久久久| 色播久久人人爽人人爽人人片AV| 久久精品成人免费网站| 一级a性色生活片久久无| 国产亚洲美女精品久久久久狼| 午夜精品久久久久9999高清| 国产精品对白刺激久久久| 亚洲精品97久久中文字幕无码| 久久99国产精品久久久|