section 1.5 sprime

最新推荐文章于 2022-07-14 11:02:22 发布

ColorlessBoy

最新推荐文章于 2022-07-14 11:02:22 发布

阅读量323

点赞数

分类专栏：程序设计 USACO C++ 文章标签： C++

本文链接：https://blog.csdn.net/qq_32959583/article/details/51863626

版权

USACO 同时被 3 个专栏收录

5 篇文章 0 订阅

订阅专栏

C++

5 篇文章 0 订阅

订阅专栏

程序设计

4 篇文章 0 订阅

订阅专栏

这篇博客介绍了C++在section 1.5 sprime问题上的解决方法，内容与section 1.5 pprime相似。文章重点讨论了针对质数验证的两种情况，即当数值小于等于10000和大于等于10000时的不同处理策略。

摘要由CSDN通过智能技术生成

-这道题和section 1.5 pprime思路几乎一模一样
-质数验证函数分了两类，num<=10000和num>=10000

"YOUR PROGRAM ('sprime') WORKED FIRST TIME!  That's fantastic and a rare thing.  Please accept these special automated
congratulations."

/*
ID: penglin3
PROG: sprime
LANG: C++11
*/
#include <iostream>
#include <fstream>
#include <vector>
#include <math.h>
using namespace std;//fstream 需要std合法范围

bool bPrime[10001]{};
vector<int> viPrime{};
vector<long> answer{};

#define min(a , b) ((a < b) ? a : b)
//建质数表的函数,然后写入bPrime,vbPrime
void listPrime(bool *bPrime,vector<int> &viPrime, const int& maxnum);
//判断是否为素数
bool judgePrime(const bool *bPrime,const vector<int>&viPrime, const long& num);
//生成Superprime n当前位数，N总位数，sp是生成的数
void Superprime(const int& n, const int& N,const long sp, void f(long sp));
//处理superprime的函数；
void f(long sp);
int main() {
    ifstream fin("sprime.in");
    ofstream fout("sprime.out");

    int N;
    fin >> N;

    //处理
    listPrime(bPrime, viPrime, pow(10, min(4, N)));
    Superprime(1, N, 0, f);

    //输出
    for (auto &itan : answer)
        fout << itan << endl;

    fin.close();
    fout.close();
    return 0;
}

//建质数表的函数,数n:3,5,7...maxnum数组最大下标,然后写入vbPrime
void listPrime(bool *bPrime,vector<int> &viPrime, const int& maxnum) {
    bPrime[0] = true;
    bPrime[1] = true;

    for (int i = 4; i <= maxnum; i += 2 ) {
        bPrime[i] = true;
    }
    int n = 3;

    while (n * n < maxnum) {
        for (int i = n * n; i <= maxnum; i += n) {
                bPrime[i] = true;
            }
        do//这里必须用do-while
            n += 2;
        while (n * n < maxnum && bPrime[n]);
    }

    for (int i = 2; i <= maxnum; ++i)
        if (i % 2 && !bPrime[i]) viPrime.push_back(i);

    return;
}
/*---------------------------------------------------------*/
//判断是否为素数
bool judgePrime(const bool *bPrime,const vector<int>&viPrime, const long& num) {
    if (num <= 10000) {
        return !(bPrime[num]);
    }
    else {
        for (int i = 0; i != viPrime.size(); ++i) {
            if (viPrime[i] > sqrt(num)) break;
            else if (!(num % viPrime[i]))return false;
        }
        return true;
    }
}
/*---------------------------------------------------------*/
//生成Superprime n当前位数，N总位数，sp是生成的数
void Superprime(const int& n,const int& N, const long sp, void f(long sp)) {
    if (n == 1) {
        int i = 2;
        Superprime(n + 1, N, i, f);
        for (i = 3; i <= 7; i += 2) {
            Superprime(n + 1, N, i, f);
        }
    }

    else if (n <= N) {
        long sp2 = 0;
        for (int i = 1; i <= 9; i += 2) {
            sp2 = i + sp*10;
            if (judgePrime(bPrime, viPrime, sp2)) Superprime(n + 1, N, sp2, f);
        }
    }
    else {
        f(sp);
    }
    return;
}
//处理superprime的函数；
void f(long sp) {
    answer.push_back(sp);
}