C++检索小于k的所有素数

#include <bits/stdc++.h>

using namespace std;

void main()
{
	int i, j;
	for (i = 2; i < 100;i++) {
		for (j = 2; j <= (int)sqrt(i); ++j) if (i % j == 0)break;
		if (j >= (int)sqrt(i) + 1)cout << i << endl;
	}
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
小于等于k的素数个数的问题的测试源代码 测试大数据量时, 内存频繁分配所消耗的时间占非常大的比例, 使用大内存优化后的测试结果: -------------------------------------------------------------------------------- 11:34:52.796 -> begin CalcPrimeCount(100000000) 11:40:49.687 -> end CalcPrimeCount(100000000) {return: 5761455, used-ticks: 356890} -------------------------------------------------------------------------------- 11:40:49.687 -> begin CalcPrimeCount(200000000) 11:50:09.375 -> end CalcPrimeCount(200000000) {return: 11078937, used-ticks: 559688} -------------------------------------------------------------------------------- 11:50:09.375 -> begin CalcPrimeCount(10000) 11:50:09.375 -> end CalcPrimeCount(10000) {return: 1229, used-ticks: 0} -------------------------------------------------------------------------------- 11:50:09.375 -> begin CalcPrimeCount(65536) 11:50:09.375 -> end CalcPrimeCount(65536) {return: 6542, used-ticks: 0} -------------------------------------------------------------------------------- 11:50:09.375 -> begin CalcPrimeCount(100000) 11:50:09.375 -> end CalcPrimeCount(100000) {return: 9592, used-ticks: 0} -------------------------------------------------------------------------------- 11:50:09.375 -> begin CalcPrimeCount(500000) 11:50:09.375 -> end CalcPrimeCount(500000) {return: 41538, used-ticks: 0} -------------------------------------------------------------------------------- 11:50:09.375 -> begin CalcPrimeCount(1000000) 11:50:09.375 -> end CalcPrimeCount(1000000) {return: 78498, used-ticks: 0} -------------------------------------------------------------------------------- 11:50:09.375 -> begin CalcPrimeCount(5000000) 11:50:09.375 -> end CalcPrimeCount(5000000) {return: 348513, used-ticks: 0} -------------------------------------------------------------------------------- 11:50:09.375 -> begin CalcPrimeCount(10000000) 11:50:09.375 -> end CalcPrimeCount(10000000) {return: 664579, used-ticks: 0} -------------------------------------------------------------------------------- 11:50:09.375 -> begin CalcPrimeCount(50000000) 11:50:09.375 -> end CalcPrimeCount(50000000) {return: 3001134, used-ticks: 0} -------------------------------------------------------------------------------- 11:50:09.375 -> begin CalcPrimeCount(130000000) 11:50:09.375 -> end CalcPrimeCount(130000000) {return: 7378187, used-ticks: 0} -------------------------------------------------------------------------------- 11:50:09.375 -> begin CalcPrimeCount(150000000) 11:50:09.375 -> end CalcPrimeCount(150000000) {return: 8444396, used-ticks: 0} -------------------------------------------------------------------------------- 11:50:09.375 -> begin CalcPrimeCount(160000000) 11:50:09.375 -> end CalcPrimeCount(160000000) {return: 8974458, used-ticks: 0} -------------------------------------------------------------------------------- 11:50:09.375 -> begin CalcPrimeCount(190000000) 11:50:09.375 -> end CalcPrimeCount(190000000) {return: 10555473, used-ticks: 0} -------------------------------------------------------------------------------- 11:50:09.375 -> begin CalcPrimeCount(180000000) 11:50:09.375 -> end CalcPrimeCount(180000000) {return: 10030385, used-ticks: 0} --------------------------------------------------------------------------------

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值