窗口图形编程的基本知识和常用方法

在Visual C++6.0 WinXp下编译通过 采用类来实现,从CString继承而来 数据运算的结果保存在CString类中 理论上可对任意长的数据进行相加 在Release目录下有可执行文件，将*.txt拖放到longadd.exe上即可，*.txt为数据文件。-in Visual C Compiler 6.0 WinXp adopted under category to achieve, redeem inherited from the Operational data stored in the category redeem theoretically can arbitrarily long data Release together in a directory executable file,*. txt will drag on to be longadd.exe,*. txt for data files.

完全二叉树的判别：输入一二叉树，判别是否为完全二叉树。-complete binary tree discriminant : Admission of a binary tree, to determine whether it fully binary tree.

.Net中创建接收服务的组建-. Net to create a service set up to receive

winsock编程-winsock Programming

雪花在场景中飞舞的效果 ，有很多雪花不断地落下-Snow in the scene flying effect.There are many snowflakes continue to fall！

VC向Vb传递命令行参数,我做的一个示例，有朋友要的-VC Vb to transfer command line parameters, I am doing an example, a friend to the

功能：计算两个time_t时间的差，返回值为double类型的秒-functions : two time_t terms of the time difference, return value to the type of double seconds

搜索一段IP地址内，开放某个端口的机器。单线程搜索，有点慢。-search for IP addresses, opening a port of machinery. Single-threaded searching, a bit slow.

简介： 在这个项目中使用 Adobe PDF 阅读器 COM 组件并包装为 WPF 控件。背景： WPF / C# 有没有内置的控件/库来支持 PDF，这个项目演示了如何在 WPF 中轻松查看 PDF 文档。

由用户输入系统进程数(最多50个进程)来模拟优先级调度算法假设进程是同时到达CPU，进程运行时间(1-10秒)和进程优先级 (1-10，10最高1最低)由程序随机产生，进程有2种状态就绪状态（Ready）和完成状态(Complete)首先根据优先级对进程进行排序，再根据优先级分配时间片运行每次分给进程的时间片为1秒，运行完后需运行时间减1优先级减1转下一个进程。如果进程已经完成就插入到完成队列，如果没有完成就重新插入到就绪队列中的正确位置 程序有两种运行方式： 1、可以直接给出最后的运行结果，进程最后的优先级、 运行完每一个进程的时间及完成进程的总时间，进程最后的状态。 2、可以选择自动运行，过程中显示每一次调度信息包括本次调度进程完成队列信息就绪队列信息等*/ -Process user input from a number of systems (up to 50 processes) to simulate priority scheduling algorithm is the assumption that the process of arrival at the same time CPU, the process of run-time (1-10 seconds) and the process priority class (1-10,10 highest minimum 1) randomly generated by the process, the process has two kinds of status status ready (Ready) and achieve status (Complete) First of all, the process in accordance with the priority ranking, and distribution in accordance with the priority of each time slice to run to the process time slice for the second one, to be run after run-time priority class minus one minus one to t