結果
| 問題 | No.1276 3枚のカード |
| ユーザー |
 jell
|
| 提出日時 | 2020-10-31 14:57:03 |
| 言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
| 結果 |
AC
|
| 実行時間 | 351 ms / 2,000 ms |
| コード長 | 25,104 bytes |
| コンパイル時間 | 2,705 ms |
| コンパイル使用メモリ | 264,736 KB |
| 実行使用メモリ | 4,380 KB |
| 最終ジャッジ日時 | 2023-09-29 10:25:34 |
| 合計ジャッジ時間 | 14,657 ms |
|
ジャッジサーバーID （参考情報） |
judge14 / judge11 |
（要ログイン）
テストケース
テストケース表示| 入力 | 結果 | 実行時間 実行使用メモリ |
|---|---|---|
| testcase_00 | AC | 2 ms
4,376 KB |
| testcase_01 | AC | 1 ms
4,376 KB |
| testcase_02 | AC | 2 ms
4,380 KB |
| testcase_03 | AC | 2 ms
4,376 KB |
| testcase_04 | AC | 1 ms
4,376 KB |
| testcase_05 | AC | 2 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,376 KB |
| testcase_09 | AC | 1 ms
4,376 KB |
| testcase_10 | AC | 294 ms
4,376 KB |
| testcase_11 | AC | 139 ms
4,376 KB |
| testcase_12 | AC | 178 ms
4,376 KB |
| testcase_13 | AC | 186 ms
4,376 KB |
| testcase_14 | AC | 18 ms
4,376 KB |
| testcase_15 | AC | 150 ms
4,380 KB |
| testcase_16 | AC | 322 ms
4,380 KB |
| testcase_17 | AC | 172 ms
4,376 KB |
| testcase_18 | AC | 131 ms
4,380 KB |
| testcase_19 | AC | 213 ms
4,376 KB |
| testcase_20 | AC | 124 ms
4,376 KB |
| testcase_21 | AC | 130 ms
4,376 KB |
| testcase_22 | AC | 328 ms
4,380 KB |
| testcase_23 | AC | 16 ms
4,376 KB |
| testcase_24 | AC | 202 ms
4,380 KB |
| testcase_25 | AC | 68 ms
4,376 KB |
| testcase_26 | AC | 251 ms
4,380 KB |
| testcase_27 | AC | 287 ms
4,376 KB |
| testcase_28 | AC | 276 ms
4,380 KB |
| testcase_29 | AC | 158 ms
4,376 KB |
| testcase_30 | AC | 31 ms
4,380 KB |
| testcase_31 | AC | 14 ms
4,380 KB |
| testcase_32 | AC | 72 ms
4,376 KB |
| testcase_33 | AC | 5 ms
4,380 KB |
| testcase_34 | AC | 50 ms
4,376 KB |
| testcase_35 | AC | 47 ms
4,380 KB |
| testcase_36 | AC | 4 ms
4,380 KB |
| testcase_37 | AC | 44 ms
4,376 KB |
| testcase_38 | AC | 29 ms
4,376 KB |
| testcase_39 | AC | 76 ms
4,376 KB |
| testcase_40 | AC | 314 ms
4,376 KB |
| testcase_41 | AC | 258 ms
4,380 KB |
| testcase_42 | AC | 280 ms
4,376 KB |
| testcase_43 | AC | 245 ms
4,376 KB |
| testcase_44 | AC | 347 ms
4,380 KB |
| testcase_45 | AC | 314 ms
4,376 KB |
| testcase_46 | AC | 314 ms
4,376 KB |
| testcase_47 | AC | 258 ms
4,380 KB |
| testcase_48 | AC | 250 ms
4,380 KB |
| testcase_49 | AC | 282 ms
4,376 KB |
| testcase_50 | AC | 311 ms
4,380 KB |
| testcase_51 | AC | 267 ms
4,376 KB |
| testcase_52 | AC | 228 ms
4,380 KB |
| testcase_53 | AC | 269 ms
4,376 KB |
| testcase_54 | AC | 310 ms
4,380 KB |
| testcase_55 | AC | 238 ms
4,376 KB |
| testcase_56 | AC | 231 ms
4,376 KB |
| testcase_57 | AC | 297 ms
4,380 KB |
| testcase_58 | AC | 308 ms
4,380 KB |
| testcase_59 | AC | 269 ms
4,380 KB |
| testcase_60 | AC | 351 ms
4,376 KB |
ソースコード
#line 1 "other/y.cpp"
#include <bits/extc++.h>
#line 7 "Library/alias.hpp"
namespace workspace {
constexpr char eol = '\n';
using namespace std;
using i32 = int_least32_t;
using i64 = int_least64_t;
using i128 = __int128_t;
using u32 = uint_least32_t;
using u64 = uint_least64_t;
using u128 = __uint128_t;
template <class T, class Comp = less<T>>
using priority_queue = std::priority_queue<T, vector<T>, Comp>;
template <class T> using stack = std::stack<T, vector<T>>;
} // namespace workspace
#line 5 "Library/config.hpp"
namespace config {
const auto start_time{std::chrono::system_clock::now()};
int64_t elapsed() {
using namespace std::chrono;
const auto end_time{system_clock::now()};
return duration_cast<milliseconds>(end_time - start_time).count();
}
__attribute__((constructor)) void setup() {
using namespace std;
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout << fixed << setprecision(15);
#ifdef _buffer_check
atexit([] {
char bufc;
if (cin >> bufc)
cerr << "\n\033[43m\033[30mwarning: buffer not empty.\033[0m\n\n";
});
#endif
}
unsigned cases(), caseid = 1;
template <class F> void loop(F main) {
for (const unsigned total = cases(); caseid <= total; ++caseid) main();
}
} // namespace config
#line 1 "Library/cxx20.hpp"
#if __cplusplus <= 201703L
#if __has_include(<bit>)
#include <bit>
#endif
#include <vector>
namespace std {
template <typename _Tp, typename _Alloc, typename _Predicate>
inline typename vector<_Tp, _Alloc>::size_type erase_if(
vector<_Tp, _Alloc>& __cont, _Predicate __pred) {
const auto __osz = __cont.size();
__cont.erase(std::remove_if(__cont.begin(), __cont.end(), __pred),
__cont.end());
return __osz - __cont.size();
}
template <typename _Tp, typename _Alloc, typename _Up>
inline typename vector<_Tp, _Alloc>::size_type erase(
vector<_Tp, _Alloc>& __cont, const _Up& __value) {
const auto __osz = __cont.size();
__cont.erase(std::remove(__cont.begin(), __cont.end(), __value),
__cont.end());
return __osz - __cont.size();
}
}
#endif
#line 2 "Library/option.hpp"
#ifdef ONLINE_JUDGE
#pragma GCC optimize("O3")
#pragma GCC target("avx,avx2")
#pragma GCC optimize("unroll-loops")
#endif
#line 2 "Library/utils/binary_search.hpp"
#if __cplusplus >= 201703L
#include <cassert>
#include <cmath>
#include <vector>
namespace workspace {
// binary search on a discrete range.
template <class iter_type, class pred_type>
std::enable_if_t<
std::is_convertible_v<std::invoke_result_t<pred_type, iter_type>, bool>,
iter_type>
binary_search(iter_type ok, iter_type ng, pred_type pred) {
assert(ok != ng);
std::make_signed_t<decltype(ng - ok)> dist(ng - ok);
while (1 < dist || dist < -1) {
iter_type mid(ok + dist / 2);
if (pred(mid))
ok = mid, dist -= dist / 2;
else
ng = mid, dist /= 2;
}
return ok;
}
// parallel binary search on each discrete range.
template <class iter_type, class pred_type>
std::enable_if_t<std::is_convertible_v<
std::invoke_result_t<pred_type, std::vector<iter_type>>,
std::vector<bool>>,
std::vector<iter_type>>
binary_search(std::vector<std::pair<iter_type, iter_type>> ends,
pred_type pred) {
std::vector<iter_type> mids(ends.size());
for (;;) {
bool all_found = true;
for (size_t i{}; i != ends.size(); ++i) {
auto [ok, ng] = ends[i];
iter_type mid(ok + (ng - ok) / 2);
if (mids[i] != mid) {
all_found = false;
mids[i] = mid;
}
}
if (all_found) break;
auto res = pred(mids);
for (size_t i{}; i != ends.size(); ++i) {
(res[i] ? ends[i].first : ends[i].second) = mids[i];
}
}
return mids;
}
// binary search on a real number interval.
template <class real_type, class pred_type>
std::enable_if_t<
std::is_convertible_v<std::invoke_result_t<pred_type, real_type>, bool>,
real_type>
binary_search(real_type ok, real_type ng, const real_type eps, pred_type pred) {
assert(ok != ng);
for (auto loops = 0; loops != std::numeric_limits<real_type>::digits &&
(ok + eps < ng || ng + eps < ok);
++loops) {
real_type mid{(ok + ng) / 2};
(pred(mid) ? ok : ng) = mid;
}
return ok;
}
// parallel binary search on each real interval.
template <class real_type, class pred_type>
std::enable_if_t<std::is_convertible_v<
std::invoke_result_t<pred_type, std::vector<real_type>>,
std::vector<bool>>,
std::vector<real_type>>
binary_search(std::vector<std::pair<real_type, real_type>> ends,
const real_type eps, pred_type pred) {
std::vector<real_type> mids(ends.size());
for (auto loops = 0; loops != std::numeric_limits<real_type>::digits;
++loops) {
bool all_found = true;
for (size_t i{}; i != ends.size(); ++i) {
auto [ok, ng] = ends[i];
if (ok + eps < ng || ng + eps < ok) {
all_found = false;
mids[i] = (ok + ng) / 2;
}
}
if (all_found) break;
auto res = pred(mids);
for (size_t i{}; i != ends.size(); ++i) {
(res[i] ? ends[i].first : ends[i].second) = mids[i];
}
}
return mids;
}
} // namespace workspace
#endif
#line 3 "Library/utils/casefmt.hpp"
namespace workspace {
std::ostream &casefmt(std::ostream& os) { return os << "Case #" << config::caseid << ": "; }
} // namespace workspace
#line 3 "Library/utils/chval.hpp"
namespace workspace {
template <class T, class Comp = std::less<T>>
bool chle(T &x, const T &y, Comp comp = Comp()) {
return comp(y, x) ? x = y, true : false;
}
template <class T, class Comp = std::less<T>>
bool chge(T &x, const T &y, Comp comp = Comp()) {
return comp(x, y) ? x = y, true : false;
}
} // namespace workspace
#line 5 "Library/utils/coordinate_compression.hpp"
template <class T> class coordinate_compression {
std::vector<T> uniquely;
std::vector<size_t> compressed;
public:
coordinate_compression(const std::vector<T> &raw)
: uniquely(raw), compressed(raw.size()) {
std::sort(uniquely.begin(), uniquely.end());
uniquely.erase(std::unique(uniquely.begin(), uniquely.end()),
uniquely.end());
for (size_t i = 0; i != size(); ++i)
compressed[i] =
std::lower_bound(uniquely.begin(), uniquely.end(), raw[i]) -
uniquely.begin();
}
size_t operator[](const size_t idx) const {
assert(idx < size());
return compressed[idx];
}
size_t size() const { return compressed.size(); }
size_t count() const { return uniquely.size(); }
T value(const size_t ord) const {
assert(ord < count());
return uniquely[ord];
}
size_t order(const T &value) const {
return std::lower_bound(uniquely.begin(), uniquely.end(), value) -
uniquely.begin();
}
auto begin() { return compressed.begin(); }
auto end() { return compressed.end(); }
auto rbegin() { return compressed.rbegin(); }
auto rend() { return compressed.rend(); }
};
#line 3 "Library/utils/fixed_point.hpp"
namespace workspace {
// specify the return type of lambda.
template <class lambda_type> class fixed_point {
lambda_type func;
public:
fixed_point(lambda_type &&f) : func(std::move(f)) {}
template <class... Args> auto operator()(Args &&... args) const {
return func(*this, std::forward<Args>(args)...);
}
};
} // namespace workspace
#line 3 "Library/utils/floor_div.hpp"
#line 4 "Library/utils/sfinae.hpp"
#include <type_traits>
template <class type, template <class> class trait>
using enable_if_trait_type = typename std::enable_if<trait<type>::value>::type;
template <class Container>
using element_type = typename std::decay<decltype(
*std::begin(std::declval<Container&>()))>::type;
template <class T, class = int> struct mapped_of {
using type = element_type<T>;
};
template <class T>
struct mapped_of<T,
typename std::pair<int, typename T::mapped_type>::first_type> {
using type = typename T::mapped_type;
};
template <class T> using mapped_type = typename mapped_of<T>::type;
template <class T, class = void> struct is_integral_ext : std::false_type {};
template <class T>
struct is_integral_ext<
T, typename std::enable_if<std::is_integral<T>::value>::type>
: std::true_type {};
template <> struct is_integral_ext<__int128_t> : std::true_type {};
template <> struct is_integral_ext<__uint128_t> : std::true_type {};
#if __cplusplus >= 201402
template <class T>
constexpr static bool is_integral_ext_v = is_integral_ext<T>::value;
#endif
template <typename T, typename = void> struct multiplicable_uint {
using type = uint_least32_t;
};
template <typename T>
struct multiplicable_uint<T, typename std::enable_if<(2 < sizeof(T))>::type> {
using type = uint_least64_t;
};
template <typename T>
struct multiplicable_uint<T, typename std::enable_if<(4 < sizeof(T))>::type> {
using type = __uint128_t;
};
#line 5 "Library/utils/floor_div.hpp"
template <typename int_type>
constexpr
typename std::enable_if<is_integral_ext<int_type>::value, int_type>::type
floor_div(int_type x, int_type y) {
assert(y != 0);
if (y < 0) x = -x, y = -y;
return x < 0 ? (x - y + 1) / y : x / y;
}
#line 6 "Library/utils/hash.hpp"
#line 8 "Library/utils/hash.hpp"
namespace workspace {
template <class T, class = void> struct hash : std::hash<T> {};
#if __cplusplus >= 201703L
template <class Unique_bits_type>
struct hash<Unique_bits_type,
enable_if_trait_type<Unique_bits_type,
std::has_unique_object_representations>> {
size_t operator()(uint64_t x) const {
static const uint64_t m = std::random_device{}();
x ^= x >> 23;
x ^= m;
x ^= x >> 47;
return x - (x >> 32);
}
};
#endif
template <class Key> size_t hash_combine(const size_t &seed, const Key &key) {
return seed ^
(hash<Key>()(key) + 0x9e3779b9 /* + (seed << 6) + (seed >> 2) */);
}
template <class T1, class T2> struct hash<std::pair<T1, T2>> {
size_t operator()(const std::pair<T1, T2> &pair) const {
return hash_combine(hash<T1>()(pair.first), pair.second);
}
};
template <class... T> class hash<std::tuple<T...>> {
template <class Tuple, size_t index = std::tuple_size<Tuple>::value - 1>
struct tuple_hash {
static uint64_t apply(const Tuple &t) {
return hash_combine(tuple_hash<Tuple, index - 1>::apply(t),
std::get<index>(t));
}
};
template <class Tuple> struct tuple_hash<Tuple, size_t(-1)> {
static uint64_t apply(const Tuple &t) { return 0; }
};
public:
uint64_t operator()(const std::tuple<T...> &t) const {
return tuple_hash<std::tuple<T...>>::apply(t);
}
};
template <class hash_table> struct hash_table_wrapper : hash_table {
using key_type = typename hash_table::key_type;
size_t count(const key_type &key) const {
return hash_table::find(key) != hash_table::end();
}
template <class... Args> auto emplace(Args &&... args) {
return hash_table::insert(typename hash_table::value_type(args...));
}
};
template <class Key, class Mapped = __gnu_pbds::null_type>
using cc_hash_table =
hash_table_wrapper<__gnu_pbds::cc_hash_table<Key, Mapped, hash<Key>>>;
template <class Key, class Mapped = __gnu_pbds::null_type>
using gp_hash_table =
hash_table_wrapper<__gnu_pbds::gp_hash_table<Key, Mapped, hash<Key>>>;
template <class Key, class Mapped>
using unordered_map = std::unordered_map<Key, Mapped, hash<Key>>;
template <class Key> using unordered_set = std::unordered_set<Key, hash<Key>>;
} // namespace workspace
#line 2 "Library/utils/make_vector.hpp"
#if __cplusplus >= 201703L
#include <tuple>
#include <vector>
namespace workspace {
template <typename T, typename S, size_t N>
constexpr auto make_vector(S* sizes, T const& init = T()) {
if constexpr (N)
return std::vector(*sizes,
make_vector<T, S, N - 1>(std::next(sizes), init));
else
return init;
}
template <typename T, typename S, size_t N,
std::enable_if_t<std::is_convertible_v<S, size_t>>* = nullptr>
constexpr auto make_vector(const S (&sizes)[N], T const& init = T()) {
return make_vector<T, S, N>((S*)sizes, init);
}
template <typename T, size_t N, size_t I = 0>
constexpr auto make_vector(std::array<size_t, N> const& array,
T const& init = T()) {
if constexpr (I == N)
return init;
else
return std::vector(array[I], make_vector<T, N, I + 1>(array, init));
}
template <typename T, size_t I = 0, class... Args>
constexpr auto make_vector(std::tuple<Args...> const& tuple,
T const& init = T()) {
using tuple_type = std::tuple<Args...>;
if constexpr (I == tuple_size_v<tuple_type>)
return init;
else {
static_assert(
std::is_convertible_v<tuple_element_t<I, tuple_type>, size_t>);
return std::vector(get<I>(tuple), make_vector<T, I + 1>(tuple, init));
}
}
template <typename T, class Fst, class Snd>
constexpr auto make_vector(std::pair<Fst, Snd> const& pair,
T const& init = T()) {
return make_vector((size_t[2]){pair.first, pair.second}, init);
}
} // namespace workspace
#endif
#line 3 "Library/utils/random_number_generator.hpp"
template <typename num_type> class random_number_generator {
typename std::conditional<std::is_integral<num_type>::value,
std::uniform_int_distribution<num_type>,
std::uniform_real_distribution<num_type>>::type
unif;
std::mt19937 engine;
public:
random_number_generator(num_type min = std::numeric_limits<num_type>::min(),
num_type max = std::numeric_limits<num_type>::max())
: unif(min, max), engine(std::random_device{}()) {}
num_type min() const { return unif.min(); }
num_type max() const { return unif.max(); }
// generate a random number in [min(), max()].
num_type operator()() { return unif(engine); }
};
#line 3 "Library/utils/read.hpp"
namespace workspace {
// read with std::cin.
template <class T = void>
struct read
{
typename std::remove_const<T>::type value;
template <class... types>
read(types... args) : value(args...) { std::cin >> value; }
operator T() const { return value; }
};
template <>
struct read<void>
{
template <class T>
operator T() const { T value; std::cin >> value; return value; }
};
} // namespace workspace
#line 4 "Library/utils/stream.hpp"
#line 6 "Library/utils/stream.hpp"
namespace std {
template <class T, class U> istream &operator>>(istream &is, pair<T, U> &p) {
return is >> p.first >> p.second;
}
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
return os << p.first << ' ' << p.second;
}
template <class tuple_t, size_t index> struct tuple_is {
static istream &apply(istream &is, tuple_t &t) {
tuple_is<tuple_t, index - 1>::apply(is, t);
return is >> get<index>(t);
}
};
template <class tuple_t> struct tuple_is<tuple_t, SIZE_MAX> {
static istream &apply(istream &is, tuple_t &t) { return is; }
};
template <class... T> istream &operator>>(istream &is, tuple<T...> &t) {
return tuple_is<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(is,
t);
}
template <class tuple_t, size_t index> struct tuple_os {
static ostream &apply(ostream &os, const tuple_t &t) {
tuple_os<tuple_t, index - 1>::apply(os, t);
return os << ' ' << get<index>(t);
}
};
template <class tuple_t> struct tuple_os<tuple_t, 0> {
static ostream &apply(ostream &os, const tuple_t &t) {
return os << get<0>(t);
}
};
template <class tuple_t> struct tuple_os<tuple_t, SIZE_MAX> {
static ostream &apply(ostream &os, const tuple_t &t) { return os; }
};
template <class... T> ostream &operator<<(ostream &os, const tuple<T...> &t) {
return tuple_os<tuple<T...>, tuple_size<tuple<T...>>::value - 1>::apply(os,
t);
}
template <class Container, typename Value = element_type<Container>>
typename enable_if<!is_same<typename decay<Container>::type, string>::value &&
!is_same<typename decay<Container>::type, char *>::value,
istream &>::type
operator>>(istream &is, Container &cont) {
for (auto &&e : cont) is >> e;
return is;
}
template <class Container, typename Value = element_type<Container>>
typename enable_if<!is_same<typename decay<Container>::type, string>::value &&
!is_same<typename decay<Container>::type, char *>::value,
ostream &>::type
operator<<(ostream &os, const Container &cont) {
bool head = true;
for (auto &&e : cont) head ? head = 0 : (os << ' ', 0), os << e;
return os;
}
} // namespace std
#line 4 "Library/utils/trinary_search.hpp"
// trinary search on discrete range.
template <class iter_type, class comp_type>
iter_type trinary(iter_type first, iter_type last, comp_type comp)
{
assert(first < last);
intmax_t dist(last - first);
while(dist > 2)
{
iter_type left(first + dist / 3), right(first + dist * 2 / 3);
if(comp(left, right)) last = right, dist = dist * 2 / 3;
else first = left, dist -= dist / 3;
}
if(dist > 1 && comp(first + 1, first)) ++first;
return first;
}
// trinary search on real numbers.
template <class comp_type>
long double trinary(long double first, long double last, const long double eps, comp_type comp)
{
assert(first < last);
while(last - first > eps)
{
long double left{(first * 2 + last) / 3}, right{(first + last * 2) / 3};
if(comp(left, right)) last = right;
else first = left;
}
return first;
}
#line 2 "Library/utils/wrapper.hpp"
template <class Container> class reversed {
Container &ref, copy;
public:
constexpr reversed(Container &ref) : ref(ref) {}
constexpr reversed(Container &&ref = Container()) : ref(copy), copy(ref) {}
constexpr auto begin() const { return ref.rbegin(); }
constexpr auto end() const { return ref.rend(); }
constexpr operator Container() const { return ref; }
};
#line 8 "other/y.cpp"
namespace workspace {
void main();
}
int main() { config::loop(workspace::main); }
unsigned config::cases() {
// return -1; // unspecified
// int t; std::cin >> t; return t; // given
return 1;
}
#line 4 "Library/modulus/modint.hpp"
#line 6 "Library/modulus/modint.hpp"
// A non-positive Mod corresponds to a unique type of runtime modint.
template <auto Mod = 0, typename Mod_type = decltype(Mod)> struct modint {
static_assert(is_integral_ext<decltype(Mod)>::value,
"Mod must be integral type.");
using mod_type = typename std::conditional<
0 < Mod, typename std::add_const<Mod_type>::type, Mod_type>::type;
static mod_type mod;
using value_type = typename std::decay<mod_type>::type;
constexpr operator value_type() const noexcept { return value; }
constexpr static modint one() noexcept { return 1; }
constexpr modint() noexcept = default;
template <class int_type,
typename std::enable_if<is_integral_ext<int_type>::value>::type * =
nullptr>
constexpr modint(int_type n) noexcept : value((n %= mod) < 0 ? mod + n : n) {}
constexpr modint(bool n) noexcept : modint(int(n)) {}
constexpr modint operator++(int) noexcept {
modint t{*this};
return operator+=(1), t;
}
constexpr modint operator--(int) noexcept {
modint t{*this};
return operator-=(1), t;
}
constexpr modint &operator++() noexcept { return operator+=(1); }
constexpr modint &operator--() noexcept { return operator-=(1); }
constexpr modint operator-() const noexcept {
return value ? mod - value : 0;
}
constexpr modint &operator+=(const modint &rhs) noexcept {
return (value += rhs.value) < mod ? 0 : value -= mod, *this;
}
constexpr modint &operator-=(const modint &rhs) noexcept {
return (value += mod - rhs.value) < mod ? 0 : value -= mod, *this;
}
constexpr modint &operator*=(const modint &rhs) noexcept {
return value = (typename multiplicable_uint<value_type>::type)value *
rhs.value % mod,
*this;
}
constexpr modint &operator/=(const modint &rhs) noexcept {
return operator*=(rhs.inverse());
}
template <class int_type>
constexpr
typename std::enable_if<is_integral_ext<int_type>::value, modint>::type
operator+(const int_type &rhs) const noexcept {
return modint{*this} += rhs;
}
constexpr modint operator+(const modint &rhs) const noexcept {
return modint{*this} += rhs;
}
template <class int_type>
constexpr
typename std::enable_if<is_integral_ext<int_type>::value, modint>::type
operator-(const int_type &rhs) const noexcept {
return modint{*this} -= rhs;
}
constexpr modint operator-(const modint &rhs) const noexcept {
return modint{*this} -= rhs;
}
template <class int_type>
constexpr
typename std::enable_if<is_integral_ext<int_type>::value, modint>::type
operator*(const int_type &rhs) const noexcept {
return modint{*this} *= rhs;
}
constexpr modint operator*(const modint &rhs) const noexcept {
return modint{*this} *= rhs;
}
template <class int_type>
constexpr
typename std::enable_if<is_integral_ext<int_type>::value, modint>::type
operator/(const int_type &rhs) const noexcept {
return modint{*this} /= rhs;
}
constexpr modint operator/(const modint &rhs) const noexcept {
return modint{*this} /= rhs;
}
template <class int_type>
constexpr friend
typename std::enable_if<is_integral_ext<int_type>::value, modint>::type
operator+(const int_type &lhs, const modint &rhs) noexcept {
return modint(lhs) + rhs;
}
template <class int_type>
constexpr friend
typename std::enable_if<is_integral_ext<int_type>::value, modint>::type
operator-(const int_type &lhs, const modint &rhs) noexcept {
return modint(lhs) - rhs;
}
template <class int_type>
constexpr friend
typename std::enable_if<is_integral_ext<int_type>::value, modint>::type
operator*(const int_type &lhs, const modint &rhs) noexcept {
return modint(lhs) * rhs;
}
template <class int_type>
constexpr friend
typename std::enable_if<is_integral_ext<int_type>::value, modint>::type
operator/(const int_type &lhs, const modint &rhs) noexcept {
return modint(lhs) / rhs;
}
constexpr modint inverse() const noexcept {
assert(value);
value_type a{mod}, b{value}, u{}, v{1}, t{};
while (b)
t = a / b, a ^= b ^= (a -= t * b) ^= b, u ^= v ^= (u -= t * v) ^= v;
return {u};
}
template <class int_type>
constexpr
typename std::enable_if<is_integral_ext<int_type>::value, modint>::type
power(int_type e) noexcept {
return pow(*this, e);
}
template <class int_type>
friend constexpr
typename std::enable_if<is_integral_ext<int_type>::value, modint>::type
pow(modint b, int_type e) noexcept {
modint res{1};
for (e < 0 ? b = b.inverse(), e = -e : 0; e; e >>= 1, b *= b)
if (e & 1) res *= b;
return res;
}
friend std::ostream &operator<<(std::ostream &os,
const modint &rhs) noexcept {
return os << rhs.value;
}
friend std::istream &operator>>(std::istream &is, modint &rhs) noexcept {
intmax_t value;
rhs = (is >> value, value);
return is;
}
protected:
value_type value = 0;
};
template <auto Mod, typename Mod_type>
typename modint<Mod, Mod_type>::mod_type modint<Mod, Mod_type>::mod = Mod;
template <unsigned type_id = 0> using modint_runtime = modint<-(signed)type_id>;
// #define modint_newtype modint<-__COUNTER__>
#line 21 "other/y.cpp"
namespace workspace {
using mint = modint<1000000007>;
// O(n^{1/2})
mint divpair(int n) {
const int sqn = sqrt(n);
mint ret = 0;
for (i64 i = 1; i * (1 + sqn) <= n; i++) {
ret += n / i;
}
for (int k = 1; k <= sqn; k++) {
ret += k * (n / k - n / (k + 1));
}
return ret;
}
// O(n^{1/2})
mint divtuple(i64 n) {
const int sqn = sqrt(n);
mint ret = 0;
for (i64 i = 1; i * (1 + sqn) <= n; i++) {
ret += (n / i) * (n / i);
}
for (i64 k = 1; k <= sqn; k++) {
ret += k * k * (n / k - n / (k + 1));
}
return ret;
}
void main() {
// start here!
i64 n;
cin >> n;
const int sqn = floor(sqrt(n));
vector<int> dv(sqn + 1);
for (auto i = 1; i <= sqn; ++i) {
for (auto j = i; j <= sqn; j += i) {
dv[j]++;
}
}
mint ans = 0;
// b | c
ans += n * divpair(n);
// b | a && b | c
ans -= divtuple(n);
// a | b | c
{
// a*a <= n
for (auto a = 1; a * a <= n; ++a) {
ans -= divpair(n / a);
}
// a*a > n
for (auto k = 1; k * k < n; k++) {
ans -= (n / k - sqn) * dv[k];
}
}
// a = b | c
ans += divpair(n);
// b = c
{
ans -= n * n;
// a | b
ans += divpair(n);
// b | a
ans += divpair(n);
// a = b
ans -= n;
}
cout << ans << eol;
}
}