锘??xml version="1.0" encoding="utf-8" standalone="yes"?>热99re久久国超精品首页,久久精品九九亚洲精品,午夜精品久久久久久中宇http://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錛屽叾瀹冧負(fù)0錛屽鏋滄弧瓚蟲墍鏈変笉絳夊紡璁℃暟鍣ㄥ姞1錛堝鏋滅i涓暟涓?鏃舵弧瓚籌紝鍒欎笉蹇呮祴璇?1鐨勬儏鍐點(diǎn)傦級(jí)錛屽鏋滄渶鍚庤鏁板櫒鍊間笉涓?錛屼笉鑳芥帹鍑猴紝杈撳嚭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>鎸囦護(hù)璇戠爜錛岋紙灝嗕簩榪涘埗杞寲涓哄崄榪涘埗騫朵粠涓幏寰楁搷浣滅被鍨嬪拰绔嬪嵆鏁皒錛夊彲浠ョ敤浣嶈繍綆楋紝<br>鎸囦護(hù)鎵ц 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],鍚屾椂鍙壘鍑烘渶灝忕殑鍊鹼紝
鍐嶆潵涓瓚熷驚鐜互姝や負(fù)鍩哄噯瀵規(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国产精品澳门| 99久久精品久久久久久清纯| 国产精品99久久久精品无码| 国产精品女同久久久久电影院| 老司机午夜网站国内精品久久久久久久久 | 久久强奷乱码老熟女网站| 日产精品久久久一区二区| 久久久精品日本一区二区三区| 国产激情久久久久久熟女老人 | 亚洲成人精品久久| 色婷婷久久综合中文久久蜜桃av| 狠狠色伊人久久精品综合网| 久久精品国产亚洲AV无码娇色 | 久久精品国产精品亚洲毛片| 人妻少妇精品久久| 久久99精品国产麻豆蜜芽| 久久精品国产亚洲77777| 日韩十八禁一区二区久久| 青青草原1769久久免费播放| 无码精品久久久天天影视 | 亚洲精品乱码久久久久久自慰| 久久亚洲2019中文字幕| 蜜桃麻豆www久久| 欧美亚洲另类久久综合| 久久久久久a亚洲欧洲aⅴ| AV无码久久久久不卡蜜桃| 99国产欧美久久久精品蜜芽 | 97久久精品人人澡人人爽| 精品国产91久久久久久久 | 区亚洲欧美一级久久精品亚洲精品成人网久久久久| 无码超乳爆乳中文字幕久久| 亚洲国产婷婷香蕉久久久久久| 久久亚洲精品无码观看不卡| 香蕉久久久久久狠狠色| 四虎国产精品免费久久| 波多野结衣久久|