結果
問題 | No.843 Triple Primes |
ユーザー |
![]() |
提出日時 | 2019-06-28 22:16:23 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 3 ms / 2,000 ms |
コード長 | 3,784 bytes |
コンパイル時間 | 594 ms |
コンパイル使用メモリ | 73,028 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-09-19 14:02:41 |
合計ジャッジ時間 | 1,555 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 42 |
ソースコード
//#define NDEBUG#include <cstddef>#include <cstdint>#include <vector>namespace n91 {using i8 = std::int_fast8_t;using i32 = std::int_fast32_t;using i64 = std::int_fast64_t;using u8 = std::uint_fast8_t;using u32 = std::uint_fast32_t;using u64 = std::uint_fast64_t;using isize = std::ptrdiff_t;using usize = std::size_t;constexpr usize operator"" _z(unsigned long long x) noexcept {return static_cast<usize>(x);}class rep {const usize f, l;public:class itr {friend rep;usize i;constexpr itr(const usize x) noexcept : i(x) {}public:void operator++() noexcept { ++i; }constexpr usize operator*() const noexcept { return i; }constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }};constexpr rep(const usize first, const usize last) noexcept: f(first), l(last) {}constexpr itr begin() const noexcept { return itr(f); }constexpr itr end() const noexcept { return itr(l); }};class revrep {const usize f, l;public:class itr {friend revrep;usize i;constexpr itr(usize x) noexcept : i(x) {}public:void operator++() noexcept { --i; }constexpr usize operator*() const noexcept { return i; }constexpr bool operator!=(const itr x) const noexcept { return i != x.i; }};constexpr revrep(usize first, usize last) noexcept : f(--first), l(--last) {}constexpr itr begin() const noexcept { return itr(l); }constexpr itr end() const noexcept { return itr(f); }};template <class T> using vec_alias = std::vector<T>;template <class T> auto md_vec(const usize n, const T &value) {return std::vector<T>(n, value);}template <class... Args> auto md_vec(const usize n, Args... args) {return std::vector<decltype(md_vec(args...))>(n, md_vec(args...));}template <class T> constexpr T difference(const T &a, const T &b) {return a < b ? b - a : a - b;}} // namespace n91#include <cstdint>#include <limits>#include <vector>class eratosthenes {using field_type = std::uint_fast64_t;public:using container_type = std::vector<field_type>;using size_type = typename container_type::size_type;protected:static constexpr size_type WordSize =static_cast<size_type>(std::numeric_limits<field_type>::digits);container_type c;public:eratosthenes() noexcept : c() {}explicit eratosthenes(const size_type max): c(max / WordSize + static_cast<size_type>(1),~static_cast<field_type>(0)) {c[static_cast<size_type>(0)] &= ~static_cast<field_type>(3);for (size_type i = static_cast<size_type>(2); i * i <= max; ++i) {if ((c[i / WordSize] & static_cast<field_type>(1) << i % WordSize) !=static_cast<field_type>(0)) {for (size_type j = i * i; j <= max; j += i) {c[j / WordSize] &= ~(static_cast<field_type>(1) << j % WordSize);}}}}bool test(const size_type i) const noexcept {return (c[i / WordSize] & static_cast<field_type>(1) << i % WordSize) !=static_cast<field_type>(0);}bool operator[](const size_type i) const noexcept {return (c[i / WordSize] & static_cast<field_type>(1) << i % WordSize) !=static_cast<field_type>(0);}};#include <algorithm>#include <iostream>#include <utility>namespace n91 {void main_() {usize n;std::cin >> n;if (n < 2_z) {std::cout << 0 << std::endl;return;}const auto sieve = eratosthenes(n);u32 ans = static_cast<u32>(0);for (usize r = 2_z; r * r <= n + 2_z; ++r) {if (!sieve[r]) {continue;}if (sieve[r * r - 2_z]) {++ans;}}std::cout << ans * static_cast<u32>(2) - static_cast<u32>(1) << std::endl;}} // namespace n91int main() {n91::main_();return 0;}