这是一个由C++编制的MFC工程，能够对文件进行加密

一个简单的qt小程序，适合初学者，本功能实现多个单位的转换

facelet使用演示 facelet使用演示-facelet the use of demo using the demo facelet

一个基于HLA高层体系结构分布式仿真的例子，用VC++编写-A high level architecture based on HLA distributed simulation examples, using VC++ Prepared

预览屏幕保护程序的程序-The program of previewing screen-save

pmacct是一个用于搜集IP流量信息（源地址，字节计数，和包数量）的工具。数据保存在一个内存中的表内，客户端程序可以通过一个本地面向流的连接访问其内容。搜集离线包通过使用pcap库和混合模式下的一个或多个网卡实现。-pmacct is a collection for IP traffic information (source address, byte count, and the number of packets) tool. Data stored in a memory table, the client program through a local flow-oriented to access its contents. To collect offline pcap packet through the use of tanks and mixed mode of one or more card to achieve.

Visual C++ 6.0应用编程150例-Visual C 6.0 Application Programming 150 cases

好网址添加程序软件好用，但是还没有完善，希望大家喜欢，提出宝贵意见-Add a good web site easy to use software, but not yet perfect, I hope everyone likes to give valuable advice

一次作业的源码,功能可能太简单,仅供参考-One-stop source, function might be too easy, for reference only

VC各种综合类的设计，包含有：菜单类、操作Excel类、ADO、打印等等。-VC range of integrated design, includes: menu category, operation Excel type, ADO, Print, etc..

for： Root of a Polynomial --- --- --- --- -- Time Limit: 1 Second Memory Limit: 32768 KB -------------------------------------------------------------------------------- A polynomial of degree n has the common form as . Your task is to write a function to find a root of a given polynomial in a given interval. Format of function double Polynomial_Root(int n, double c[], double a, double b, double EPS) where int n is the degree of the polynomial double c[] is an array of n +1 coefficients , , ..., , and of the given polynomial double a and b are the two end-points of the given interval and double EPS is the accuracy of the root. The function must return the root. Note: It is guaranteed that a unique real number r exists in the given interval such that p(r) = 0. -for: Root of a Polynomial---------------------- Time Limit: 1 Second Memory Limit: 32768 KB-------------------------------------------------------------------------------- A polynomi