結果
問題 | No.2117 中国剰余定理入門 |
ユーザー | r1933 |
提出日時 | 2022-11-04 21:33:15 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 2 ms / 2,000 ms |
コード長 | 5,009 bytes |
コンパイル時間 | 1,697 ms |
コンパイル使用メモリ | 201,868 KB |
実行使用メモリ | 5,376 KB |
最終ジャッジ日時 | 2024-07-18 19:16:13 |
合計ジャッジ時間 | 2,319 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge4 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,376 KB |
testcase_02 | AC | 2 ms
5,376 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 2 ms
5,376 KB |
testcase_05 | AC | 2 ms
5,376 KB |
testcase_06 | AC | 2 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 2 ms
5,376 KB |
testcase_09 | AC | 1 ms
5,376 KB |
testcase_10 | AC | 2 ms
5,376 KB |
testcase_11 | AC | 2 ms
5,376 KB |
testcase_12 | AC | 1 ms
5,376 KB |
testcase_13 | AC | 2 ms
5,376 KB |
testcase_14 | AC | 2 ms
5,376 KB |
testcase_15 | AC | 1 ms
5,376 KB |
testcase_16 | AC | 2 ms
5,376 KB |
testcase_17 | AC | 2 ms
5,376 KB |
testcase_18 | AC | 2 ms
5,376 KB |
testcase_19 | AC | 2 ms
5,376 KB |
ソースコード
#include "bits/stdc++.h" #pragma GCC optimize("Ofast") // Begin Header {{{ #pragma region using namespace std; #ifndef DEBUG #define dump(...) #endif #define all(x) begin(x), end(x) #define rall(x) rbegin(x), rend(x) #define rep(i, b, e) for (intmax_t i = (b), i##_limit = (e); i < i##_limit; ++i) #define repc(i, b, e) for (intmax_t i = (b), i##_limit = (e); i <= i##_limit; ++i) #define repr(i, b, e) for (intmax_t i = (b), i##_limit = (e); i >= i##_limit; --i) #define var(Type, ...) \ Type __VA_ARGS__; \ input(__VA_ARGS__) #define let const auto constexpr size_t operator""_zu(unsigned long long value) { return value; }; constexpr intmax_t operator""_jd(unsigned long long value) { return value; }; constexpr uintmax_t operator""_ju(unsigned long long value) { return value; }; constexpr int INF = 0x3f3f3f3f; constexpr intmax_t LINF = 0x3f3f3f3f3f3f3f3f_jd; using usize = size_t; using imax = intmax_t; using uimax = uintmax_t; using ld = long double; template <class T, class Compare = less<>> using MaxHeap = priority_queue<T, vector<T>, Compare>; template <class T, class Compare = greater<>> using MinHeap = priority_queue<T, vector<T>, Compare>; inline void input() {} template <class Head, class... Tail> inline void input(Head&& head, Tail&&... tail) { cin >> head; input(forward<Tail>(tail)...); } template <class Container, class Value = typename Container::value_type, enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr> inline istream& operator>>(istream& is, Container& vs) { for (auto& v: vs) is >> v; return is; } template <class T, class U> inline istream& operator>>(istream& is, pair<T, U>& p) { is >> p.first >> p.second; return is; } inline void output() { cout << "\n"; } template <class Head, class... Tail> inline void output(Head&& head, Tail&&... tail) { cout << head; if (sizeof...(tail)) cout << " "; output(forward<Tail>(tail)...); } template <class Container, class Value = typename Container::value_type, enable_if_t<!is_same<Container, string>::value, nullptr_t> = nullptr> inline ostream& operator<<(ostream& os, const Container& vs) { static constexpr const char* delim[] = {" ", ""}; for (auto it = begin(vs); it != end(vs); ++it) { os << delim[it == begin(vs)] << *it; } return os; } template <class Iterator> inline void join(const Iterator& Begin, const Iterator& End, const string& delim = "\n", const string& last = "\n") { for (auto it = Begin; it != End; ++it) { cout << ((it == Begin) ? "" : delim) << *it; } cout << last; } template <class T> inline vector<T> makeVector(const T& init_value, size_t sz) { return vector<T>(sz, init_value); } template <class T, class... Args> inline auto makeVector(const T& init_value, size_t sz, Args... args) { return vector<decltype(makeVector<T>(init_value, args...))>( sz, makeVector<T>(init_value, args...)); } template <class Func> class FixPoint : Func { public: explicit constexpr FixPoint(Func&& f) noexcept : Func(forward<Func>(f)) {} template <class... Args> constexpr decltype(auto) operator()(Args&&... args) const { return Func::operator()(*this, std::forward<Args>(args)...); } }; template <class Func> static inline constexpr decltype(auto) makeFixPoint(Func&& f) noexcept { return FixPoint<Func> {forward<Func>(f)}; } template <class Container> struct reverse_t { Container& c; reverse_t(Container& c) : c(c) {} auto begin() { return c.rbegin(); } auto end() { return c.rend(); } }; template <class Container> auto reversed(Container& c) { return reverse_t<Container>(c); } template <class T> inline bool chmax(T& a, const T& b) noexcept { return b > a && (a = b, true); } template <class T> inline bool chmin(T& a, const T& b) noexcept { return b < a && (a = b, true); } template <class T> inline T diff(const T& a, const T& b) noexcept { return a < b ? b - a : a - b; } template <class T> inline T sigma(const T& l, const T& r) noexcept { return (l + r) * (r - l + 1) / 2; } template <class T> inline T ceildiv(const T& n, const T& d) noexcept { return (n + d - 1) / d; } void operator|=(vector<bool>::reference lhs, const bool rhs) { lhs = lhs | rhs; } void operator&=(vector<bool>::reference lhs, const bool rhs) { lhs = lhs & rhs; } void operator^=(vector<bool>::reference lhs, const bool rhs) { lhs = lhs ^ rhs; } void ioinit() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(10); cerr << fixed << setprecision(10); clog << fixed << setprecision(10); } #pragma endregion // }}} End Header int main() { ioinit(); var(intmax_t, b0, c0); var(intmax_t, b1, c1); rep(n, 0, b0 * b1) { if ((n - c0) % b0 == 0 && (n - c1) % b1 == 0) { return output(n), 0; } } output("NaN"); return 0; }