C51的两个程序,一个是将LONG型十六进制数据转换成LONG型的十进制数,另一个则是逆运算
上传时间： 2014-01-24
上传用户：maizezhen
a small program by Yuval Fisher that has gone a long way to revealing some of the secrets of fracal image compression.
标签： revealing program secrets Fisher
上传时间： 2015-12-24
上传用户：脚趾头
Techniques for storing and processing data are at the heart of all programs. The term data structure is used to describe the way data is stored, and the term algorithm is used to describe the way data is processed.
标签： data Techniques processing structure
上传时间： 2014-03-10
上传用户：cc1
武林DLL注入源码 VB调用 Private Declare Function CallHotKey Lib "wulin.dll" (ByVal hWnd As Long, ByVal hotkey As Long) As Boolean Private Declare Function CallBase Lib "wulin.dll" (ByVal hWnd As Long, ByVal action As Long) As Boolean CallHotKey(窗体句柄,HotKey) HotKey ====0---------17 分别是0-----9 F1-----F8 CallBase(窗体句柄,Action) Action==0-------N 分别实现不同的功能 Action=0 选怪 函数反回值是 布尔值 ( 窗体句柄,Action 窗体句柄,HotKey 都为DWORD值)
标签： ByVal CallHotKey Function Private
上传时间： 2013-11-25
上传用户：maizezhen
1 #define GPBCON (*(volatile unsigned long *)0x56000010) 2 #define GPBDAT (*(volatile unsigned long *)0x56000014) 3 #define GPFCON (*(volatile unsigned long *)0x56000050) 4 #define GPFDAT (*(volatile unsigned long *)0x56000054)
标签： volatile unsigned define long
上传时间： 2013-12-27
上传用户：BIBI
Traveling Salesman Problem (TSP) has been an interesting problem for a long time in classical optimization techniques which are based on linear and nonlinear programming. TSP can be described as follows: Given a number of cities to visit and their distances from all other cities know, an optimal travel route has to be found so that each city is visited one and only once with the least possible distance traveled. This is a simple problem with handful of cities but becomes complicated as the number increases.
标签： interesting Traveling classical Salesman
上传时间： 2016-02-06
上传用户：rocwangdp
Just what is a regular expression, anyway? Take the tutorial to get the long answer. The short answer is that a regular expression is a compact way of describing complex patterns in texts. You can use them to search for patterns and, once found, to modify the patterns in complex ways. You can also use them to launch programmatic actions that depend on patterns. A tongue-in-cheek comment by programmers is worth thinking about: "Sometimes you have a programming problem and it seems like the best solution is to use regular expressions now you have two problems." Regular expressions are amazingly powerful and deeply expressive. That is the very reason writing them is just as error-prone as writing any other complex programming code. It is always better to solve a genuinely simple problem in a simple way when you go beyond simple, think about regular expressions. Tutorial: Using regular expressions
标签： expression the tutorial regular
上传时间： 2013-12-19
上传用户：sardinescn
编程题（15_01.c） 结构 struct student { long num char name[20] int score struct student *next } 链表练习： (1).编写函数struct student * creat(int n),创建一个按学号升序排列的新链表,每个链表中的结点中 的学号、成绩由键盘输入，一共n个节点。 (2).编写函数void print(struct student *head),输出链表，格式每行一个结点，包括学号，姓名,分数。 (3).编写函数struct student * merge(struct student *a,struct student *b), 将已知的a,b两个链表 按学号升序合并，若学号相同则保留成绩高的结点。 (4).编写函数struct student * del(struct student *a,struct student *b),从a链表中删除b链表中有 相同学号的那些结点。 (5).编写main函数，调用函数creat建立2个链表a,b,用print输出俩个链表；调用函数merge升序合并2个 链表，并输出结果；调用函数del实现a-b,并输出结果。 a: 20304,xxxx,75, 20311,yyyy,89 20303,zzzz,62 20307,aaaa,87 20320,bbbb,79 b： 20302,dddd,65 20301,cccc,99 20311,yyyy,87 20323,kkkk,88 20307,aaaa,92 20322,pppp,83
上传时间： 2016-04-13
上传用户：zxc23456789
堆栈的数据结构和操作 ypedef struct{ HGLOBAL hMem //堆栈全局内存句柄 POINT *lpMyStack //指向该句柄的指针 LONG ElementsNum //堆栈的大小 LONG ptr //指向栈顶得指针
标签： ElementsNum lpMyStack HGLOBAL ypedef
上传时间： 2013-11-26
上传用户：15736969615
//按柱面和磁道来读取磁盘数据,要求 Public Function ReadDisk(ByVal Cylinders As Long, ByVal Tracks As Long, db() As Byte) As Boolean
标签： ByVal Long Cylinders Function
上传时间： 2014-01-13
上传用户：zxc23456789
