computer graphics lectures, concise summary of the changes in basic knowledge Gr...

sjf2410/2440烧写工具，非常好用的，大家可以试试看哈-sjf2410/2440 burning tool, very useful, and we can try Kazakhstan

受用一生的电脑知识!!!!!!!!!!!!!1!!!!!! 快来看一下-good enough for the whole life of a computer knowledge !!!!!!!!!!!!! !!!!!! Come see!

八数码问题的源代码-eight digital source of the problem

ADS下基于AT91SAM7X256-EK的可以运行的uCOS-II源码，增加了UART程序。-ADS-based AT91SAM7X256-EK can run uCOS-II source, an increase of UART procedures.

某市住房公积金管理中心系统，很好的数据库！提供给大家参考！-city housing provident fund management center, a good database! Provide for your reference!

JSP建站必须文件commons-codec-1.3.zip-JSP documents must Station at commons-codec- 1.3.zip

力麒排队系统系统管理-edge Yee Queuing System System

滚球游戏意智游戏 问题描述 有八个小洞，序号和分布位置如图。小球从A、B、C（即洞号0、1、2）三个位置之一滚下。如果洞的状态为0时，球向左滚；如果洞的状态为1时，球向右滚。凡是球滚过的洞，状态取反（既由1变0，由0变1）。 现用8位二进制数依次从左到右表示八个小洞的状态。 例： 图中的初始状态为 00000101 时，最多滚入3个球时有 从C洞滚入一小球状态为 ――――＞ 00101111 从B洞滚入一小球状态为 ――――＞ 01111011 从A洞滚入一小球状态为 ――――＞ -bowls game Italy-game description eight holes and serial number and distribution figure. Small ball from the A, B, C (hole No. 0,1,2), one of the fallen three locations. If the state of the hole 0:00 a.m., the ball rolling left; If the state of the hole 1:00, the ball rolling right. Whatever strain at the hole, from the anti-state (both from a variable 0, 0 Variable 1). Now with eight followed by the binary number eight hole, said whatever the state. Cases : Figure the initial states of 00000101, three roll-up ball from C hole rolled over a small ball of----> 00101111 B hole rolled over from one state to the small ball----> 01111011 from A hole rolled over a small ball of---->

输入密码次数有一定限制，错误3次即宣告失败-Enter a password number is limited and the error that failed three times

单循环赛中选手胜负序列求解问题 名称：单循环赛中选手胜负序列求解问题 内容：有n个选手 P 1 ,P 2 ,P 3 ,… ,P n 参加了的单循环赛，每对选手之间非胜即负。现要求求出一个选手序列 P 1 ,P 2 ,P 3 ,… ,P n , 使其满足 P i 胜 P i+ 1 (i=1,… ,n-1) 。 -Single round robin tournament players winning sequence to solve the problem name: the outcome of single round-robin tournament players to solve the problem sequence elements: There are n-player P 1, P 2, P 3, ..., P n participated in a single round-robin between each pair of players Non-win or negative. Players are now required to find a sequence of P 1 " , P 2" , P 3 " , ..., P n" , to meet the P i " W P i+ 1" (i = 1, ..., n-1).