计算小于等于n的孪生素数的对数。平常所说的孪生素数是n,n+2,这两个数都是素数就成为孪生素数。这里定义n,n+1都是素数的话,也为孪生素数。
先素数筛法,再用ans数组保存,就做到了O(1)的询问。
代码如下:
/*************************************************************************
> File Name: 26.cpp
> Author: gwq
> Mail: gwq5210@qq.com
> Created Time: 2014年10月10日 星期五 22时14分38秒
************************************************************************/
#include <cmath>
#include <ctime>
#include <cctype>
#include <climits>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <vector>
#include <sstream>
#include <iostream>
#include <algorithm>
#define INF (INT_MAX / 10)
#define SQR(x) ((x) * (x))
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define repf(i, a, b) for (int i = (a); i <= (b); ++i)
#define repd(i, a, b) for (int i = (a); i >= (b); --i)
#define clr(arr, val) memset(arr, val, sizeof(arr))
#define pb push_back
#define sz(a) ((int)(a).size())
#define middle(x, y) ((x + y) >> 1)
using namespace std;
typedef set<int> si;
typedef vector<int> vi;
typedef map<int, int> mii;
typedef long long ll;
const double esp = 1e-5;
#define N 1000010
int isnpri[N], ans[N];
int main(int argc, char *argv[])
{
clr(ans, 0);
clr(isnpri, 0);
isnpri[0] = isnpri[1] = 1;
for (int i = 2; i * i < N; ++i) {
if (isnpri[i] == 0) {
for (int j = i * i; j < N; j += i) {
isnpri[j] = 1;
}
}
}
for (int i = 2; i < N; ++i) {
ans[i] += ans[i - 1];
if (isnpri[i] == 0 && isnpri[i - 1] == 0) {
++ans[i];
}
if (isnpri[i] == 0 && isnpri[i - 2] == 0) {
++ans[i];
}
}
int t;
scanf("%d", &t);
while (t--) {
int n;
scanf("%d", &n);
printf("%d\n", ans[n]);
}
return 0;
}