学生成绩管理系统

无线接收模块c语言源程序 调试有效 C51-RF1903-C51-RF1903-jieshou

电影类型的好网站-good film types of websites

自助友情链接系统 1、实现自动链接页面PR值检测、Alexa世界排名检测。 2、实现无人职守，24小时即时完成链接交换 3、自主管理、添加、删除、推荐等级等管理动作。 4、使用ASP.NET 2.0核心，安全高效！ 5、标签模版化页面设置，你可以随意修改自己喜欢的风格！-self-Links a system for automatic link pages PR detection, detection Alexa ranking in the world. 2, unattended, 24 hours instead of three link exchange, self-management, add, delete, recommended management actions, such as grading. 4, the use of ASP.NET 2.0 core, safe and efficient! 5, labeling template set of pages, you can be amended at their favorite style!

计算1到10以内的任意数（整数）的任意次幂-Of 1 to 10 within the calculation of an arbitrary number (integer) power of an arbitrary

无网格伽辽金法中用到的数值积分，此程序，提供多点高斯积分，可任意选择！-element-free Galerkin method used in the numerical integration of this process, provide more Gaussian integral, can be arbitrary choice.

注册表操作源代码-registry operated source code

切面图的fortran程序 大家随意-Section map we can look at the fortran program

北京浮生记，策略游戏，还记得记得以前电脑上风靡一时的这个游戏吗？，全屏游戏，下载后直接把后缀改为jar即可-Beijing Sentimental Journey mind, strategy games, I still remember the recall of a computer game that was all the rage? , Full-screen games, downloading directly to the suffix can jar

扫雷游戏先说下原理，原理其实很简单，设法获得“雷区”的数据，然后通过模拟鼠标动作，点击雷区上非地雷的的格子，就搞定了:) 所以技术难点只有三个：获得雷区数据、找到扫雷程序和模拟鼠标动作。 -game

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