用匯編語言做的一個打字游戲。運行環境是MASN5.0。
1,用戶打開軟件時先出現歡迎界面,當用戶輸入字符’1’時,再進入打字界面 當用戶按的是”ESC”鍵時,退出打字游戲 當用戶輸入不是數字”1”或者不是按的”ESC”鍵時,屏幕不動作,直到用戶輸入數字”1”或者按的”ESC”鍵時
2,打字字符從第二行開始顯示(雙數行為顯示打字內容,單數行由用戶輸入)
打字內容:1), We will see his boat and tHEn.We ll say goodbye to him.
2), HE ll be away for two months.We are very proud of him.
3,用戶輸入的和上一行相對應相等時,表示輸入正確,否則輸入錯誤,則顯示’#’ 當用戶按下”ESC”鍵,退出打字程序
4,顯示用戶打字的正確性,假如錯誤數小于10字符,顯示” Very Good!” 否則顯示” Very Bad!”
5,當用戶輸入一次時,假如用戶還想重新打字游戲,請按數字鍵”3”,否則按”ESC”鍵退出打字程序
This tHE project README file. HEre, you should describe your project. Tell tHE reader (someone who does not know anything about this project) all HE/sHE needs to know.
Text processing often involves matching text against a pattern. Although Java s character and assorted string classes offerlow- levelpattern- matching support, that support commonly leads to complex code. To HElp you write simplerpattern- matching code, Java provides regular expressions. After introducing you to terminology and tHEjava.util. regex package, Jeff Friesen explores many regular expression constructs supported by that package s Pattern class. THEn HE examines Pattern s methods and tHE additionaljava.util. regex classes. In conclusion, HE presents a practical application of regular expressions.
THE source code for this package is located in src/gov/nist/sip/proxy. THE proxy
is a pure JAIN-SIP application: it does not need proprietary nist-sip
classes in addition of those defined in JAIN-SIP 1.1, you can substitute
tHE NIST-SIP stack by anotHEr JAIN-SIP-1.1 compliant stack and it should
interoperate.
HE proxy can act as presence server and be able to process NOTIFY and
SUBSCRIBE requests. If this parameter is disabled, tHE proxy will simply
forward those kind of requests following tHE appropriate routing decision.
C++, although a marvelous language, isn t perfect. MattHEw Wilson has been working with it for over a decade, and during that time HE has found inHErent limitations that require skillful workarounds. In this book, HE doesn t just tell you what s wrong with C++, but offers practical techniques and tools for writing code that s more robust, flexible, efficient, and maintainable. HE shows you how to tame C++ s complexity, cut through its vast array of paradigms, take back control over your code--and get far better results
THE algorm of viterbi. You talk to your friend three days in a row and discover that on tHE first day HE went for a walk, on tHE second day HE went shopping, and on tHE third day HE cleaned his apartment. You have two questions: What is tHE overall probability of this sequence of observations? And what is tHE most likely sequence of rainy/sunny days that would explain tHEse observations? THE first question is answered by tHE forward algorithm tHE second question is answered by tHE Viterbi algorithm. THEse two algorithms are structurally so similar (in fact, tHEy are both instances of tHE same abstract algorithm) that tHEy can be implemented in a single function:
兩種解決方案 Richard just finisHEd building his new house. Now tHE only thing tHE house misses is a cute little wooden fence. HE had no idea how to make a wooden fence, so HE decided to order one. Somehow HE got his hands on tHE ACME Fence Catalogue 2002, tHE ultimate resource on cute little wooden fences. After reading its preface HE already knew, what makes a little wooden fence cute.
A wooden fence consists of N wooden planks, placed vertically in a row next to each otHEr. A fence looks cute if and only if tHE following conditions are met:
?THE planks have different lengths, namely 1, 2, . . . , N plank length units.
?Each plank with two neighbors is eitHEr larger than each of its neighbors or smaller than each of tHEm. (Note that this makes tHE top of tHE fence alternately rise and fall.)