登录

于 2022-01-31 发布 文件大小:31.93 kB
0 64
下载积分: 2 下载次数: 1

代码说明:

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • controls name : Date Controls
    控件名称:日期控件-controls name : Date Controls
    2022-03-06 03:02:20下载
    积分:1
  • php platform of a revenue ajax relatively new framework ........
    php平台上的一个开源ajax框架........比较新-php platform of a revenue ajax relatively new framework ........
    2023-03-22 01:40:04下载
    积分:1
  • 本程序是用VC writennt
    本程序是用VC编写的中国象棋的源程序 可以人机博弈 看看你的水平怎么样咯-THIS PROGAME IS WRITENNT BY VC
    2022-03-15 23:04:05下载
    积分:1
  • 经典的坦克大战小游戏,VC编写的,很难得哦!
    经典的坦克大战小游戏,VC编写的,很难得哦!-Tankedaizhan classic game, VC prepared, it is difficult to get Oh!
    2023-06-17 19:00:06下载
    积分:1
  • C游戏代码(机器人大战)
    C游戏代码(机器人大战)-C game code (Robot Wars)
    2022-08-12 17:29:30下载
    积分:1
  • 2022-12-30 12:05:04下载
    积分:1
  • Ajax技术实现一个简单的PHP聊天室服务器MySQL数据库
    Ajax 技术实现的简单聊天室 php服务端 MySQL数据库-Ajax technology to achieve a simple php chat room server MySQL database
    2023-01-03 10:25:04下载
    积分:1
  • rescue elf, leisure games, a girlfriend of attention, particularly for girls to...
    拯救小精灵,休闲游戏,有女朋友的注意了,特别适合女孩子玩,全屏游戏,下载后直接把后缀改为jar即可-rescue elf, leisure games, a girlfriend of attention, particularly for girls to play, full-screen games, After downloading directly to the suffix can jar
    2023-06-12 05:40:03下载
    积分:1
  • Find prime numbers prepared by screening the function: void sieve (bool isPrime...
    编写筛选查找素数函数: 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.
    2023-03-02 04:45:03下载
    积分:1
  • 行业标准,802.16的空中接口,非常详细
    行业标准,802.16的空中接口,非常详细-industry standards, 802.16 air interface, very detailed
    2022-02-26 09:43:14下载
    积分:1
  • 696524资源总数
  • 103930会员总数
  • 47今日下载