提出詳細

提出id	提出時刻	ユーザー名	問題	言語	判定状況	判定	実行時間
115009	2023-10-25 10:01:31	sitini	D	cpp	17/17	WA	60

#if !__INCLUDE_LEVEL__
#include __FILE__

int main() {
    int N; cin >> N;
    for (int i = 0; i < N; i++) {
        double A; cin >> A;
        if (A >= 170) cout << "Yes" << " ";
        else cout << "No" << " ";
    }
    cout << endl;
}
#else

// ↓TEMPLATE↓
#include <bits/stdc++.h>
using namespace std;
#if __has_include(<atcoder/all>)
#include <atcoder/all>
using namespace atcoder;
#endif

#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
struct Fast {Fast() {std::cin.tie(0); ios::sync_with_stdio(false);}} fast;
#define endl '\n'
//cout << fixed << setprecision(15);
using ll = long long;
using ld = long double;
using vi = vector<int>;
using vll = vector<long long>;
using vvi = vector<vi>;
using vvll = vector<vll>;
using vs = vector<string>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
constexpr int mod = 1e9 + 7;
constexpr int Mod = 998244353;
constexpr int INF = 1e9;
constexpr ll LINF = 1e18;
const vector<int> dx = {1, 0, -1, 0, 1, -1, -1, 1};
const vector<int> dy = {0, 1, 0, -1, 1, 1, -1, -1};
template<class T> bool chmin(T &a, T b) {if(a>b) {a=b;return true;}return false;}
template<class T> bool chmax(T &a, T b) {if(a<b) {a=b;return true;}return false;}
template <class T> T gcd(T a, T b) {if (b == 0)return a; else return gcd(b, a % b);}
template <class T> inline T lcm(T a, T b) {return (a * b) / gcd(a, b);}
template<class T> istream &operator>>(istream &is, vector<T> &v) {for (auto &x : v){is >> x;}return is;}
template<class T> ostream &operator<<(ostream &os, vector<T> &v) {for(int i=0;i<v.size();i++){os<<v[i]<<(i+1==v.size()?"\n":" ");}return os;}
template<class... T> void input(T&... a){(cin >> ... >> a);}
template<class... T> constexpr auto min(T... a){return min(initializer_list<common_type_t<T...>>{a...});}
template<class... T> constexpr auto max(T... a){return max(initializer_list<common_type_t<T...>>{a...});}
template<class V, class H> void resize(vector<V>& v,const H head){v.resize(head);}
template<class V, class H, class... T> void resize(vector<V>& vec,const H& head,const T... tail){vec.resize(head);for(auto& v:vec)resize(v, tail...);}
template<class H> void input_set(istream& is,const int idx,vector<H>& head){is>>head[idx];}
template<class H,class... T>void input_set(istream& is,const int idx,vector<H>& head,T&... tail){input_set(is>>head[idx],idx,tail...);}
template<class H,class... T>void input_set(istream& is,vector<H>& head,T&... tail){for(int i=0;i<head.size();i++)input_set(is,i,head,tail...);}
template<class H,class... T>void input_set(vector<H>& head,T&... tail){input_set(cin,head,tail...);}
//#define int long long
#define pb emplace_back
#define mp make_pair
#define PQ priority_queue<int>
#define PQG priority_queue<int,vector<int>,greater<int>>
#define all(a) (a).begin(),(a).end()
#define fi first
#define se second
#define itn int
#define YES(bool) cout << ((bool) ? "YES" : "NO") << endl
#define yes(bool) cout << ((bool) ? "yes" : "no") << endl
#define Yes(bool) cout << ((bool) ? "Yes" : "No") << endl
#define POSSIBLE(bool) cout << ((bool) ? "POSSIBLE" : "IMPOSSIBLE") << endl
#define Possible(bool) cout << ((bool) ? "Possible" : "Impossible") << endl
#define INT(...) int __VA_ARGS__; input(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__; input(__VA_ARGS__)
#define STR(...) string __VA_ARGS__; input(__VA_ARGS__)
#define DBL(...) double __VA_ARGS__; input(__VA_ARGS__)
#define Sort(a) sort(all(a))
#define Rev(a) reverse(all(a))
#define Uniq(a) sort(all(a));a.erase(unique(all(a)),end(a))
// ↑TEMPLATE↑
#endif

sample1.txt WA 2
sample2.txt WA 2
sample3.txt WA 3
case1.txt WA 31
case2.txt WA 25
case3.txt WA 19
case4.txt WA 30
case5.txt WA 17
case6.txt WA 29
case7.txt WA 14
case8.txt WA 60
case9.txt WA 32
case10.txt WA 30
case11.txt WA 2
case12.txt WA 3
case13.txt WA 7
case14.txt WA 34
60 WA60 WA