結果
問題 | No.1220 yukipoker |
ユーザー |
![]() |
提出日時 | 2020-09-04 21:53:52 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 44 ms / 2,000 ms |
コード長 | 3,289 bytes |
コンパイル時間 | 2,096 ms |
コンパイル使用メモリ | 194,744 KB |
最終ジャッジ日時 | 2025-01-14 05:36:13 |
ジャッジサーバーID (参考情報) |
judge5 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 25 |
ソースコード
#include <bits/stdc++.h>using namespace std;#define rep2(i, m, n) for (int i = (m); i < (n); ++i)#define rep(i, n) rep2(i, 0, n)#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)#define drep(i, n) drep2(i, n, 0)#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()#ifdef LOCALvoid debug_out() { cerr << endl; }template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << ' ' << H; debug_out(T...); }#define debug(...) cerr << 'L' << __LINE__ << " [" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl#else#define debug(...) (void(0))#define dump(x) (void(0))#endiftemplate<typename T> using V = vector<T>;template<typename T> using P = pair<T, T>;using ll = long long;using ld = long double;using Vi = V<int>; using VVi = V<Vi>;using Vl = V<ll>; using VVl = V<Vl>;using Vd = V<ld>; using VVd = V<Vd>;using Vb = V<bool>; using VVb = V<Vb>;using Pi = P<int>;using Pl = P<ll>;using Pd = P<ld>;template<typename T> using priority_queue_rev = priority_queue<T, vector<T>, greater<T>>;template<typename T> vector<T> make_vec(size_t n, T a) { return vector<T>(n, a); }template<typename... Ts> auto make_vec(size_t n, Ts... ts) { return vector<decltype(make_vec(ts...))>(n, make_vec(ts...)); }template<typename T> inline int sz(T &x) { return x.size(); }template<typename T> inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; }template<typename T> inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; }template<typename T1, typename T2> istream &operator>>(istream &is, pair<T1, T2> &p) { is >> p.first >> p.second; return is; }template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) { os << '(' << p.first << ", " << p.second << ')'; returnos; }template<typename T> istream &operator>>(istream &is, vector<T> &v) { for (auto &e : v) is >> e; return is; }template<typename T> ostream &operator<<(ostream &os, const vector<T> &v) { for (auto &e : v) os << e << ' '; return os; }template<typename T> inline int count_between(vector<T> &a, T l, T r) { return lower_bound(all(a), r) - lower_bound(all(a), l); } // [l, r)inline ll cDiv(const ll x, const ll y) { return (x+y-1) / y; } // ceil(x/y)inline int fLog2(const ll x) { assert(x > 0); return 63-__builtin_clzll(x); } // floor(log2(x))inline int cLog2(const ll x) { assert(x > 0); return (x == 1) ? 0 : 64-__builtin_clzll(x-1); } // ceil(log2(x))inline int popcount(const ll x) { return __builtin_popcountll(x); }inline void fail() { cout << "No" << '\n'; exit(0); }struct fast_ios { fast_ios(){ cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;// const int INF = 1<<30;// const ll INFll = 1ll<<60;// const ld EPS = 1e-10;// const ld PI = acos(-1.0);// const int MOD = int(1e9)+7;// const int MOD = 998244353;int main() {const int N = int(1e5)+5;Vd s(N);rep(i, N-1) s[i+1] = s[i] + log(i+1);int q; cin >> q;rep(_, q) {int n, m, k; cin >> n >> m >> k;ld F = s[n] - s[k] - s[n-k];ld S = log(n-k+1) + log(m) * (k-1);if (F < S) cout << "Flush\n";else cout << "Straight\n";}}