Baodian windows core programming, classic classic, a master must learn the

整站程序,下载网站 flash版-entire stations, flash version download site

月分查询并将查询到的月份用英文显示.可以帮助你快速找到相应月份对应的英文.-Months of inquiries and queries to show the month in English. I can help you quickly find the corresponding month of the corresponding English.

编译原理转四元式-compiler theory to 4 yuan-

本程序可以实现高斯―克吕格投影不同分带坐标的相互转换，经纬度转换为坐标，并可以求取求任一点所在国家标准图幅编号，同时显示所在1：50000地形图地形等级及地区调整系数（大调查经费预算用）。-KLOMHH KKAJ

主要是虚拟仪器用户面板登入，操作简单，界面友好。-Virtual instrument panel is mainly a user login, simple operation and friendly interface.

找工作的朋友可以 看看，这里是一些IT 企业面试时候用的面试题目-Looking for work friends can see, here are some IT companies with the interview when the interview subject

T112 MCU源程码,用于T112外接MCU篇程,用来驱动模拟屏-Cheng T112 MCU source code for external MCU Part T112-way, used to drive simulation screen

dfs 深度优先搜索！这是走迷宫的基本算法。用广义表建立迷宫，用邻接表建立图，用dfs搜索，许多大学的数据结构作业-dfs depth-first search! Maze This is the basic algorithm. Generalized Table established maze, with the establishment of the adjacent table map, with dfs search, the University of many data structures operations

this ian queue.c file

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