FK

Image inpainting example code

用两个字符形成点阵大字，VC++经典编程源码，很好的参考资料。(Lattice with two characters form characters, VC++ classical programming source code, a good reference.)

Lua 就被设计成很容易和传统的 C/C++整合的语言。这种语言的二元性带 来了极大的好处。Lua 是一个小巧而简单的语言，因为 Lua 不致力于做 C 语言已经做得 很好的领域，比如：性能、底层操作以及与第三方软件的接口。Lua 依赖于 C 去做完成 这些任务。Lua 所提供的机制是 C 不善于的：高级语言、动态结构、简洁、易于测试和 调试等。正因为如此，Lua 具有良好的安全保证，自动内存管理，简便的字符串处理功 能及其他动态数据的改变。(Lua was designed to be easily integrated with the traditional C/C++ language. The duality of the language To the great benefits. Lua is a small and simple language, because the Lua is not committed to doing the C language has done Good domain, such as performance, the underlying operating and the interface with third party software. Lua is dependent on C to complete These tasks. Lua mechanism is provided by C are not good at: a high-level language, dynamic structure, concise, easy to test and Debugging, etc. Because of this, the Lua has good security, automatic memory management, simple string handling work Can change, and other dynamic data.)

用于3389远程端口修改的小工具,MFC实现并且增加虚拟机检测功能,防止小白遇到黑心服务商用虚拟机代替服务器(Remote 3389 port to modify the gadgets used, MFC and increase the virtual machine detection function, prevent white encounter black heart service commercial virtual machine instead of the server )

说明：  G P S和G S M 双定位终端的软硬件设计与实现 :随着移动定位技术的发展， 单纯的签子G P S 的定位终端或者荃于移动网络的定位终端都将无法浦足用户的俩求。前者的G P S定 位信号受地形及建筑物的影晌，会存在定位盲区 后者定位精度和定位能力受到移动网 络的限制。该文提出一种集成了G P S定位和G S M 网络定位技术的定位终端，阐述了它的软硬件的设计和实现。实验结果表明，该定位终端结合了G P S和G S M网络两种定位方式的优点，(D e s i g n a n d I m p l e me n t a t i o n o f t h e T r a c k i n g T e r mi n a l I n t e g r a t i n g GP S wi t h GS M P o s i t i o n i n g T e c h n o l o g y J I A NG X i r u i , C HE N G Z h e n l i n , F AN G J i n y u n , Z HA NG L i v n g ( I n s t i t u t e o f C o m p u t e T e c h n o l o g y , C h i n e s e A c a d e m y o f S c i e n c e s , B e i j i n g 1 0 0 0 8 0 ) b s t r a c t ] Th e t r a c k i n g t e r mi n a l p l a y s a n i mp o r a n t rl e i n t h e n a v i g a t i o n a n d p o s i t i o n i n g s y s t e m. Ho w t o t h e t r a c k i n g t e r mi n a l i s a k e y p rb l e m t o t h e d e s i g n e r a n d u s e r . T h i s p a p e r p r e s e n t s a me t h o d wh i c h i mpr v e t i n t e g r a t e s p e r f o r m a n c e a n d p r e c i s i o GP S wi 比GS M p o s i t i o n i n g h n o l o g y i n o n e t e r mi n a l , a n d s p e c i f i e s t h e s o f)

说明：  Euler 回路问题 .问题描述： 对于给定的图G 和G 中的2 个顶点v 和w，连接顶点v 和w 且经过图中每条边恰好1 次 的路径称为顶点v 和w 之间的1 条Euler 路。当v=w 时得到一条首尾相接的Euler 回路。 .编程任务： 对于给定的图G，编程计算图G 的一条Euler 回路。 .数据输入： 由文件input.txt 给出输入数据。第1 行有2 个正整数n 和m，表示给定的图G 有n 个 顶点和m 条边，顶点编号为1，2，…，n。接下来的m 行中，每行有2 个正整数u,v ，表示 图G 的一条边(u,v) 。 .结果输出: 将编程计算出的Euler 回路输出到文件output.txt 。如果不存在Euler 回路，则输出-1。(Euler circuit problem. Problem description : for a given graph G and G of two vertices v, w, connectivity and vertex v w map through which each side precisely the path to a meeting called vertices v, w between a Euler Road. When v = w be an end-to-end circuit Euler. . Programming tasks : for a given graph G, programming terms of a graph G Euler circuit. . Data input : from the document input.txt given input data. Line 1 has two positive integers n and m, to the graph G with n vertices and m edges and vertices numbered 1, 2, ..., n. Next m OK, every trip has two positive integer u, v, said of a graph G edge (u, v). . Results output : Programming will be calculated by Euler circuit output to a file output.txt. If there is no Euler circuit, the output 1.)

过tp所有函数hook驱动 过tp所有函数hook驱动 2015.9.1(pass TP All Hook)

说明：  vc6.0一些基础的知识点，以及对读串口函数的进一步封装(Some basic knowledge points of VC6.0 and further encapsulation of read serial function)

局域网共享扫描MFC多线程编写 具有端口扫描 共享扫描 IP扫描 mac扫描等功能(MFC multi-threaded scanning local area network to share the preparation of a port scan scanner share scanner functions such as IP scanning mac)

经典MFC编程书籍，MFC深入详解的第一章总结笔记(The first chapter summarizes notes of the Classic MFC book MFC in-depth explanation)