Print all prime numbers between 2 and some integer n 说明:本程序在vs.net2003下编译通过
#include<iostream>
#include<cmath>
using namespace std;
void primes(int);
int main()
{
int n;
cout<<"Please input a positive integer:";
cin>>n;
primes(n);
cout<<endl;
}
void primes(int n)
{
int *a=new int[n+1];
int i;
for(i=0;i<=n;i++)
a[i]=0;
int k=2,m,j;
while(k<sqrtl(n)){
if(a[k]!=1){
cout<<k<<'/t';
m=n/k;
for(j=1;j<=m;j++){
a[j*k]=1;
}
}
k++;
}
while(k<=n){
if(a[k]==0)
cout<<k<<'/t';
k++;
}
}