I was anxious to find a source program, and I found the source code of a program, how to become a pr

Function: Display a character 3

Step 1: Enter the command prompt, type debug, and press enter;

Step 2: Enter the assembler with assembly command a at the debug prompt

a 100mov dl,33

mov ah,2

int 21

int 20

Step 3: Run the input program with the command g: g=100program terminated normally

It depends on what language you have, and you can use the compiler of what language to compile into the target program.

I made one for you, reference reference!

It is better to control it when a single data is entered, and legally add it to the list control, I think it is safer than using the text control to disassemble and verify at the end.

By the way, do you want to make a calculator?

Your question is divided into these big blocks.

1) Take the person's name (if the amount of data is small, you can write a ** by yourself, group it by space, and take a substring with a letter (in fact, it is to get English words)).

3) Convert to a graph (the name of the person is the vertex, the distance is the edge) (that is, the graph in the computer data structure) 4) Calculate the shortest path between two points in the graph. (This is simple, find an algorithm to find the shortest distance between two points in the graph.) ）

Let's give you an idea.

Looking for a person's name, should there be a personal name dictionary? Suppose the person's name is coded as an array name

So, the first step is to figure out where each person is from the start of the text. Since each position can only have one person's name, each person's position from the beginning of the text should be unique, so use this position as the key and the person's name as the value to construct a map; And use key to construct a distance list list, the second part, sort this list, from small to large, or from large to small, we assume that it is from small to large.

1) Calculate the so-called closest relationship, that is, the distance difference (subtract the two adjacent elements in the list, because they are sorted from small to large, so use the element in the i+1 position - the element in the i position) is the smallest, traverse the list, subtract the two in pairs, calculate the smallest two elements, and then the smallest two distance values get the name from the map. Then, in the same way, calculate the distance difference with the largest.

2. Enter a person's name. You can iterate through the map to find the person's key, and then calculate the sum of the distance values in the key and list.

If you look at the Lucene source code and find inspiration, the key is efficiency.

It's too much work, and no one wants to write it for you.