Meisell-Rabin米勒拉宾筛质数选法

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>

int prime(int n)
{
    int i, j;
    int count = 0;/**16以内有10个合数**/
    char* flag = (char*)malloc( n+1 );  // 分配素数标记空间，+1，因为浪费了一个flag[0]

    int mpLen = 2*3*5*7*11*13;
    char magicPattern[2*3*5*7*11*13];
    for (i=0; i<mpLen; i++)
    {
        magicPattern[i++] = 1;
        magicPattern[i++] = 0;
        magicPattern[i++] = 0;
        magicPattern[i++] = 0;
        magicPattern[i++] = 1;
        magicPattern[i] = 0;
    }
    for (i=4; i<=mpLen; i+=5)
        magicPattern[i] = 0;
    for (i=6; i<=mpLen; i+=7)
        magicPattern[i] = 0;
    for (i=10; i<=mpLen; i+=11)
        magicPattern[i] = 0;
    for (i=12; i<=mpLen; i+=13)
        magicPattern[i] = 0;            // 新的初始化方法,将2,3,5,7,11,13的倍数全干掉

    int remainder = n%mpLen;
    char* p = flag+1;
    char* pstop = p+n-remainder;
    while (p < pstop)
    {
        memcpy(p, magicPattern, mpLen);
        p += mpLen;
    }
    if (remainder > 0)
        memcpy(p, magicPattern, remainder);
                                        // 从17开始filter，因为2,3,5,7,11,13的倍数早被kill了
    flag[2] = flag[3] = flag[5] = flag[7] = flag[11] = flag[13] = 1;

    int stop = n/13;                    // 到n/13止的
    for (i=17; i <= stop; i+=2)
    {
        if (0 == flag[i])               // i是合数，用i的质因子代劳了
            continue;

        int step = i*2;                 // 执行到这里，说明i是质数，并且把i的倍数全都kill。
        for (j=i*17; j <= n; j+=step)
            flag[j] = 0;
    }

    for (i=2; i<=n; i++)                // 统计素数个数
        if (flag[i]) count++;

    free(flag);                         //时刻小心有没有申请过就没有再管理

    return count;
}

int main()
{
    int N=1000000000;
    clock_t before,after;

    printf("别动，请耐性等待程序执行...\n");
    before=clock();
    int prime_num=prime(N);
    after=clock();
    printf("%d 以内一共有 %d 个质数。\n计算用时为 %d 毫秒。\n",N,prime_num,after-before);

    return 0;
}