#300625 (C++11) No.732 3PrimeCounting

• 問題: No.732 3PrimeCounting
• ユーザー: tancahn2380
• 提出日時: 2018-12-01 22:03:25
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 449 ms / 3,000 ms
• コード長: 2,161 bytes
• コンパイル時間: 1,241 ms
• コンパイル使用メモリ: 147,820 KB
• 実行使用メモリ: 4,380 KB
• 最終ジャッジ日時: 2023-09-09 06:55:17
• 合計ジャッジ時間: 20,308 ms
• ジャッジサーバーID （参考情報）: judge13 / judge14

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	119 ms; 4,376 KB
testcase_01	AC	119 ms; 4,376 KB
testcase_02	AC	119 ms; 4,380 KB
testcase_03	AC	119 ms; 4,380 KB
testcase_04	AC	119 ms; 4,380 KB
testcase_05	AC	119 ms; 4,380 KB
testcase_06	AC	119 ms; 4,376 KB
testcase_07	AC	119 ms; 4,376 KB
testcase_08	AC	119 ms; 4,380 KB
testcase_09	AC	119 ms; 4,376 KB
testcase_10	AC	119 ms; 4,380 KB
testcase_11	AC	118 ms; 4,376 KB
testcase_12	AC	119 ms; 4,380 KB
testcase_13	AC	119 ms; 4,376 KB
testcase_14	AC	119 ms; 4,376 KB
testcase_15	AC	119 ms; 4,376 KB
testcase_16	AC	119 ms; 4,376 KB
testcase_17	AC	119 ms; 4,380 KB
testcase_18	AC	119 ms; 4,380 KB
testcase_19	AC	119 ms; 4,380 KB
testcase_20	AC	122 ms; 4,376 KB
testcase_21	AC	129 ms; 4,380 KB
testcase_22	AC	130 ms; 4,376 KB
testcase_23	AC	120 ms; 4,376 KB
testcase_24	AC	121 ms; 4,376 KB
testcase_25	AC	137 ms; 4,376 KB
testcase_26	AC	132 ms; 4,376 KB
testcase_27	AC	123 ms; 4,380 KB
testcase_28	AC	124 ms; 4,380 KB
testcase_29	AC	127 ms; 4,376 KB
testcase_30	AC	127 ms; 4,380 KB
testcase_31	AC	130 ms; 4,376 KB
testcase_32	AC	135 ms; 4,380 KB
testcase_33	AC	135 ms; 4,376 KB
testcase_34	AC	135 ms; 4,380 KB
testcase_35	AC	131 ms; 4,380 KB
testcase_36	AC	132 ms; 4,376 KB
testcase_37	AC	121 ms; 4,380 KB
testcase_38	AC	121 ms; 4,376 KB
testcase_39	AC	132 ms; 4,376 KB
testcase_40	AC	131 ms; 4,380 KB
testcase_41	AC	131 ms; 4,376 KB
testcase_42	AC	129 ms; 4,376 KB
testcase_43	AC	128 ms; 4,376 KB
testcase_44	AC	128 ms; 4,376 KB
testcase_45	AC	124 ms; 4,376 KB
testcase_46	AC	125 ms; 4,376 KB
testcase_47	AC	125 ms; 4,380 KB
testcase_48	AC	138 ms; 4,380 KB
testcase_49	AC	138 ms; 4,376 KB
testcase_50	AC	130 ms; 4,380 KB
testcase_51	AC	129 ms; 4,380 KB
testcase_52	AC	124 ms; 4,376 KB
testcase_53	AC	156 ms; 4,376 KB
testcase_54	AC	299 ms; 4,376 KB
testcase_55	AC	298 ms; 4,376 KB
testcase_56	AC	299 ms; 4,376 KB
testcase_57	AC	190 ms; 4,380 KB
testcase_58	AC	190 ms; 4,376 KB
testcase_59	AC	158 ms; 4,380 KB
testcase_60	AC	208 ms; 4,380 KB
testcase_61	AC	209 ms; 4,380 KB
testcase_62	AC	329 ms; 4,380 KB
testcase_63	AC	249 ms; 4,380 KB
testcase_64	AC	223 ms; 4,376 KB
testcase_65	AC	223 ms; 4,380 KB
testcase_66	AC	119 ms; 4,376 KB
testcase_67	AC	120 ms; 4,380 KB
testcase_68	AC	312 ms; 4,376 KB
testcase_69	AC	313 ms; 4,376 KB
testcase_70	AC	300 ms; 4,380 KB
testcase_71	AC	301 ms; 4,380 KB
testcase_72	AC	243 ms; 4,376 KB
testcase_73	AC	395 ms; 4,380 KB
testcase_74	AC	395 ms; 4,380 KB
testcase_75	AC	137 ms; 4,380 KB
testcase_76	AC	310 ms; 4,376 KB
testcase_77	AC	193 ms; 4,380 KB
testcase_78	AC	358 ms; 4,380 KB
testcase_79	AC	314 ms; 4,376 KB
testcase_80	AC	342 ms; 4,376 KB
testcase_81	AC	302 ms; 4,376 KB
testcase_82	AC	123 ms; 4,376 KB
testcase_83	AC	192 ms; 4,376 KB
testcase_84	AC	196 ms; 4,376 KB
testcase_85	AC	285 ms; 4,380 KB
testcase_86	AC	348 ms; 4,376 KB
testcase_87	AC	449 ms; 4,380 KB
testcase_88	AC	449 ms; 4,380 KB

