用匯編語言做的一個打字游戲。運行環(huán)境是MASN5.0。
1,用戶打開軟件時先出現(xiàn)歡迎界面,當(dāng)用戶輸入字符’1’時,再進入打字界面 當(dāng)用戶按的是”ESC”鍵時,退出打字游戲 當(dāng)用戶輸入不是數(shù)字”1”或者不是按的”ESC”鍵時,屏幕不動作,直到用戶輸入數(shù)字”1”或者按的”ESC”鍵時
2,打字字符從第二行開始顯示(雙數(shù)行為顯示打字內(nèi)容,單數(shù)行由用戶輸入)
打字內(nèi)容: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,用戶輸入的和上一行相對應(yīng)相等時,表示輸入正確,否則輸入錯誤,則顯示’#’ 當(dāng)用戶按下”ESC”鍵,退出打字程序
4,顯示用戶打字的正確性,假如錯誤數(shù)小于10字符,顯示” Very Good!” 否則顯示” Very Bad!”
5,當(dāng)用戶輸入一次時,假如用戶還想重新打字游戲,請按數(shù)字鍵”3”,否則按”ESC”鍵退出打字程序
This project does not contain a full, runnable application program. Instead, the only package ope.account contains two classes which represent basic bank customer and account information.
This project does not contain a full, runnable application program. Instead, the only package ope.football contains two classes to represent match data for football (and possibly other team sports).
Implemented BFS, DFS and A*
To compile this project, use the following command:
g++ -o search main.cpp
Then you can run it:
./search
The input is loaded from a input file in.txt
Here is the format of the input file:
The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm.
The second line of input file shoud be an integer m indicate the number of connections for the map.
Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist.
The following input are for A*
The following line contains two chars indicate the source and destination city for A* algorithm.
Then there is an integer h indicate the number of heuristic.
The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
JDiff is a Javadoc doclet which generates an HTML report of all the packages, classes, constructors, methods, and fields which have been removed, added or changed in any way, including their documentation, when two APIs are compared. This is very useful for describing exactly what has changed between two releases of a product. Only the API (Application Programming Interface) of each version is compared. It does not compare what the source code does when executed.
* This a software code module for a time-of-day clock object.
* The clock may be fixed 12-hour, fixed 24-hour, or dynamically
* configurable between these two types. Clock data can be accessed
* as a binary number representing the number of minutes since midnight
* or a BCD number formatted according to the time-of-day description
* in the TIME module 0404x. The functions work with time-of-day values
* which conform to normally accepted clock values of 1:00 to
* 12:59 BCD / 0 to 719 binary for a 12-hour clock or clock values
* 00:00 to 23:59 BCD / 0 to 1439 binary for a 24-hour clock. On power-up
* the clock is 12:00 BCD / 0 binary for a 12-hour or dynamically
* configurable clock, or 00:00 BCD / 0 binary for a 24-hour clock.
* DEFINITION
* This is the header file for a library module used to calculate the median
* of a list of values. It finds the value that would be in the center if
* the list were sorted. If the list contains an even number of values, the
* lower of the two center values is reported. The values themselves are not
* sorted or modified in any way. This algorithm can be used as a filtering
* tool for rejecting noisy data.
CHMMBOX, version 1.2, Iead Rezek, Oxford University, Feb 2001
Matlab toolbox for max. aposteriori estimation of two chain
Coupled Hidden Markov Models.