教你如何简单显示一章TIFF位图,分析的很透彻,很适合出学者.希望能给你带来帮助!...

稿件名称：用VC++编小游戏 稿件作者：李华英 程序名称：mgzy 运行环境：vc++6.0 注意事项： 1、 本程序用vc++6.0版本编成，用vc++6.0以上程序运行 2、 解压后直接运行mgzy.dsw程序； 3、 当屏幕被覆盖时，窗口中图象就会消失，手动刷新即可。-Article Name: used VC++ Series game releases Author:李华英Program Name: mgzy operating environment: vc++ 6.0 NOTES: 1, the procedures used vc++ 6.0 version compiled with vc++ 6.0 program to run more than 2, after extracting a direct run mgzy.dsw procedure 3, when the screen is overwritten, the image window will disappear, you can manually refresh.

斜视角示例源代码，2DRPG游戏采用斜视角地图方式的实现-squint example source code, using game footage squint map the way to achieve

该文件是教你如何从根目录中找到你要删除的文件夹.-the document is to teach you how to find the root directory you want to delete the folder.

7 segment display for spartan3 vhdl code

使用VB开发的一款忍者游戏 速度不错，游戏简单 可以用来参考学习-use VB one of the ninjas the game pretty good, simple games can be used to refer to learning

虚拟串口 驱动 需要转换卡 而且新开辟的要在串口附近-Virtual serial port driver required conversion to open up the card and want a new serial at the vicinity of

一个吃豆子游戏，很有趣。 可以学习到基本的游戏编程-a game, is very interesting. Learn the basic game programming

java 网络编程的源代码，学习socket编程和线程很有帮助-java network programming source code, learning socket programming and helpful threads

该程序以回溯算法为基础 完成后对算法的学习与设计有重要意义-back to the program algorithm based on the completion of the study and algorithm design significance

编写筛选查找素数函数： 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.