C++求质数表

//输入一个数,求它以内的质数并输出,用空格隔开

#include<bits/stdc++.h>

using namespace std;

int main()

{

    int n,l;

    cin>>n;

    bool prime[n+1];

    memset(prime,0,sizeof(prime));

    for(int i=2;i<=n;i++)

    {

        if(prime[i]==0)

        {

            l=i;

            cout<<i<<" ";

            while(l+i<=n)

            {

                l+=i;

                prime[l]=1;

            }

        }

    }

    return 0;

}

猜你喜欢

转载自blog.csdn.net/csdn_3011692917/article/details/79678256