#include "bits/stdc++.h" #include #include #include "atcoder/all" #include //#include //using namespace boost::multiprecision; // std::fixed << std::setprecision(10) << using namespace std; using namespace atcoder; using ll = long long; using ull = unsigned long long; using mint = modint998244353; using mint2 = modint1000000007; const double eps = 1e-9; #define REP(i, n) for (ll i = 0; i < ll(n); ++i) #define REPI(i, init, n) for (ll i = init; i < ll(n); ++i) #define REPD(i, init) for (ll i = init; i >=0; --i) #define REPDI(i, init, n) for (ll i = init; i >=n; --i) #define REPE(i, c) for (const auto& i : c) #define TCASE() ll _ttt; cin >> _ttt; while(_ttt--) using vl = vector; using vvl = vector; using vvvl = vector; #define VL(a, n) vector a; a.assign(n, 0); #define VLI(a, n) vector a; a.assign(n, 0); for(auto& x : a) cin >> x; #define VSI(a, n) vector a; a.assign(n, ""); for(auto& x : a) cin >> x; #define VVLI(a, n, m, init) vector> a(n); for(auto& x : a) x.assign(m, init); using vd = vector; using pl = pair; struct uv { ll u; ll v; ll c; }; #define VUVI(a, n) vector a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;} #define VUVCI(a, n) vector a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;} vvl to_edge(const ll n, const vector& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; } vvl to_edge_d(const ll n, const vector& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; } template using pql = priority_queue; template using pqg = priority_queue, greater>; using vm = vector; using vvm = vector; void yn(bool f) { std::cout << (f ? "Yes" : "No") << endl; }; template void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } }; template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } }; const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値 auto gmax(const auto& a, const auto& b) { return a > b ? a : b; }; auto gmin(const auto& a, const auto& b) { return a < b ? a : b; }; bool chmin(auto& a, const auto& b) { const auto olda = a; a = gmin(a, b); return olda != a; } bool chmax(auto& a, const auto& b) { const auto olda = a; a = gmax(a, b); return olda != a; } template void mysort(T& v) { std::sort(begin(v), end(v)); }; template void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); }; template void myrev(T& v) { std::reverse(begin(v), end(v)); }; template [[nodiscard]] V myat(const T& mp, const K& key) { return mp.find(key) == mp.end() ? V() : mp.at(key); } long long ceil(const long long a, const long long b) { return (a + b - 1) / b; } struct xy { double x; double y; }; //内積 double dot(const xy& a, const xy& b) { return a.x * b.x + a.y * b.y; } //cosθ double costheta(const xy& a, const xy& b) { return dot(a, b) / sqrt(dot(a, a) * dot(b, b)); } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << std::fixed << std::setprecision(10); ll a, b, c; cin >> a >> b >> c; bool ok = false; REPI(i, 1, b + c - a + 1) { REPI(j, 1, b + c - a + 1) { ll la = a + i + j; if (la >= b + c) continue; if (c >= la + b) continue; if (b >= la + c) continue; //余弦定理より double cosA = (b * b + c * c - la * la) / (2.0 * b * c); double sinA = sqrt(1.0 - cosA * cosA); double h = c * sinA; double tw = c * cosA - b; double dy = h / sqrt(h * h + tw * tw); double dx = tw / sqrt(h * h + tw * tw); xy vc = { c*cosA, c*sinA }; xy vb = { b, 0 }; xy vad = { b + dx * i, dy * i }; xy vae = { vc.x - dx * j, vc.y - dy * j }; if (abs(costheta(vb, vad) - costheta(vae, vc)) < 1e-10) { ok = true; break; } } if (ok) break; } yn(ok); return 0; }