nan_test

贪吃蛇,还有点问题,希望各位网友可以提出改进的方法-Snake, there are points in the hope that netizens can improve the way

Library Management System 1

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

VC++工业组态软件—— 组态王源码，一共包括了经过5次优化修正后的组态王软件源码，有的是组态相关DLL控件的源码，每一个文件夹中的内容都可以在VC++6.0中顺利编译成功。了解本源码可以对提高您的编程思路有一定帮助。

CS框架结构的聊天程序C#代码实例，以客户端和服务端的运行模式，呈现基于C#的聊天程序，两者同时运行，即可点对点发送聊天内容，在两个程序端都可看到消息内容。

mpu6050驱动代码，加上液晶屏，啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊啊(MPU 6050 driver code)

打砖块游戏，分为多关，Main为运行函数-Breakout game, is divided into more closed, Main to run a function

C++关于位运算的小程序，哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈哈(C++ bit computing on small programs, ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha)

借鉴别人，欧拉回路，测试输入包含若干测试用例。每个测试用例的第1行给出两个正整数，分别是节点数N ( 1 < N < 1000 )和边数M；随后的M行对应M条边，每行给出一对正整数，分别是该条边直接连通的两个节点的编号（节点从1到N编号）。当N为0时输入结束。(Referring to others, Euler circuit, test input contains several test cases. The first line of each test case gives two positive integers, namely the number of nodes N (1 < N < 1000) and the number of edges M; the subsequent M lines correspond to M edges, and each line gives a pair of positive integers, which are the number of the two nodes directly connected to the edge (node numbers from 1 to N). When N is 0, the input ends.)

商业版可以向你的网站发送假的请求，大幅度的增加你的网站的点击率和排名 name:www.mycodes.net sn:042392934239-Commercial version could be sent to your Web site leave request, a substantial increase in your site s click-through rate and ranking name: www.mycodes.netsn:042392934239