时间复杂度
  • 板块灌水区
  • 楼主jimmyshi29
  • 当前回复2
  • 已保存回复2
  • 发布时间2021/7/8 22:08
  • 上次更新2023/11/4 18:22:04
查看原帖
时间复杂度
225837
jimmyshi29楼主2021/7/8 22:08
# include <algorithm>
# include <iostream>
# include <cstring>
using namespace std;

int l[100005], r[100005], sum[5000010];
bool a[10000010];

int main()
{
	int n, l, r;
	memset(a, true, sizeof(a));
	a[1] = 0;
	a[0] = 0;
	for (int i = 2; i < 5000010; i++)
	{
		if (a[i])
		{
			for (int j = 2 * i; j < 5000010; j += i)
			{
				a[j] = false;
			}
		}
	}
	for (int i = 2; i < 5000010; i++)
	{
		if (a[i])
			sum[i] = sum[i - 1] + 1;
		else
			sum[i] = sum[i - 1];
	}
	cin >> n;
	for (int i = 1; i <= n; i++)
	{

		cin >> l >> r;
		cout << sum[r] - sum[l - 1] << endl;
	}
	return 0;
}

哪位大佬能帮我算算时间复杂度

2021/7/8 22:08
加载中...