closest_pair

计算一个整数的和的积德最大值，即最优整数的接的最大值(The Jide calculate an integer, and the maximum value, i.e. the optimal integer then the maximum)

本程序实现构造任意阶幻方，输入数字构造你想要的幻方(The program to construct arbitrary magic square, magic square input digital structure you want)

基于MFC编写的简单计算器Visual C++程序(Write a simple calculator based on MFC Visual C++ program)

用来求两个实数之间的相乘，调用方法具体见程序(Be used to seek a multiplication between two real numbers)

谭浩强C程序设计第四版第9章习题答案,自己做出来的( C Programming Fourth Edition Chapter 9 Exercise answers, do it yourself)

链表的基本功能实现链表的各种基本功能，初学者使用(The basic functions of the list)

实现一个可编程表达式的计算器，并判断输入的表达式是否正确。(Expression of the realization of a programmable calculator, and determine the expression entered is correct.)

封装实现了 多线程操作、TCP/IP操作、运算符重载等。(Package which enables multi-threaded operation, TCP/IP operations, operator overloading, and so on.)

编写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.)

USACO第10题，Marry乳业从一些奶农手中采购牛奶，并且每一位奶农为乳制品加工企业提供的价格是不同的。此外，就像每头奶牛每天只能挤出固定数量的奶，每位奶农每天能提供的牛奶数量是一定的。每天Marry乳业可以从奶农手中采购到小于或者等于奶农最大产量的整数数量的牛奶。 给出Marry乳业每天对牛奶的需求量，还有每位奶农提供的牛奶单价和产量。计算采购足够数量的牛奶所需的最小花费。 (Give the requirement of milk and the amount that they offer.)