結果
問題 | No.1509 Swap!! |
ユーザー |
![]() |
提出日時 | 2021-05-15 00:10:34 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 42 ms / 2,000 ms |
コード長 | 2,267 bytes |
コンパイル時間 | 2,181 ms |
コンパイル使用メモリ | 192,292 KB |
最終ジャッジ日時 | 2025-01-21 12:48:18 |
ジャッジサーバーID (参考情報) |
judge2 / judge2 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 30 |
ソースコード
#include <bits/stdc++.h>#include <optional>#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(...)#endifusing namespace std;auto solve() {i64 n, a, b;cin >> n >> a >> b;if (gcd(a, b) != 1) return false;if (a < b) swap(a, b);return n >= a + b - 1;}int main() {ios_base::sync_with_stdio(false), cin.tie(nullptr);int t;cin >> t;REP(i, t) cout << (solve() ? "YES" : "NO") << "\n";}