//统计[1,100]之间的素数个数,并求和
#include <stdio.h>
#include <math.h>
#include <stdbool.h>
bool isPrime(int );
int main()
{
    int num;
    // scanf("%d", &num);
    int sum, i;
    sum = i = 0;
    for (num = 1; num <= 100; ++num)
    {
        if (isPrime(num))
        {
            i++;
            sum += num;
        }
    }
    printf("there are %d prime between 1 and 100; and the sum is %d\n", i, sum);
}

bool isPrime(int num)
{
    int n = (int) sqrt(num);
    int i;
    for (i = 2; i <= n; ++i)
    {
        if (num % i == 0)
            break;
    }
    if (i > n && num != 1)
        return true;
    else
        return false;
}

 

相关文章:

  • 2021-11-18
  • 2021-07-07
  • 2021-10-19
  • 2021-09-10
  • 2021-10-31
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
猜你喜欢
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
相关资源
相似解决方案