hdu 2138

最新推荐文章于 2023-08-03 10:52:13 发布

ysc504

最新推荐文章于 2023-08-03 10:52:13 发布

阅读量598

点赞数

CC 4.0 BY-SA版权

分类专栏： hdu ACM基础题

本文链接：https://blog.csdn.net/ysc504/article/details/8500500

hdu ACM基础题专栏收录该内容

220 篇文章

订阅专栏

本文介绍了一道关于计算素数数量的程序设计题目，主要内容包括问题描述、输入输出样例及C语言实现代码。该题需要判断一系列正整数中素数的数量，并通过sqrt函数优化了素数判断效率。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

How many prime numbers

Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 7656 Accepted Submission(s): 2563

Problem Description

Give you a lot of positive integers, just to find out how many prime numbers there are.

Input

There are a lot of cases. In each case, there is an integer N representing the number of integers to find. Each integer won’t exceed 32-bit signed integer, and each of them won’t be less than 2.

Output

For each case, print the number of prime numbers you have found out.

Sample Input

  
   3
2 3 4

Sample Output

Author

wangye

Source

HDU 2007-11 Programming Contest_WarmUp

Recommend

威士忌

#include <stdio.h>
#include <math.h>
int isPrime(int n)
{
	int i, l = sqrt(n);
	for(i = 2; i <= l; i++)
		if(n % i == 0)
			return 0;
	return 1;
}
int main()
{
	int n, num, acount;
	while(~scanf("%d", &n))
	{
		acount = 0;
		while(n--)
		{
			scanf("%d", &num);
			if(isPrime(num))
				acount++;
		}
		printf("%d\n", acount);
	}
	return 0;
}