c_cpp 项目欧拉问题0060解决方案

Posted

tags:

篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了c_cpp 项目欧拉问题0060解决方案相关的知识，希望对你有一定的参考价值。

// need
#include <iostream>
#include <algorithm>

// data structure
#include <bitset>
//#include <list>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <array>
//#include <tuple>
//#include <unordered_map>
#include <unordered_set>
#include <complex>
//#include <deque>
#include<valarray>

// stream
//#include <istream>
//#include <sstream>
//#include <ostream>
#include <fstream>

// etc
#include <cmath>
#include <cassert>
#include <functional>
#include <iomanip>
//#include <typeinfo>
#include <chrono>
#include <random>
#include <numeric>


#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define VAR(type, ...)type __VA_ARGS__;MACRO_VAR_Scan(__VA_ARGS__);
template<typename T> void MACRO_VAR_Scan(T& t) { std::cin >> t; }
template<typename First, typename...Rest>void MACRO_VAR_Scan(First& first, Rest&...rest) { std::cin >> first; MACRO_VAR_Scan(rest...); }
#define VEC_ROW(type, n, ...)std::vector<type> __VA_ARGS__;MACRO_VEC_ROW_Init(n, __VA_ARGS__); for(int i=0; i<n; ++i){MACRO_VEC_ROW_Scan(i, __VA_ARGS__);}
template<typename T> void MACRO_VEC_ROW_Init(int n, T& t) { t.resize(n); }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Init(int n, First& first, Rest&...rest) { first.resize(n); MACRO_VEC_ROW_Init(n, rest...); }
template<typename T> void MACRO_VEC_ROW_Scan(int p, T& t) { std::cin >> t[p]; }
template<typename First, typename...Rest>void MACRO_VEC_ROW_Scan(int p, First& first, Rest&...rest) { std::cin >> first[p]; MACRO_VEC_ROW_Scan(p, rest...); }
#define OUT(d) std::cout<<d;
#define FOUT(n, d) std::cout<<std::fixed<<std::setprecision(n)<<d;
#define SOUT(n, c, d) std::cout<<std::setw(n)<<std::setfill(c)<<d;
#define SP std::cout<<" ";
#define TAB std::cout<<"\t";
#define BR std::cout<<"\n";
#define SPBR(i, n) std::cout<<(i + 1 == n ? '\n' : ' ');
#define ENDL std::cout<<std::endl;
#define FLUSH std::cout<<std::flush;
#define VEC(type, c, n) std::vector<type> c(n);for(auto& i:c)std::cin>>i;
#define MAT(type, c, m, n) std::vector<std::vector<type>> c(m, std::vector<type>(n));for(auto& r:c)for(auto& i:r)std::cin>>i;
#define ALL(a) (a).begin(),(a).end()
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n) for(int i=0;i<int(n);++i)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#define FORLL(i, a, b) for(ll i=ll(a);i<ll(b);++i)
#define RFORLL(i, a, b) for(ll i=ll(b)-1;i>=ll(a);--i)
#define REPLL(i, n) for(ll i=0;i<ll(n);++i)
#define RREPLL(i, n) for(ll i=ll(n)-1;i>=0;--i)
#define IN(a, x, b) (a<=x && x<b)
#define SHOW(d) {std::cerr << #d << "\t:" << d << "\n";}
#define SHOWVECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOWVECTOR2(v) {std::cerr << #v << "\t:\n";for(const auto& xxx : v){for(const auto& yyy : xxx){std::cerr << yyy << " ";}std::cerr << "\n";}}
#define SHOWQUEUE(a) {auto tmp(a);std::cerr << #a << "\t:";while(!tmp.empty()){std::cerr << tmp.front() << " ";tmp.pop();}std::cerr << "\n";}
template<typename T> inline T CHMAX(T& a, const T b) { return a = (a < b) ? b : a; }
template<typename T> inline T CHMIN(T& a, const T b) { return a = (a > b) ? b : a; }
#define EXCEPTION(msg) throw std::string("Exception : " msg " [ in ") + __func__ + " : " + std::to_string(__LINE__) + " lines ]"
#define TRY(cond, msg) try {if (cond) EXCEPTION(msg);}catch (std::string s) {std::cerr << s << std::endl;}
void CHECKTIME(std::function<void()> f) { auto start = std::chrono::system_clock::now(); f(); auto end = std::chrono::system_clock::now(); auto res = std::chrono::duration_cast<std::chrono::nanoseconds>((end - start)).count(); std::cerr << "[Time:" << res << "ns  (" << res / (1.0e9) << "s)]\n"; }

template<typename S, typename T>
std::ostream& operator<<(std::ostream& os, std::pair<S, T> p) {
	os << "(" << p.first << ", " << p.second << ")";
	return os;
}

