結果
問題 | No.1747 Many Formulae 2 |
ユーザー |
![]() |
提出日時 | 2021-11-11 00:11:29 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 2,251 bytes |
コンパイル時間 | 3,152 ms |
コンパイル使用メモリ | 175,588 KB |
最終ジャッジ日時 | 2025-01-25 15:16:59 |
ジャッジサーバーID (参考情報) |
judge5 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 19 |
ソースコード
#include <algorithm>#include <bitset>#include <cassert>#include <cmath>#include <cstdio>#include <fstream>#include <functional>#include <iomanip>#include <iostream>#include <iterator>#include <map>#include <numeric>#include <queue>#include <set>#include <sstream>#include <stack>#include <unordered_set>using namespace std;#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;#endif#define GET_MACRO(_1, _2, _3, NAME, ...) NAME#define _rep(i, n) _rep2(i, 0, n)#define _rep2(i, a, b) for(int i = (int)(a); i < (int)(b); i++)#define rep(...) GET_MACRO(__VA_ARGS__, _rep2, _rep)(__VA_ARGS__)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()using i64 = long long;template<class T, class U>bool chmin(T& a, const U& b) { return (b < a) ? (a = b, true) : false; }template<class T, class U>bool chmax(T& a, const U& b) { return (b > a) ? (a = b, true) : false; }template<typename T>istream& operator>>(istream&i,vector<T>&v){rep(j,v.size())i>>v[j];return i;}template<typename T>string join(vector<T>&v){stringstream s;rep(i,v.size())s<<' '<<v[i];return s.str().substr(1);}template<typename T>ostream& operator<<(ostream&o,vector<T>&v){if(v.size())o<<join(v);return o;}template<typename T>string join(vector<vector<T>>&vv){string s="\n";rep(i,vv.size())s+=join(vv[i])+"\n";return s;}template<typename T>ostream& operator<<(ostream&o,vector<vector<T>>&vv){if(vv.size())o<<join(vv);return o;}bool is_prime(i64 n){if (n == 1) return false;if (n == 2) return true;if (n % 2 == 0) return false;bool f = true;i64 i = 3;while (i * i <= n){if (n % i == 0){f = false;break;}i += 2;}return f;}int main(){string s;cin >> s;int n = s.size() - 1;int ans = 0;rep(i, 1 << n){int now = 0;i64 tmp = 0;rep(j, n){if (i >> j & 1){string t = s.substr(now, j - now + 1);now = j + 1;tmp += stoll(t);}}if (now != n + 1){tmp += stoll(s.substr(now, n - now + 1));}ans += is_prime(tmp);}cout << ans << endl;}