TestCalculatorDemo

鼠标键盘录制回放p打开保存文件的类模块的源码(Mouse and keyboard recording playback p open class module of the source code for save the file)

简单的鼠标画线Vb源代码,有需要的就下载吧。(Simple mouse to draw lines Vb source code, there is a need to download it.)

编写程序用静态成员的方法实现对班费的管理，要求定义一个类Student，除了声明一个存放班费的静态成员，还要分别定义一个上交班费的成员函数Contribute（），花费班费的成员函数Spend（）和显示班费的静态成员函数Display（）(Write a program with static member class fee management, require the definition of a class Student, stored in addition to declare a static member of the class fee, but also define a member function of a shift fee Contribute (), a member of the spending class fee spend () function and display class fee static member function display ())

本程序主要完成多用途不同质量单位，长度单位的双向转换功能(This procedure mainly complete multi-purpose different quality unit, the unit length of bidirectional conversion function)

说明：  下面是一个结构体声明： struct box { char maker[40] float height float width float length float volume } a. 编写一个函数，按值传递box结构，并显示每个成员的值 b. 编写一个函数，传递box结构的地址，并将volume成员设置为其他三维长度的成绩。 c. 编写一个使用这两个函数的简单程序 (Here is a structure declaration: struct box {char maker [40] float height float width float length float volume } a. Write a function that is passed by value box structure, and shows the value of each member b . to write a function, passing the address box structure and volume settings for the other three members of the length of the results. c. use these functions to write a simple program)

VB sample code for NI-DAQ card.

是一个万年历功能的程序，可以查询某年某天是星期几(A year of day is a calendar function, you can query the day of the week)

自己做的一个基于单片机的万年历的程序 用液晶显示(Own a calendar based on single-chip liquid crystal display using the procedures)

简单的MFC编程 在文本中删除指定的中文或中文句子(MFC programming Chinese or Chinese sentence in the text to delete the specified )

分治法思想，求最邻近点对，考虑将所给的n个点的集合S分成2个子集S1和S2，每个子集中约有n/2个点，然后在每个子集中递归地求其最接近的点对(Divide and conquer ideas, find the nearest point to consider given the set S of n points into two subsets S1 and S2, each subset of about n/2 points, and then recursively find its focus in each sub-the closest point)