nokiafree_v310_nokia_unlock_codes_calculator

给定一组物品，每种物品都有自己的重量和价格，在限定的总重量内，我们如何选择，才能使得物品的总价格最高(Given a set of items, each item has its own weight and price, within a limited total weight, what we choose to make the total price of the highest items)

用VC++实现FLASH的经典事例很有借鉴意义,希望大家喜欢,详细介绍了两种语言的兼容性()

对地址薄的初学测试,自己写的,希望对大家有所启发吧(Address book for novice test, write your own, we hope to inspire it)

说明：  对简单的一些计算用计算器计算出来，包括加减乘除(Some of the simple calculated calculation calculator, including the Math)

实现加密解密功能，2048位，加密解密速度非常快，用时非常短(Encrypt and decrypt)

编写C程序，随机给出n*n的邻接矩阵，并打印输出邻接矩阵，以及有向图的边的个数，每个顶点的度，并判断该图中是否存在Euler回路： （1）如果为n阶，则随机产生一个n*n的邻接矩阵； （2）输出邻接矩阵，边的个数，每个顶点的度以及图中是否存在Euler回路。 这个题目涉及到了两个主要的知识点，一个是数据结构中的有向图的邻接矩阵的创建，还有就是离散数学中的Euler回路的判定定理。(The preparation of C procedures, were randomly given n* n s adjacency matrix and adjacency matrix printouts, as well as to map the number of edges, each vertex degrees, and determine the existence of the map Euler circuit: (1) If for n-order, then randomly generated a n* n adjacency matrix (2) output adjacency matrix, the number of edges, each vertex of degree as well as map the existence of Euler circuit. This topic relates to two main points of knowledge, a data structure of digraph adjacency matrix of creation, there is discrete mathematics in the loop to determine Euler theorem.)

win32 opengl画线,配置好了glut,h(Win32 opengl draws lines, and glut,h is configured)

给定日期，然后输入天数，计算输入天数之后的日期是多少(Given date, and then enter the number of days to calculate the number of days after the date of entry is the number)

一个外国人写的 VB6 子类和定时器，提供源代码。

说明：  使用vc实现视频捕获功能,调用系统函数实现(Vc achieved using video capture function, call the system function to achieve)