编程训练求素数

最新推荐文章于 2024-09-16 16:16:58 发布

hiphopmattshi

最新推荐文章于 2024-09-16 16:16:58 发布

阅读量1k

点赞数

分类专栏：算法学习文章标签：编程 output numbers input function less

本文链接：https://blog.csdn.net/hiphopmattshi/article/details/8006932

版权

算法学习专栏收录该内容

104 篇文章 1 订阅

订阅专栏

Complete the function getNumberOfPrimes which takes in an integer N as its parameter,

to return the number of prime numbers that are less than N

Sample Testcases:

Input #00:

100

Output #00:

Input #01:

1000000

Output #01:

78498

int getNumberOfPrimes(int N) {

    int i=0;
    int total =0;
    int j,k;
    for(i=2;i<=N;i++)
    {
        if(i==2 ||i==3||i==5||i==7)
        {
             total++;
            continue;
        }
       j=sqrt(i);
        for(k=2;k<=j;k++)
        {
            if(i%k==0)
                break;
        }
        if(k>j)
            total++;
    }
    return total;

}

testcase: