秋祭 | 静岡高校工学部



卬高杯


提出詳細

提出id提出時刻ユーザー名問題言語判定状況判定実行時間
1150012023-10-25 09:40:23aradDcpp17/17AC206

#include <bits/stdc++.h>
using namespace std;
//#include <atcoder/all>
//using namespace atcoder;
using ll = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using VS = vector<string>;
using P = pair<ll,ll>;
using VP = vector<P>;
#define rep(i, n) for (ll i = 0; i < ll(n); i++)
#define out(x) cout << x << endl
#define dout(x) cout << fixed << setprecision(10) << x << endl
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(x) (int)(x.size())
#define re0 return 0
#define pcnt __builtin_popcountll
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
constexpr int inf = 1e9;
constexpr ll INF = 1e18;
//using mint = modint1000000007;
//using mint = modint998244353;
int di[4] = {1,0,-1,0};
int dj[4] = {0,1,0,-1};

int main(){
    ll n;
    cin >> n;
    auto f = [&](string s){
        ll res = 0;
        rep(i,sz(s)){
            if(s[i] == '.') continue;
            res *= 10;
            res += s[i]-'0';
        }
        return res;
    };
    rep(i,n){
        string s;
        cin >> s;
        ll a = f(s);
        if(a >= 1700) cout << "Yes";
        else cout << "No";
        if(i != n-1) cout << ' ';
        else cout << endl;
    }
}

sample1.txt AC 2
sample2.txt AC 2
sample3.txt AC 3
case1.txt AC 195
case2.txt AC 147
case3.txt AC 143
case4.txt AC 161
case5.txt AC 109
case6.txt AC 170
case7.txt AC 46
case8.txt AC 206
case9.txt AC 203
case10.txt AC 200
case11.txt AC 2
case12.txt AC 3
case13.txt AC 8
case14.txt AC 76
206 AC206 AC