长沙站G题

#include<iostream>
#include<cstdio>
#include<list>
#include<algorithm>
#include<cstring>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<vector>
#include<cmath>
#include<memory.h>

#define ll long long
#define LL __int64

using namespace std;

vector<int>G[100002];

const int MAXN = 80000;
const int MOD = 1000000007;
int okp[MAXN + 5], pr[MAXN + 5], tp = 0;
int g2[MAXN + 5], g3[MAXN + 5];
void Su() {
	okp[0] = okp[1] = 1;
	for (int i = 2; i <= MAXN; ++i) {
		if (!okp[i]) {
			pr[tp ++] = i;
			for (int j = i + i; j <= MAXN; j += i)
				okp[j] = 1;
		}
	}
	pr[tp] = MAXN + 1;
	for (int i = 0; i < tp; ++i) {
		for (int j = i; pr[i] + pr[j] <= MAXN; ++j)
			g2[pr[i] + pr[j]] ++;
		if (i >= 60) continue;
		for (int j = i; pr[i] * pr[j] <= MAXN; ++j) 
			g3[pr[i] * pr[j]] ++;
	}
}
int gao1(int X) {
	int ans = 0;
	if (!okp[X]) 
		ans ++;

	if (X % 2 == 0) {
		ans += g2[X - 2] + g3[X / 2];
	} else {
		for (int i = 0; pr[i] * 3 <= X; ++i) {
			for (int j = i; pr[i] + pr[j] + pr[j] <= X; ++j) {
				if (!okp[X - pr[i] - pr[j]])
					ans ++;
			}
		}

		for (int i = 0; pr[i] * pr[i] <= X; ++i) {
			for (int j = i; pr[i] * pr[j] <= X; ++j) {
				if (X % (pr[i] * pr[j]) == 0) {
					int t = X / (pr[i] * pr[j]);
					if (t >= pr[j] && !okp[t])
						ans ++;
				}
			}
		}
	}

	ans += g2[X] + g3[X];
	ans %= MOD;
	for (int i = 0; pr[i] <= X; ++i) {
		ans += g3[X - pr[i]];
		if (ans >= MOD) ans -= MOD;
	}

	return ans;
}
int main() {
	Su();
	int X;
	while (scanf("%d", &X) != EOF) {
		printf("%d\n", gao1(X));
	}
	return 0;
}