結果
問題 | No.1850 Rewrite Product |
ユーザー |
|
提出日時 | 2022-02-25 21:47:52 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 48 ms / 2,000 ms |
コード長 | 3,137 bytes |
コンパイル時間 | 2,691 ms |
コンパイル使用メモリ | 189,684 KB |
実行使用メモリ | 6,940 KB |
最終ジャッジ日時 | 2024-07-03 16:34:03 |
合計ジャッジ時間 | 2,888 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 1 |
ソースコード
#include <bits/stdc++.h>#include <ext/pb_ds/assoc_container.hpp>#include <ext/pb_ds/tree_policy.hpp>using namespace __gnu_pbds;using namespace std;template <typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;// oset Operations: order_of_key(k) -> Number of elements strictly smaller than k, find_by_order(k) -> kth element in the set#define ull unsigned long long int#define int long long int#define pb push_back#define eb emplace_back#define all(x) x.begin(),x.end()#define pii pair<int, int>#define pll pair<ll, ll>#define vi vector<int>#define vb vector<bool>#define vd vector<double>#define vll vector<ll>#define vpii vector<pii>#define vpll vector<pll>#define vvi vector<vi>#define vvll vector<vll>#define vvb vector<vb>#define vs vector<string>#define pull pair<ull, ull>#define F first#define S second#define m_p make_pairconst long double PI = 3.141592653589793238462643383279502884197169399;template <typename A, typename B> string to_string(pair<A, B> p);template <typename A, typename B, typename C> string to_string(tuple<A, B, C> p);string to_string(const string& s) { return '"' + s + '"'; }string to_string(const char* s) { return to_string((string) s); }string to_string(bool b) { return (b ? "true" : "false"); }string to_string(vector<bool> v) {bool first = true;string res = "{";for (int i = 0; i < static_cast<int>(v.size()); i++) {if (!first) {res += ", ";}first = false;res += to_string(v[i]);}res += "}";return res;}template <size_t N>string to_string(bitset<N> v) {string res = "";for (size_t i = 0; i < N; i++) {res.push_back(static_cast<char>('0' + v[i]));}return res;}template <typename A>string to_string(A v) {bool first = true;string res = "{";for (const auto &x : v) {if (!first) {res += ", ";}first = false;res += to_string(x);}res += "}";return res;}template <typename A, typename B>string to_string(pair<A, B> p) { return "(" + to_string(p.first) + ", " + to_string(p.second) + ")"; }template <typename A, typename B, typename C>string to_string(tuple<A, B, C> p) {return "(" + to_string(get<0>(p)) + ", " + to_string(get<1>(p)) + ", " + to_string(get<2>(p)) + ")";}void debug_out() { cerr << endl; }template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {cerr << " " << to_string(H);debug_out(T...);}#ifndef LOCAL#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)#else#define debug(...) 0#endif// Find Set LSB = (x&(-x)), isPowerOfTwo = (x & (x-1))const int mod = 1e9 + 7;void solve(){int x, y;cin >> x >> y;if(x <= 4){if(y <= x)cout << "Yes\n";else cout << "No\n";}else cout << "Yes\n";}signed main(){ios_base::sync_with_stdio(false);cin.tie(NULL);cout << fixed << setprecision(10);int tt=1;cin >> tt;while(tt--){solve();}}