DSP LF2407A 板上存储器例程　已跑通了

一些不错的ICO图标，可以看一下啦！ 一些不错的ICO图标，可以看一下啦！-Some good ICO icon, you can look at you! Some good ICO icon, you can look at you!

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

一个小型的图书管理系统,挺好的哟,大家可以看一下,多提宝贵意见-a small library management system, Holbrook yo, we can look at, the more valuable advice

时间函数举例4,一个猜数游戏，判断一个人反应快慢。（版主初学时编的）-Function of time, for example 4, a guess the number of games, judge a person reaction speed. (Moderators when beginner series)

c语言程序 计算机等级考试的一部分程序-computer grade examination procedures part of the

EZW编解码的实现-EZW the realization codecs

inter电脑主板电路原理图，私家收藏网上是找不到的！-inter computer motherboard circuit diagram, private collections are not to be found online!

Wave Digital Filtering Using the MSP430 -Wave Digital Filtering Using the MSP430

自动化领域的软件标准通讯接口OPC的封装，可以通过改类快速建立与OPC Server的通讯。该类目前支持2.0-automation software standard communication interface OPC package, can be reclassified with the rapid establishment of OPC Server communications. Such currently supports 2.0

邮票问题:设一国家发行n种不同面值的邮票，并且每封信至多允许贴m张邮票，对于给定的m,n值，写一个算法求出从邮资1开始在增量为一的情况下可能获得的邮资值的最大连续区域以及获得这个区域的各种可能面值的集合。如，当 n=4,m=5,若有面值为（1，4，12，21）的四种邮票，则邮资最大的连续区域为1到71。还有其他面值的四种邮票可组成同样大小的区域吗-stamp issue : Let a national issue n different denominations of the stamps and letters each allow up to m stamp affixed, to the m, n, write an algorithm derived from a postage in an increment of the circumstances, may obtain a postage value of the maximum continuous access to this region and regional various denominations could assemble. For example, when n = 4, m = 5, if the values of (1,4,12,21) of the four stamps, postage largest regional consecutive 1-71. There are four other denominations of the stamps can be the same size as the composition of the region? ?