結果
| 問題 |
No.1514 Squared Matching
|
| コンテスト | |
| ユーザー |
keijak
|
| 提出日時 | 2021-05-21 22:54:51 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
TLE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 2,610 bytes |
| コンパイル時間 | 10,760 ms |
| コンパイル使用メモリ | 256,668 KB |
| 最終ジャッジ日時 | 2025-01-21 16:22:36 |
|
ジャッジサーバーID (参考情報) |
judge4 / judge2 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| other | AC * 10 TLE * 16 |
ソースコード
#include <bits/stdc++.h>
#define REP_(i, a_, b_, a, b, ...) \
for (int i = (a), END_##i = (b); i < END_##i; ++i)
#define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__)
#define ALL(x) std::begin(x), std::end(x)
using i64 = long long;
template <typename T, typename U>
inline bool chmax(T &a, U b) {
return a < b and ((a = std::move(b)), true);
}
template <typename T, typename U>
inline bool chmin(T &a, U b) {
return a > b and ((a = std::move(b)), true);
}
template <typename T>
inline int ssize(const T &a) {
return (int)std::size(a);
}
template <typename T>
std::istream &operator>>(std::istream &is, std::vector<T> &a) {
for (auto &x : a) is >> x;
return is;
}
template <typename T, typename U>
std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &a) {
return os << "(" << a.first << ", " << a.second << ")";
}
template <typename Container>
std::ostream &print_seq(const Container &a, std::string_view sep = " ",
std::string_view ends = "\n",
std::ostream &os = std::cout) {
auto b = std::begin(a), e = std::end(a);
for (auto it = std::begin(a); it != e; ++it) {
if (it != b) os << sep;
os << *it;
}
return os << ends;
}
template <typename T, typename = void>
struct is_iterable : std::false_type {};
template <typename T>
struct is_iterable<T, std::void_t<decltype(std::begin(std::declval<T>())),
decltype(std::end(std::declval<T>()))>>
: std::true_type {};
template <typename T, typename = std::enable_if_t<
is_iterable<T>::value &&
!std::is_same<T, std::string_view>::value &&
!std::is_same<T, std::string>::value>>
std::ostream &operator<<(std::ostream &os, const T &a) {
return print_seq(a, ", ", "", (os << "{")) << "}";
}
#ifdef ENABLE_DEBUG
#include "debug_dump.hpp"
#else
#define DUMP(...)
#endif
using namespace std;
auto solve() {
i64 n;
cin >> n;
vector<char> p(n + 1, true);
vector<int> b(n + 1);
p[0] = p[1] = false;
REP(i, n + 1) b[i] = i;
for (int i = 4; i <= n; i += 2) {
p[i] = false;
while ((b[i] & 3) == 0) b[i] >>= 2;
}
for (i64 i = 3; i * i <= n; i += 2) {
if (not p[i]) continue;
i64 ii = i * i;
for (int j = ii; j <= n; j += i) {
p[j] = false;
while ((b[j] % ii) == 0) b[j] /= ii;
}
}
i64 ans = 0;
for (i64 x = 1; x <= n; ++x) {
i64 r = std::sqrt(n / b[x]);
ans += r;
}
return ans;
}
int main() {
ios_base::sync_with_stdio(false), cin.tie(nullptr);
cout << solve() << "\n";
}
keijak