AcWing 3792. 质数问题 O(1)复杂度

0x3fffff

已于 2023-03-13 21:58:04 修改

阅读量82

点赞数 1

文章标签： c++ 算法图论 Powered by 金山文档

于 2023-03-13 21:54:00 首次发布

本文链接：https://blog.csdn.net/qq_19655605/article/details/129508200

版权

题目描述
给定两个整数 n 和 k，请你判断在 [2,n] 的范围内是否存在不少于 k个质数，满足可以表示为两个相邻质数与 1的和。
例如 19满足条件，因为 19=7+11+1。

输入格式
第一行包含整数 T，表示共有 T 组测试数据。
每组数据占一行，包含两个整数 n 和 k。
输出格式
每组数据输出占一行，如果存在不少于 k 个质数满足条件则输出 YES，否则输出 NO。
数据范围
1≤T≤30
2≤n≤1000
0≤k≤1000

输入样例：

输出样例：

YES
NO
YES
YES
YES

正经做法（bushi

先随便撸个代码获取全部答案

#include <iostream>
using namespace std;
const int MAXN = 10010;
int pri[MAXN], p[MAXN], pr[MAXN],ans[MAXN];
void ispir() {
    int cnt = 0;
    for (int i = 2; i < MAXN; i++)
    {
        if (!pri[i])
        {
            cnt++;
            pr[cnt] = i;
            p[i] = cnt;
            for (int j = i * 2; j < MAXN; j += i)
                pri[j] = 1;
        }
        else p[i] = cnt;
    }
}
int main() {
    ispir();
    int n;
    int a, k;
    for (int z = 0; z <= 1000; z++)
    {
        int cnt = 0;
        for (int i = 2; i <= z / 2; i++) {
            for (int j = i; j <= p[z]; j++)
                if (pr[i] + pr[i + 1] + 1 == pr[j])cnt++;
        }ans[z] = cnt;
    }

    for (int i = 0; i <= 1000; i++)
    {
        cout << ans[i] << ",";
    }

}

然后把输出的结果放到数组里，就得到了O(1)复杂度的答案 /doge

#include <iostream>
using namespace std;
int ans[1010] = {
    0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,1,1,2,2,2,2,2,2,2,2,2,2,2,2,3,3,3,3,3,3,4,4,4,4,4,4,5,5,5,5,5,5,5,5,5,5,6,6,6,6,6,6,6,6,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,7,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,8,9,9,9,9,9,9,9,9,9,9,9,9,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,10,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,11,12,12,12,12,12,12,12,12,12,12,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,13,14,14,14,14,14,14,14,14,14,14,14,14,15,15,15,15,15,15,15,15,15,15,15,15,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,16,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,17,18,18,18,18,18,18,18,18,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,19,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,20,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,21,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,22,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,23,24,24,24,24,24,24,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,25,26,26,26,26,26,26,26,26,26,26,26,26,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,27,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,28,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,29,30,30,30,30,30,30,30,30,30,30,30,30,30,30,30,30,30,30,31,31,31,31,31,31,31,31,31,31,31,31,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,32,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,33,34,34,34,34,34,34,34,34,34,34,34,34,34,34,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,35,36,36,36,36,36,36,36,36,36,36,36,36,36,36,36,36,36,36,37,37,37,37,37,37,37,37,37,37,37,37,37,37,37,37,37,37,37,37,37,37,37,37,38,38,38,38,38,38,38,38,38,38,38,38,38,38,38,38,38,38,38,38,38,38,38,38,38,38,38,38,38,38,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,39,40,40,40,40,40,40,40,40,40,40,40,40,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,41,42,42,42,42,42,42,42,42,42,42,42,42,42,42,42,42,42,42,42,42,43,43,43,43,43,43,43,43,43,43,43,43,43,43,43,43,43,43,43,43,43,43,43,43,44,44,44,44,44,44,44,44,44,44
};
int main() {
    int t, n, k;
    cin >> t;
    while (t--)
    {
        cin >> n >> k;
        if (ans[n] >= k)cout << "YES\n";
        else cout << "NO\n";
    }
}