（1）编写出完整的汇编语言程序；
（3）打印出相应的列表文件（后缀lst的文件）清单，并对调试运行结果进行截图，以证明程序调试成功。

Problem Description Professor Binns has finally got tired of scoring essays himself and implemented an automatic essay scoring system to help him screen the numerous essays. Strongly against such an idea, you decided to generate a meaningless essay which can get high mark in his system to prove that his system does not work at all. You've obtained the rules used by Binns's system to score the essay, they're as follows: a) The word in the essay must be from a particular set of words. If not, the essay will receive a score zero and is automatically rejected. b) Every word in the specified set has a positive integer associated with it, indicating the score the submitter will get for using that word once. c) A word can be used in several different ways; for example, in English, the word “word” can be used as both a noun and a verb. Every occurrence of specific patterns (like verb – adjective – noun) will earn the submitter a particular score. In particular, it is allowed for a word to be interpreted in different ways in different patterns. You're interested in generating an essay of a specified length with maximum possible score. Input There are multiple test cases in the input file. Each test case starts with three integers N, M and K, (1 <= N <= 100, 0 <= M <= 8, 0 <= K <= 6), the length of the essay to generate, the number of words in the dictionary and the number of patterns, respectively. The following M lines describe the words in the dictionary; each line consists of two integers, Wi, and Ti, (0 <= Wi <= 2000, 1 <= Ti <= 5), representing the score submitter gets every time he/she uses the word, and the number of ways the word can be used. The next part of the input describes the patterns. Each of the K lines describes one pattern, beginning with two integers, Wi, and Ci, (0 <= Wi <= 2000, 1 <= Ci <= 6), indicating the score one can get every time the pattern is used, and the number of consecutive parts in the pattern; followed by Ci integers describing the language parts in the pattern. It is guaranteed that the total number of ways to use a word does not exceed 5; furthermore, the total number of parts contained in all patterns (sum of all Cis) will not exceed 25. There is a blank line after each test case. Input ends with End-of-File. Output For every test case, you should output one integer on a separate line, the maximum score one can get, in the format as indicated in the sample output. Sample Input 2 3 2 4 3 0 1 2 5 2 2 3 1 2 0 4 1 2 1 3 10 2 4 2 2 3 2 4 3 0 1 2 5 2 2 3 1 2 0 4 1 2 1 3 2 2 4 2 Sample Output Case 1: 16 Case 2: 10

Problem Description There are N cities in our country, and M one-way roads connecting them. Now Little Tom wants to make several cyclic tours, which satisfy that, each cycle contain at least two cities, and each city belongs to one cycle exactly. Tom wants the total length of all the tours minimum, but he is too lazy to calculate. Can you help him? Input There are several test cases in the input. You should process to the end of file (EOF). The first line of each test case contains two integers N (N ≤ 100) and M, indicating the number of cities and the number of roads. The M lines followed, each of them contains three numbers A, B, and C, indicating that there is a road from city A to city B, whose length is C. (1 ≤ A,B ≤ N, A ≠ B, 1 ≤ C ≤ 1000). Output Output one number for each test case, indicating the minimum length of all the tours. If there are no such tours, output -1. Sample Input 6 9 1 2 5 2 3 5 3 1 10 3 4 12 4 1 8 4 6 11 5 4 7 5 6 9 6 5 4 6 5 1 2 1 2 3 1 3 4 1 4 5 1 5 6 1 Sample Output 42 -1

declare v_teacherID teacher.teacher_id%TYPE:='&要查询的教师编号'; ex_insert EXCEPTION; CURSOR c1(v_teacherID VARCHAR2) IS SELECT * FROM TEACHER WHERE Teacher_ID=v_teacherID; TEACHER_rec TEACHER%ROWTYPE; BEGIN IF v_teacherID="123" THEN RAISE ex_insert; ELSE OPEN c1(v_teacherID); LOOP FETCH c1 INTO TEACHER_rec; dbms_output.put_line('教师编号:'||TEACHER_rec.Teacher_ID||'姓名:'||TEACHER_rec.Tname||'性别:'||TEACHER_rec.Tsex||'出生日期:'||TEACHER_rec.Tbirth||'学历:'||TEACHER_rec.Educ||'职称:'||TEACHER_rec.Profess||'系部代码:'||TEACHER_rec.Dept_ID); END LOOP; END IF; CLOSE c1; EXCEPTION WHEN ex_insert THEN dbms_output.put_line('教师编号不能为空！'); end; 我这代码错误很多求大神帮我看下，该怎么修改。

Problem Description One day, a team of archaeologists found a figure and some ancient charactors at a relique. The figure was made up of n points distributing on a circle symmetrically. After investigating the charactors, they got to know that a treasure was hid beneath the figure. In order to open the door to the treasure, they must redraw all the lines between any two points in the figure with some colors. If the figure was right, the door would open. Now they want to know how many times they have to try at most to open the door, and they ask you for help. Input Each test case contains an integer n and a string S in a line. n is the number of points in the figure and S is a string made up of distinct capital letters, each indicating a color that can be used to redraw the figure. 3 <= n <= 50. Output Each case outputs the maximum times they may try in one line. Note that two figures are considered the same if one can be obtained by having rotation and mirroring on the other one. Sample Input 3 BW 3 RGB 4 RG Sample Output 4 10 19

“亚马逊丛林里的蝴蝶扇动几下翅膀就可能引起两周后美国德州的一次飓风……” 这句人人皆知的话最初用来描述非线性系统中微小参数的变化所引起的系统极大变化。 而在更长的时间尺度内，我们所生活的这个世界就是这样一个异常复杂的非线性系统…… 水泥、穹顶、透视——关于时间与技艺的蝴蝶效应 公元前3000年，古埃及人将尼罗河中挖出的泥浆与纳特龙盐湖中的矿物盐混合，再掺入煅烧石灰石制成的石灰，由此得来了人...

loonggg读完需要3分钟速读仅需 1 分钟大家好，我是你们的校长。我之前讲过，这年头，只要肯动脑，肯行动，程序员凭借自己的技术，赚钱的方式还是有很多种的。仅仅靠在公司出卖自己的劳动时...

MySQL数据库面试题（2020最新版）

HashMap底层实现原理，红黑树，B+树，B树的结构原理 Spring的AOP和IOC是什么？它们常见的使用场景有哪些？Spring事务，事务的属性，传播行为，数据库隔离级别 Spring和SpringMVC，MyBatis以及SpringBoot的注解分别有哪些？SpringMVC的工作原理，SpringBoot框架的优点，MyBatis框架的优点 SpringCould组件有哪些，他们...

《经典算法案例》01-08：如何使用质数设计扫雷（Minesweeper）游戏

《Oracle Java SE编程自学与面试指南》最佳学习路线图（2020最新版）

2020春招面试了10多家大厂，我把问烂了的数据库事务知识点总结了一下

2020年截止目前，我面试了阿里巴巴、腾讯、美团、拼多多、京东、快手等互联网大厂。我发现数据库事务在面试中出现的次数非常多。