#include <stdio.h>
#include <stdlib.h>
int get_prime_number(unsigned long);
int main(void)
{
unsigned long number, i, count;
printf("Please enter a number:\n");
scanf("%lu", &number);
if(1 > number && COUNTS < number){
fprintf(stderr, "Out of range!\n");
exit(1);
}
for(i = 2, count = 0; i < number; i++)
count += get_prime_number(i);
printf("\nprime number: %lu\n", count);
return 0;
}
int get_prime_number(unsigned long a)
#include <stdlib.h>
#define COUNTS 4294967295
/*******************************************************
Author:Stat&陈
*******************************************************/
int get_prime_number(unsigned long);
int main(void)
{
unsigned long number, i, count;
printf("Please enter a number:\n");
scanf("%lu", &number);
if(1 > number && COUNTS < number){
fprintf(stderr, "Out of range!\n");
exit(1);
}
for(i = 2, count = 0; i < number; i++)
count += get_prime_number(i);
printf("\nprime number: %lu\n", count);
return 0;
}
int get_prime_number(unsigned long a)
C语言实现:找出不超过N的所有素数

本文介绍了一种使用C语言的方法,详细展示了如何编写代码来列举所有小于或等于给定整数N的素数。通过作者Stat&陈的分享,读者可以学习到素数判断和遍历的技巧。
最低0.47元/天 解锁文章
3045

被折叠的 条评论
为什么被折叠?



