c#平台下开发XNA2.0 这本书是xna入门的好书。可以算是官方材料...

C语言实现MD5算法 C语言实现MD5算法(C language C language MD5 algorithm MD5 Algorithm)

51单片机数字钟程序，数码管显示时分秒，按键切换显示日期，包含闰年处理。(51 microcontroller digital clock program)

c++用栈来实现迷宫求解（c语言数据结构）(c++ stack maze solving (c language data structure))

第1章 Visual C++集成开发环境new 第2章 C++语言基础new 第3章 C++面向对象程序设计new 第4章 创建应用程序框架new 第5章 文档与视图new 第6章 对话框和标准控件new 第7章 MFC原理与方法new(Chapter 1, an integrated development environment Visual C++ new language based on Chapter 2 C++ new Chapter 3 C++ new object-oriented programming in Chapter 4 Creating new application framework document and view Chapter 5 Chapter 6 new dialogs and standard controls new section Chapter 7 MFC new principles and methods)

ANT协议中的burst数据传输方式详解，包括收发时序及数据格式。(ANT protocol Detailed burst data transmission, including the timing and receive data format.)

本控件基于ＧＳＭ Modem工作,不需要使用电话语音卡设备,不但具备普通电话语音卡功能,还具备手机短信收发功能, 语音与短信()

SIFT，即尺度不变特征变换（Scale-invariant feature transform，SIFT），是用于图像处理领域的一种描述。这种描述具有尺度不变性，可在图像中检测出关键点，是一种局部特征描述子。 该方法于 1999 年由 David Lowe 首先发表于计算机视觉国际会议（International Conference on Computer Vision，ICCV），2004 年再次经 David Lowe 整理完善后发表于 International journal of computer vision（IJCV） 。截止 2014 年 8 月，该论文单篇被引次数达 25000 余次。(来自百度)(SIFT, namely Scale-invariant feature transform (SIFT), is a description used in the field of image processing. This description has scale invariance and can detect key points in images. It is a local feature descriptor. This method was first published by David Lowe at the International Conference on Computer Vision (ICCV) in 1999 and published in the International Journal of Computer Vision (IJCV) in 2004 after it was sorted out and perfected by David Lowe again. As of August 2014, more than 25,000 citations have been cited. (From Baidu))

The beginning of a winter break near Spring Festival is always the beginning of a peak period of transportation. If you have ever tried to get a train ticket at that time, you must have witnessed the endless queues in front of every ticket box window. If a guy has seen his friend in a queue, then it is very much likely that this lucky guy might go straight to his friend and ask for a favor. This is called "jumping the queue". It is unfair to the rest of the people in the line, but, it is life. Your task is to write a program that simulates such a queue with people jumping in every now and then, assume that, if one in the queue has several friends asking for favors, he would arrange their requests in a queue of his own(The beginning of a winter break near Spring Festival is always the beginning of a peak perio d of transportation. If you have ever tried to ge not a train ticket at that time. you must have witnessed the endless queues in fr ont of every ticket box window. If a guy has seen h is friend in a queue, then it is very much likely that this lucky guy mi ght go straight to his friend and ask for a favor. This is called "jumping the queue." It is unfair to the rest of the people in the line, but, it is life. Your task is to write a program that si mulates such a queue with people jumping in ever y now and then, assume that, if one in the queue has several friends asking az r favors. he would arrange their requests in a queue of his own)

一个基于Wind32的游戏实例，对于学习和运用c++ 编写游戏是一个很好的参考(A game based Win32 and it is useful for you study the game programming)

说明：  但是对于“真二叉树”（每个内部节点都有两个孩子的二叉树），给定它的先序、后序遍历序列足以完全确定它的结构。将二叉树的n个节点用[1, n]内的整数进行编号，输入一棵真二叉树的先序、后序遍历序列，请输出它的中序遍历序列。(But for one proper binary tree, in which each internal node has two sons, we can uniquely determine it through its given preorder traversal sequence and postorder traversal sequence.Label n nodes in one binary tree using the integers in [1, n], we would like to output the inorder traversal sequence of a binary tree through its preorder and postorder traversal sequence.)