3阶魔方， Visual C++开发， C++语言， 鼠标控制

用C++实现m着色问题-achieve m C Coloring

、测试该文件时应首先启动UdpServer的服务器端，接着启动myUdpClient的客户端软件。 3、在myUdpClient项目文件中myUdpClient.cs文件的56行为连接到远程服务器端的IP地址，这里为本地IP地址，实际使用时应相应更改。 以上软件是需要注册才能长期正常使用的软件，请大家支持正版软件的使用-To test the document should be the first to start UdpServer server-side, and then start the myUdpClient client software. 3, myUdpClient project documents myUdpClient.cs file 56 acts to connect to the remote server-side IP address, where the local IP address, the actual use should be changed accordingly. The above software is required to be registered in order to long-term normal use of the software, please support the use of genuine software

手机上面的版本，JAVA编的。游戏性很不错，也不会因为这按坏键盘-cell phone version of Java series. Gameplay is very good, not bad because it by keyboard

WINCE3.0源代码（WinCE 3.0 SourceCode）-WinCE 3.0 SourceCode

    这是一个delphi版的简单计算器，源码版，大家可以参考，无第三方控件，支持D7-XE5。

这是一个对数学表达式求值的C++ class，详细的说明在Calculator.pdf中。 这个Calculator class虽然经过我多次测试，改正了不少错误，但我不保证在将来的使用中它不会对您的程序造成影响，对您在使用中造成的一切后果，本人不承担任何责任。-this a mathematical expression evaluates the C class, detailed description of the Calculator.pdf China. The Calculator class despite my repeated testing, correct many mistakes, but I do not guarantee in the future it will not use the procedure to you impact your right to use all the consequences of that, I do not accept any responsibility.

a)需求分析： 任务：建立南京主要公交线路图。 要求：输入任意两地点，给出最佳的乘车线路和转车地点。 b)概要设计： 本程序所使用的数据结构是树和线性表，所使用的算法主要有堆排序、赫夫曼算法。 -a) Requirements Analysis : Mandate : the establishment of the Nanjing main transit route map. Requirements : 2 importation arbitrary locations, is the best car lines and interchange locations. B) Summary of design : the procedures used by the data structure is linear tree and table, the algorithm used by the main sculpture, in order Huffman algorithm.

Allen braley两种通信通过以太网MICROLOGIX1100有两个CPU传递信息来源，通过以太网

数据结构中实现栈空间共享的小程序．先用户分配一个空间.再分为几个栈.尽量平分每个栈的空间,但是各个栈的空间是可以变化的,由用户的需要而定.用户可任意选择输入栈的顺序,如先选择第1栈,输入元素,再输第0栈,再输入第2栈,以后也可以再在原先的栈内添加或删除元素.若pop,留下的空间归原栈所有,以后添加元素的时候可以用来左右移动栈,元素在整个空间的开始装入的顺序是先分别在各个栈的bot处装.-data structure to achieve the shared stack space small programs. First distribution of a user space. Again divided into several stacks. Equally as each stack space, but all stack space can change from the user"s needs. Users can freely select input stack in the order, if we choose a stack, the importation of elements and transported 0 stack, the first re-entry two stack, could again after the original stack within add or delete elements. if pop, leaving the space under the original stack all, after adding the element of time can be used to stack and move around, the elements in the entire space to the beginning of the loading sequence is first in the various bot Department stack installed.

PPC 上 播放声音的一些测试使用，包括并发播放声音，窗口切换出去后暂停声音等（适合做游戏），附带PPC窗口旋转的示例