//find primes [0,n], and output to primes[]
unsigned int findPrime(const unsigned int n, unsigned int * primes)
{
if(n < 2)
return 0;
long long i,j,k;
bool * isPrimes = 0;
isPrimes = malloc((n+1)*sizeof(bool));
if (isPrimes == 0)
return -1;
memset(isPrimes, 0, sizeof(bool) * (n+1));
for (i=2,j=0; i<=n; i++)
{
if (isPri
unsigned int findPrime(const unsigned int n, unsigned int * primes)
{
if(n < 2)
return 0;
long long i,j,k;
bool * isPrimes = 0;
isPrimes = malloc((n+1)*sizeof(bool));
if (isPrimes == 0)
return -1;
memset(isPrimes, 0, sizeof(bool) * (n+1));
for (i=2,j=0; i<=n; i++)
{
if (isPri
最低0.47元/天 解锁文章
1180
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
