秋祭 | 静岡高校工学部



卬高杯


提出詳細

提出id提出時刻ユーザー名問題言語判定状況判定実行時間
1149992023-10-25 09:39:14aradCcpp18/18WA6

#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" << ' ';
    }
    cout << endl;
}

sample1.txt WA 2
sample2.txt WA 2
sample3.txt WA 3
case1.txt WA 6
case2.txt WA 6
case3.txt WA 6
case4.txt WA 6
case5.txt WA 6
case6.txt WA 6
case7.txt WA 6
case8.txt WA 6
case9.txt WA 6
case10.txt WA 6
case11.txt WA 6
case12.txt WA 6
case13.txt WA 6
case14.txt WA 6
case15.txt WA 6
6 WA6 WA