#define int ll
using ll = long long;
using ull = unsigned long long;
using PAIR = std::pair<int, int>;
using PAIRLL = std::pair<ll, ll>;
constexpr int INFINT = 1 << 30;                          // 1.07x10^ 9
constexpr int INFINT_LIM = (1LL << 31) - 1;              // 2.15x10^ 9
constexpr ll INFLL = 1LL << 60;                          // 1.15x10^18
constexpr ll INFLL_LIM = (1LL << 62) - 1 + (1LL << 62);  // 9.22x10^18
constexpr double EPS = 1e-7;
constexpr int MOD = 1000000007;
constexpr double PI = 3.141592653589793238462643383279;

std::vector<int> Eratosthenes(int n) {
	std::vector<bool> num(n, true);
	std::vector<int> prime;
	num[0] = false;
	for (int i = 0; i*i < n; ++i) {
		if (num[i]) {
			for (int j = 2; (i + 1)*j <= n; ++j) {
				num[(i + 1)*j - 1] = false;
			}
		}
	}
	for (int i = 0; i < n; ++i) {
		if (num[i]) {
			prime.push_back(i + 1);
		}
	}
	return prime;
}

std::vector<int> pv;
bool isPrime(ll n) {
	return std::lower_bound(ALL(pv), n) != std::upper_bound(ALL(pv), n);
}

bool isPrime2(ll n) {
	if (n < 2) return false;
	for (ll i = 2; i * i <= n; ++i) {
		if (n % i == 0) return false;
	}
	return true;
}

signed main() {
	INIT;
	int N = 100000;
	pv = Eratosthenes(N);
	SHOW(pv.size());
	int n = pv.size();
	int sum = 0;
	FOR(i1, 1, n) FOR(i2, i1 + 1, n) {
		sum = pv[i1] + pv[i2];
		if (sum > N) continue;
		int t = std::stoll(std::to_string(pv[i1]) + std::to_string(pv[i2]));
		if (!isPrime(t)) continue;
		t = std::stoll(std::to_string(pv[i2]) + std::to_string(pv[i1]));
		if (!isPrime(t)) continue;
		std::vector<int> v({ pv[i1], pv[i2] });
		SHOWVECTOR(v);
		FOR(i3, i2 + 1, n) {
			if (sum + pv[i3] > N) break;
			bool f = true;
			REP(i, v.size()) {
				int t = std::stoll(std::to_string(v[i]) + std::to_string(pv[i3]));
				if (!isPrime2(t)) {
					f = false;
					break;
				}
				t = std::stoll(std::to_string(pv[i3]) + std::to_string(v[i]));
				if (!isPrime2(t)) {
					f = false;
					break;
				}
			}
			if (!f) continue;
			v.emplace_back(pv[i3]);
			SHOWVECTOR(v);
			sum += pv[i3];
			FOR(i4, i3 + 1, n) {
				if (sum + pv[i4] > N) break;
				bool f = true;
				REP(i, v.size()) {
					int t = std::stoll(std::to_string(v[i]) + std::to_string(pv[i4]));
					if (!isPrime2(t)) {
						f = false;
						break;
					}
					t = std::stoll(std::to_string(pv[i4]) + std::to_string(v[i]));
					if (!isPrime2(t)) {
						f = false;
						break;
					}
				}
				if (!f) continue;
				v.emplace_back(pv[i4]);
				SHOWVECTOR(v);
				sum += pv[i4];
				FOR(i5, i4 + 1, n) {
					if (sum + pv[i5] > N) break;
					bool f = true;
					REP(i, v.size()) {
						int t = std::stoll(std::to_string(v[i]) + std::to_string(pv[i5]));
						if (!isPrime2(t)) {
							f = false;
							break;
						}
						t = std::stoll(std::to_string(pv[i5]) + std::to_string(v[i]));
						if (!isPrime2(t)) {
							f = false;
							break;
						}
					}
					v.emplace_back(pv[i5]);
					if (f) {
						OUT("============== F O U N D =============")BR;
						SHOWVECTOR(v);
						OUT(sum + pv[i5])BR;
						OUT("======================================")ENDL;
						VAR(int, x);
						N = sum + pv[i5];
					}
					v.resize(v.size() - 1);
				}
				v.resize(v.size() - 1);
				sum -= pv[i4];
				OUT("-----")BR;
			}
			v.resize(v.size() - 1);
			sum -= pv[i3];
			OUT("-----")BR;
		}
		v.resize(v.size() - 1);
		OUT("-----")BR;
	}

	OUT("-- N O T   F O U N D --")BR;
	return 0;
}

以上是关于c_cpp 项目欧拉问题0060解决方案的主要内容，如果未能解决你的问题，请参考以下文章

c_cpp 项目欧拉问题0068解决方案

c_cpp 项目欧拉问题0062解决方案

c_cpp 项目欧拉问题0061解决方案

XEP-0060:pubsub 项目

c_cpp 从3D矢量的欧拉角度

c_cpp 从欧拉角到轴旋转