ソースコード

# include "bits/stdc++.h"
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const double PI = acos(-1);
template<class T>constexpr T INF() { return ::std::numeric_limits<T>::max(); }
template<class T>constexpr T HINF() { return INF<T>() / 2; }
template <typename T_char>T_char TL(T_char cX) { return tolower(cX); };
template <typename T_char>T_char TU(T_char cX) { return toupper(cX); };
const int vy[] = { -1, -1, -1, 0, 1, 1, 1, 0 }, vx[] = { -1, 0, 1, 1, 1, 0, -1, -1 };
const int dx[4] = { -1,0,1,0 }, dy[4] = { 0,-1,0,1 };
int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; }
int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; }
int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; }
LL gcd(LL a, LL b) { if (b == 0)return a; return gcd(b, a%b); };
LL lcm(LL a, LL b) { LL g = gcd(a, b); return a / g*b; };
# define ALL(qpqpq)           (qpqpq).begin(),(qpqpq).end()
# define UNIQUE(wpwpw)        (wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end())
# define LOWER(epepe)         transform(ALL((epepe)),(epepe).begin(),TL<char>)
# define UPPER(rprpr)         transform(ALL((rprpr)),(rprpr).begin(),TU<char>)
# define FOR(i,tptpt,ypypy)   for(LL i=(tptpt);i<(ypypy);i++)
# define REP(i,upupu)         FOR(i,0,upupu)
# define INIT                 std::ios::sync_with_stdio(false);std::cin.tie(0)
# pragma warning(disable:4996)

std::vector<int> prime;
void MakePrime(int n) {
	prime.emplace_back(2);
	for (int i = 3; i < n; i += 2) {
		bool a = false;
		for (int j = 3; j <= std::sqrt(i); j += 2) {
			if (i%j == 0) {
				a = true;
			}
		}
		if (a == false) {
			prime.emplace_back(i);
		}
	}
}

int n;
int cnt[303030];
int main() {
	int n;
	cin >> n;
	LL ans = 0;
	MakePrime(303030);
	for (int i = 1; i < prime.size(); i++) {
		int c = prime[i];
		if (c > n) break;
		int b = prime[i - 1];
		for (int j = 0; j < i - 1; j++) {
			int a = prime[j];
			cnt[a + b]++;
		}
		for (int j = 0; j < prime.size(); j++) {
			int sum = prime[j];
			if (sum - c >= 0) {
				ans += cnt[sum - c];
			}
		}
	}
	cout << ans << endl;
}