项目名称：科学计算器 姓名：刘博 学号：03031147 班级：能动35 完成时间：2004...

Cat Tom 兄弟的力作.代码是纯C写的，本来是用TC2.0写的，后来移植到DJGPP下，如果有人想看TC代码的话Cat Tom [CRAZY BUGS]的主页可以下载到。 http://www.8623.com-brothers Tom Cat Book. The code is written in pure C, originally was written WITH TC 2.0 and later transplanted to DJGPP, if someone want to see the code TC Cat Tom [Bass BUGS] can be downloaded to the home page. Http://www.8623.com

text chatting program

我编写的一个经典的小游戏－－贪食蛇，能够在你的茶余饭后给你带来快乐！-I prepared a classic small game-- Snake, in your leisure to bring you happiness!

这就是我们玩的小游戏，对开始接触游戏开发的新手很实用。-This is a small game which is popular with children,practical for new player.

关于java的一个项目-on a project

制作网页的时候，有很多的技巧，如屏蔽鼠标右键 、防止复制、不准粘贴、 防止被人frame 等-production of the website, a lot of skills, such as shielding the right mouse button to prevent copying, no paste, to prevent any such frame

用msp430 控制DS18B20－－－－－－－－－－－－－是应用４３０的好例子

易语言 超好看的皮肤 喜欢就拿去吧-Easy language like super good-looking skin Take the Go

这是一个用VHDL语言写的数码管程序.有用着-This is a VHDL language used to write the digital tube procedures. Useful to an

编写筛选查找素数函数： void sieve(bool isPrime[], int n) 其中isPrime[ ]为一个布尔型数组，n为数组大小。由于2是第一个素数， 所以设置isPrime[0]和isPrime[1]的值为false，并设置其余的元素初值为true。 然后对从4到n－1的每一个i，判断i是否能够被2整除，如果i能够被2整除，则设置isPrime[i]为false。 对从2到n/2的每一个可能的数值重复以上处理，当操作结束时，所有值为true的isPrime[i]所对应的i就是素数，它们将是从筛子中掉下来的。-Find prime numbers prepared by screening the function: void sieve (bool isPrime [], int n) which isPrime [] as a Boolean array, n is the size of the array. Because 2 is the first prime number, so set the isPrime [0], and isPrime [1] a value of false, and set the initial value of the remaining elements of true. And then from 4 to n-1 for each i, to determine whether i can be divisible by 2, if i can be divisible by 2, then set the isPrime [i] is false. From 2 to n/2 possible values for each one to repeat the above processing, when the operation ended, all the true value of the isPrime [i] corresponding to i is a prime number, they will be falling from the sieve in the past.