ACM河南省热身赛【DOC精选】.docVIP

河南省第七届大学生程序设计竞赛 【 A 】 最长公共子序列 Time Limit: 1000MS 给定一个字符序列X=（x1，x2，…，xm）,其子序列是指从中随意地（不一定连续）去掉若干个字符（可能一个也不去掉）后,按原顺序所形成的序列。 给定两个序列X=（x1，x2，…，xm），Y=（y1，y2，…，yn）,若Z=（Z1，Z2，…，ZK）既是X的子序列，又是Y的子序列，则称Y是X和Y的公共子序列。 对给定的两个字符序列，求出他们最长的公共子序列长度。 【标准输入】 第1行： N 表示有N组测试数据（1≤ N ≤ 10） 第2 ~ N+1行： x1x2…xm y1y2…yn 每行两个字符串，一个空格隔开 【标准输出】 输出有N行。每行一个整数， 表示X和Y的最长公共子序列的长度。 【约束条件】 字符串全由大写的26个英文字母组成，每个字符串的长度=50 【 样 例 】 标准输入 标准输出 2 ACSBC CCCBEEY ABCD YYYYWYUOPYTTT 2 0 【B】 Climbing Worm Time Limit: 1000MS 【Description】 An rm is at the bottom of a well N inches deep. It has enough energy to climb U inches every minute, but then has to rest a minute before climbing again. During the rest, it slips down D inches. The process of climbing and resting then repeats. How long before the worm climbs out of the well? Well always count a portion of a minute as a whole minute and if the worm just reaches the top of the well at the end of its climbing, well assume the worm makes it out. 【Standard input】The input consists of multiple test cases. Each test case contains 3 positive integers N, U and D. These give the values mentioned in the paragraph above. Furthermore, you may assume D U and N 100. A value of N = 0 indicates end of output 【Standard output】ach test case, print a single integer on a line, indicating the number of minutes it takes for the worm to climb out of the well. 【Sample Input】【Sample Output】 2 1 7 0 0 0