結果

問題 No.1747 Many Formulae 2
ユーザー popofypopofy
提出日時 2021-11-19 21:47:07
言語 C++17
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 2 ms / 2,000 ms
コード長 5,468 bytes
コンパイル時間 2,150 ms
コンパイル使用メモリ 202,832 KB
実行使用メモリ 4,380 KB
最終ジャッジ日時 2023-08-30 08:00:58
合計ジャッジ時間 3,064 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 1 ms
4,380 KB
testcase_04 AC 2 ms
4,380 KB
testcase_05 AC 1 ms
4,380 KB
testcase_06 AC 1 ms
4,380 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 2 ms
4,380 KB
testcase_09 AC 2 ms
4,380 KB
testcase_10 AC 1 ms
4,380 KB
testcase_11 AC 1 ms
4,380 KB
testcase_12 AC 1 ms
4,376 KB
testcase_13 AC 1 ms
4,380 KB
testcase_14 AC 1 ms
4,380 KB
testcase_15 AC 2 ms
4,380 KB
testcase_16 AC 1 ms
4,380 KB
testcase_17 AC 1 ms
4,380 KB
testcase_18 AC 2 ms
4,376 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
#define overload4(a, b, c, d, e, ...) e
#define rep1(a)          for(decltype(a) i = 0, i##_len = (a); i < i##_len; ++i)
#define rep2(i, a)       for(decltype(a) i = 0, i##_len = (a); i < i##_len; ++i)
#define rep3(i, a, b)    for(decltype(b) i = (a), i##_len = (b); i < i##_len; ++i)
#define rep4(i, a, b, c) for(decltype(b) i = (a), i##_len = (b); i < i##_len; i += (c))
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(a)          for(decltype(a) i = (a); i--;)
#define rrep2(i, a)       for(decltype(a) i = (a); i--;)
#define rrep3(i, a, b)    for(decltype(a) i = (b), i##_len = (a); i-- > i##_len;)
#define rrep4(i, a, b, c) for(decltype(a) i = (a)+((b)-(a)-1)/(c)*(c), i##_len = (a); i >= i##_len; i -= c)
#define rrep(...) overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define all(x)  (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(x)   ((int)(x).size())
#define yes(s)  cout << ((s)?"Yes":"No") << "\n";
#define bit(n)  (1LL << ((int)(n)))
#define get1bit(x,n) (((x) >> (int)(n)) & 1)
#ifdef __LOCAL
#define dump(...) cerr << "  " << string(#__VA_ARGS__) << ": " << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl << "    ", dump_func(__VA_ARGS__)
#else
#define dump(...)
#endif
using ll = long long; using ld = long double; template<class T> using V = vector<T>; template<class T> using VV = vector<vector<T>>; template<class T> using PQ = priority_queue<T,V<T>,greater<T>>;
template<class T> ostream &operator<<(ostream &os, const vector<T>& vec) {if (vec.empty()) return os << "{}";stringstream ss;os << "{";for (auto e : vec) ss << "," << e;os << ss.str().substr(1) << "}";return os;}
void dump_func(){cerr << endl;}
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail){cerr << head;if (sizeof...(Tail) > 0) cerr << ", ";dump_func(std::move(tail)...);}
template<class T> istream &operator>>(istream& is, complex<T>& v) {T x, y; is >> x >> y; v.real(x); v.imag(y); return is;}
template<class T> istream &operator>>(istream& is, V<T>& v) {for (auto&& e : v) is >> e;return is;}
template<class T, class U> istream &operator>>(istream& is, pair<T, U>& v) {is >> v.first >> v.second;return is;}
template<class T, size_t n> istream &operator>>(istream& is, array<T, n>& v) {for (auto&& e : v) is >> e;return is;}
template<class... A> void print_rest() {cout << "\n";}
template<class T, class... A> void print_rest(const T& first, const A&... rest) {cout << " " << first; print_rest(rest...);}
template<class T, class... A> void print(const T& first, const A&... rest) {cout << fixed << setprecision(16) << first; print_rest(rest...);}
template<class T, class... A> void printx(const T& first, const A&... rest) {cout << fixed << setprecision(16) << first; print_rest(rest...); exit(0);}
template<class T> inline string join(const T& v, string sep = " ") {if (v.size() == 0) return "" ;stringstream ss;for (auto&& e : v) ss << sep << e;return ss.str().substr(1);}
template<class T> V<T> make_vec(size_t n, T a) {return V<T>(n, a);}
template<class... Ts> auto make_vec(size_t n, Ts... ts) {return V<decltype(make_vec(ts...))>(n, make_vec(ts...));}
template<class T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return 1;} return 0;}
template<class T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return 1;} return 0;}
template<class T> inline int lower_index(V<T>&a , T x) {return distance(a.begin(), lower_bound(all(a), x));}
template<class T> inline int upper_index(V<T>&a , T x) {return distance(a.begin(), upper_bound(all(a), x));}
template<class T, class F> pair<T,T> binarysearch(T ng, T ok, T eps, F f, bool sign = false) {while(abs(ng-ok)>eps) {auto mid=ng+(ok-ng)/2;if(sign^f(mid)){ok = mid;}else{ng = mid;}}return {ng,ok};}
template<class T> constexpr T cdiv(T x, T y) {return (x+y-1)/y;}
template<class T> constexpr bool between(T a, T x, T b) {return (a <= x && x < b);}
template<class T> constexpr T pos1d(T y, T x, T h, T w) {assert(between(T(0),y,h));assert(between(T(0),x,w));return y*w + x;}
template<class T> constexpr pair<T,T> pos2d(T p, T h, T w) {T y = p/w, x = p - y*w;assert(between(T(0),y,h));assert(between(T(0),x,w));return {y, x};}
constexpr ll modpow(ll x, ll n, ll m = 1152921504606846976LL) {ll ret = 1;for(;n>0;x=(__int128)x*x%m,n>>=1) if(n&1)ret=(__int128)ret*x%m;return ret;}
constexpr int INF = (1 << 30) - 1; constexpr ll INFL = 1LL << 60;

bool is_prime(const ll n) {
  if (n <= 1) return false;
  const V<ll> primes = (n <= bit(31)) ? V<ll>{2,7,61} : V<ll>{2, 325, 9375, 28178, 450775, 9780504, 1795265022};
  for (auto b: primes) {
    if (b == n) return true;
    if (n % b == 0) return false;
  }
  ll s = __builtin_ctzll(n - 1), d = n >> s;
  for (auto b : primes) {
    ll p = modpow(b,d,n), i = s;
    while (p != 1 && p != n - 1 && b % n && --i) p = modpow(p,2,n);
    if (p != n - 1 && i != s) return false;
  }
  return true;
}

struct Solver {
  void solve() {
    string s; cin >> s;
    int n = sz(s);
    int ans = 0;
    rep(i,0,bit(n),2) {
      ll sum = 0;
      string tmp = "0";
      rep(j,n) {
        if (get1bit(i, j)) {
          sum += stoll(tmp);
          tmp = s[j];
        } else {
          tmp += s[j];
        }
      }
      sum += stoll(tmp);
      ans += is_prime(sum);
    }
    print(ans);
  }
} solver;
signed main(void) {cin.tie(nullptr);ios::sync_with_stdio(false);dump("");solver.solve();return 0;}
0