結果
問題 | No.313 π |
ユーザー |
![]() |
提出日時 | 2020-01-11 01:44:46 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 119 ms / 5,000 ms |
コード長 | 5,726 bytes |
コンパイル時間 | 1,757 ms |
コンパイル使用メモリ | 171,176 KB |
実行使用メモリ | 26,476 KB |
最終ジャッジ日時 | 2024-11-23 22:25:23 |
合計ジャッジ時間 | 6,696 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 32 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define int long long// #define double long double#define FOR(i, a, b) for(int i = (a); i < (b); ++i)#define FORR(i, a, b) for(int i = (a); i > (b); --i)#define REP(i, n) for(int i = 0; i < (n); ++i)#define REPR(i, n) for(int i = n; i >= 0; i--)#define FOREACH(x, a) for(auto &(x) : (a))#define VECCIN(x) \for(auto &youso_ : (x)) cin >> youso_#define bitcnt(x) __builtin_popcount(x)#define lbit(x) __builtin_ffsll(x)#define rbit(x) (64 - __builtin_clzll(x))#define fi first#define se second#define All(a) (a).begin(), (a).end()#define rAll(a) (a).rbegin(), (a).rend()#define cinfast() cin.tie(0), ios::sync_with_stdio(false)#define PERM(c) \sort(All(c)); \for(bool cp = true; cp; cp = next_permutation(All(c)))#define COMB(n, k) \for(ll bit = (1LL << k) - 1; bit < (1LL << n); bit = next_combination(bit))#define PERM2(n, k) \COMB(n, k) { \vector<int> sel; \for(int bitindex = 0; bitindex < n; bitindex++) \if(bit >> bitindex & 1) sel.emplace_back(bitindex); \PERM(sel) { Printv(sel); } \}#define MKORDER(n) \vector<int> od(n); \iota(All(od), 0LL);template <typename T = long long> inline T IN() {T x;cin >> x;return (x);}inline void CIN() {}template <class Head, class... Tail>inline void CIN(Head &&head, Tail &&... tail) {cin >> head;CIN(move(tail)...);}template <class Head> inline void COUT(Head &&head) { cout << (head) << "\n"; }template <class Head, class... Tail>inline void COUT(Head &&head, Tail &&... tail) {cout << (head) << " ";COUT(forward<Tail>(tail)...);}#define CCIN(...) \char __VA_ARGS__; \CIN(__VA_ARGS__)#define DCIN(...) \double __VA_ARGS__; \CIN(__VA_ARGS__)#define LCIN(...) \long long __VA_ARGS__; \CIN(__VA_ARGS__)#define SCIN(...) \string __VA_ARGS__; \CIN(__VA_ARGS__)#define Printv(v) \{ \FOREACH(x, v) { cout << x << " "; } \cout << "\n"; \}template <typename T = string> inline void eputs(T s) {cout << s << "\n";exit(0);}template <typename A, size_t N, typename T>void Fill(A (&array)[N], const T &val) {std::fill((T *)array, (T *)(array + N), val);}long long next_combination(long long sub) {long long x = sub & -sub, y = sub + x;return (((sub & ~y) / x) >> 1) | y;}// generic lambdastemplate <typename F>#if defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)[[nodiscard]]#elif defined(__GNUC__) && (__GNUC__ > 3 || __GNUC__ == 3 && __GNUC_MINOR__ >= 4)__attribute__((warn_unused_result))#endif // defined(__has_cpp_attribute) && __has_cpp_attribute(nodiscard)static inline constexpr decltype(auto)fix(F &&f) noexcept {return [f = std::forward<F>(f)](auto &&... args) {return f(f, std::forward<decltype(args)>(args)...);};}template <typename T> using PQG = priority_queue<T, vector<T>, greater<T>>;template <typename T> using PQ = priority_queue<T>;typedef long long ll;typedef vector<ll> VL;typedef vector<VL> VVL;typedef pair<ll, ll> PL;typedef vector<PL> VPL;typedef vector<bool> VB;typedef vector<double> VD;typedef vector<string> VS;const int INF = 1e9;// const int MOD = 1e9 + 7;const int MOD = 998244353;const ll LINF = 1e18;const ll dw[] = {1, 1, 0, -1, -1, -1, 0, 1};const ll dh[] = {0, 1, 1, 1, 0, -1, -1, -1};#define PI 3.141592653589793238#define EPS 1e-7bool is_prime[(ll)1e7];bool is_prime_small[(ll)1e7];ll corr = 1187919047209;VL seg_sieve(ll a, ll b) {VL res;for(ll i = 2; i * i < b; i++) is_prime_small[i] = true;REP(i, b - a) is_prime[i] = true;for(ll i = 2; i * i < b; i++) {if(is_prime_small[i]) {for(ll j = 2 * i; j * j < b; j += i) is_prime_small[j] = false;for(ll j = max(2LL, (a + i - 1) / i) * i; j < b; j += i)is_prime[j - a] = false;}}is_prime[0] = false, is_prime[1] = false;REP(i, b - a) if(is_prime[i]) res.emplace_back(i + a);return res;}signed main() {seg_sieve(0, 1e7);VL ps;REP(i, 1e7) if(is_prime[i]) ps.emplace_back(i);SCIN(S);ll sum = 0;REP(i, S.size()) sum += (S[i] - '0') * ps[i + 5];ll dif = corr - sum;REP(i, S.size()) if(dif % ps[i + 5] == 0) {COUT(S[i], char(S[i] + dif / ps[i + 5]));return 0;}}