吴泽乐

实现酷狗7的自动登入,由于是主要代码，所有先手动开启酷狗7，此程序经过测试正确。

Description 吴泽乐: Consider a small microprocessor that has the following properties: ?Each word is four bits. ?Addresses are two words. The high word always comes first. That is, the high word of a two-word address will always occupy the lower word of memory. ?Memory is 256 words. ?There are two accumulators, A and B, each storing one word. ?There are nine instruction codes. Each instruction requires at least one word to store the code that specifies the instruction. Four instructions have arguments and require an additional two words. Each 4 bit number can have the values from 0 to 15, inclusive, in base 10. We will write these using hexadecimal in the usual way, i.e. A means 10, B means 11, etc. These are the nine instructions: Code Words Description 0 3 LD: Load accumulator A with the contents of memory at the specified argument. 1 3 ST: Write the contents of accumulator A to the memory location specified by the argumen 2 1 SWP: Swap the contents of accumulators A and B. 3 1 ADD: Add the contents of accumulators A and B. The low word of the sum is stored in A, and the high word in B 4 1 INC: Increment accumulator A. Overflow is allowed; that is, incrementing F yields 0. 5 1 DEC: Decrement accumulator A. Underflow is allowed; that is, decrementing 0 yields F. 6 3 BZ: If accumulator A is zero, the next command to be executed is at the location specified by the argument. If A is not zero, the argument is ignored and nothing happens. 7 3 BR: The next command to be executed is at the location specified by the argument. 8 1 STP: Stop execution of the program. The microprocessor always begins by executing the command at location 00. It executes the commands in sequence until it reaches the Stop command. The examples below show partial programs and describe their affect. Program Description 01A8 Load accumulator A with the contents of memory location 1A (26 in decimal) and stop. 01A512F8 Load accumulator A with the contents of memory location 1A (26 in decimal), decrement it, store the result to memory location 2F, then stop. Input The input will consist of several lines of exactly 256 hex characters. Each line is the contents of memory, beginning with address 00 and ending with address FF. The end of the input is indicated by a memory state that has a stop instruction (an "8") at address 00. The input programs will never "fall of the end of memory" that is, you will never execute an instruction that is located between addresses F0 and FF, inclusive. Output For each memory state, you should simulate execution beginning with address 00. When the stop instruction is reached, you will dump the contents of memory to the output as a single string of 256 hex characters followed by a newline character. Sample Input 0102011311321128FF0000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000 Sample Output 0102011311321128FF1E00000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000

Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 5522 Accepted: 2789 Description In millions of newspapers across the United States there is a word game called Jumble. The object of this game is to solve a riddle, but in order to find the letters that appear in the answer it is necessary to unscramble four words. Your task is to write a program that can unscramble words. Input The input contains four parts: 1) a dictionary, which consists of at least one and at most 100 words, one per line; 2) a line containing XXXXXX, which signals the end of the dictionary; 3) one or more scrambled 'words' that you must unscramble, each on a line by itself; and 4) another line containing XXXXXX, which signals the end of the file. All words, including both dictionary words and scrambled words, consist only of lowercase English letters and will be at least one and at most six characters long. (Note that the sentinel XXXXXX contains uppercase X's.) The dictionary is not necessarily in sorted order, but each word in the dictionary is unique. Output For each scrambled word in the input, output an alphabetical list of all dictionary words that can be formed by rearranging the letters in the scrambled word. Each word in this list must appear on a line by itself. If the list is empty (because no dictionary words can be formed), output the line "NOT A VALID WORD" instead. In either case, output a line containing six asterisks to signal the end of the list. Sample Input tarp given score refund only trap work earn course pepper part XXXXXX resco nfudre aptr sett oresuc XXXXXX Sample Output score ****** refund ****** part tarp trap ****** NOT A VALID WORD ****** course ****** Source Mid-Central USA 1998

吴泽乐 Traffic Advisory System 交通咨询系统 最短路径 数据结构 迪杰斯特拉 Dijkstra