PowerMILL自动出程式单

说明：  代码使用Python语言，简洁高效，能够做到实时爬取疫情数据，并且保存到CSV文件中(Crawling epidemic data in real time)

算法实现题 最长公共子序列问题 给定两个序列 X = { x1 , x2 , ... , xm } Y = { y1 , y2 , ... , yn } 求X和Y的一个最长公共子序列 举例 X = { a , b , c , b , d , a , b } Y = { b , d , c , a , b , a } 最长公共子序列为 LSC = { b , c , b , a }-Algorithm to achieve the longest common sub-title sequence of the problem given two sequences X = (x1, x2, ..., xm) Y = (y1, y2, ..., yn) for X and Y, a maximum common substructure sequence, for example X = (a, b, c, b, d, a, b) Y = (b, d, c, a, b, a) the longest common sub-sequence for LSC = (b, c, b, a )

运行环境 TC2.0 w,s,a,d控制方向, 逗号和句号控制力量,空格发杆 本来还可用鼠标控制,因为要用一个"mouse.h",所以去掉了-runtime environment WITH TC 2.0 w, s, a, d to control direction, the comma and full stop controlling forces, space-could have also been made with the mouse control, because we are a "mouse.h", removed the

说明：  中科世为h500模块的应用原理图，可以方便开发界面等功能(Application schematic diagram of zhongkeshiwei H500 module)

GB码与BIG5码的相互转换(200KB).zip-GB yards and BIG5 code conversion (200KB). Zip

找出只出现一次的数字，其他数字均出现了2次，时间空间尽量少(Identify only appears once, while other figures have appeared two times to minimize time and space)

hen hao de ,qing da jia shiyong

说明：  NETCFv35.Messages.zh-CHS.cab

n阶魔方阵，就是把1-n2个连续的正整数填到一个m*n的方阵中，使得每一列的和，每一行的和，以及两个对角线的和都相等。本程序只填奇数阶的魔方阵-n-order magic square, that is, the 1-n2 consecutive filled to a positive integer m* n square in which each column and each row and, as well as two diagonal and are equal. This procedure只填odd order magic squares

Magic Laser，精细地模仿了Chromatron光栅游戏，比网上流传的Flash版本精致不是一-Magic Laser, fine to imitate the game Chromatron grating than spreading online version of the Flash is not a delicate little