文件名称:Rei07
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:18.94kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
求質數法
判斷n是否為質數 時,將n除以n以下的整數直至2為止,以觀察n能
除盡,這時如有被除盡的數,便被視為非質數而脫離出回圈。到了最後如無除盡的數,則此數即為質數。-Seeking qualitative method to determine whether the prime number n to determine whether the prime number n will be n divided by n integers until 2 the following date, in order to observe the n can be divisible, then if there were a number divisible, it is considered non-prime number and out of the loop. At the end of a few such as non-divisible, then the number is prime number.
判斷n是否為質數 時,將n除以n以下的整數直至2為止,以觀察n能
除盡,這時如有被除盡的數,便被視為非質數而脫離出回圈。到了最後如無除盡的數,則此數即為質數。-Seeking qualitative method to determine whether the prime number n to determine whether the prime number n will be n divided by n integers until 2 the following date, in order to observe the n can be divisible, then if there were a number divisible, it is considered non-prime number and out of the loop. At the end of a few such as non-divisible, then the number is prime number.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
Rei07.cpp
1-7厄拉多塞篩的求質數法.doc
1-7厄拉多塞篩的求質數法.doc
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.