提出 #72506649

---

ソースコード 拡げる

#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <set>
#include <cmath>
#include <iomanip>
#include <stack>
#include <queue>
#include <deque>
#include <bitset>
#include <tuple>
#include <map>
#include <functional>
#include <fstream>
#include <climits>
#include <numeric>

#define fi first
#define se second
#define rep(i,n) for(ll i=0;i<(n);i++)
#define rrep(i,n) for(ll i=(n)-1;i>=0;i--)
#define orep(i,n) for(ll i=1;i<=(n);i++)

#define nfor(i,s,n) for(ll i=(s);i<(n);i++)
#define dfor(i,s,n) for(ll i=(s)-1;i>=n;i--)
#define INF 2e18//9223372036854775807

#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()

#define chmax(x,y) x = max(x,y)
#define chmin(x,y) x = min(x,y)

#define pb push_back
#define pob pop_back

#define vc vector

#define YES cout << "Yes" << endl;
#define NO cout << "No" << endl;
#define YN {cout << "Yes" << endl;}else{cout << "No" << endl;}
#define dame cout << -1 << endl;

#define vc_unique(v) v.erase(unique(v.begin(), v.end()), v.end())
#define vc_remove(v,x) v.erase(remove(v.begin(), v.end(),x), v.end())
#define vc_rotate(v) rotate(v.begin(), v.begin()+1, v.end())

#define pop_cnt(s) ll(popcount(uint64_t(s)))
#define next_p(v) next_permutation(v.begin(),v.end())

#ifndef ONLINE_JUDGE
#define _GLIBCXX_DEBUG
#endif

using namespace std;
using ll = long long;
using ld = long double;
using pll = pair<ll,ll>;
using vvvvvl = vector<vector<vector<vector<vector<ll> > > > >;
using vvvvl = vector<vector<vector<vector<ll> > > >;
using vvvl = vector<vector<vector<ll> > >;
using vvl = vector<vector<ll> >;
using vl = vector<ll>;
using vb = vector<bool>;
using vvb = vector<vector<bool> >;
using Graph = vector<vector<ll> >;

template<class T> using pq = priority_queue<T,vc<T>,less<T> >;
template<class T> using pq_g = priority_queue<T,vc<T>,greater<T> >;

vector<ll> dx = {0,1,0,-1};vector<ll> ddx = {1,1,0,-1,-1,-1,0,1};
vector<ll> dy = {1,0,-1,0};vector<ll> ddy = {0,1,1,1,0,-1,-1,-1};

bool out_grid(ll i, ll j, ll h, ll w){//trueならcontinueする
    return(!(0 <= i && i < h && 0 <= j && j<w));
}

ll MOD = 998244353;

ll modpow(ll x,ll y,ll m){
    ll a = x;
    a %= m;
    ll cnt = 0;
    ll ans = 1;
    while(y > 0){
        if((1ll << cnt) & y){
            y ^= (1ll << cnt);
            ans *= a;
            ans %= m;
        }
        a = a*a;
        a %= m;
        cnt++;
    }
    return ans;
}

ll npow(ll x,ll y){
    ll a = x;
    ll cnt = 0;
    ll ans = 1;
    while(y > 0){
        if((1ll << cnt) & y){
            y ^= (1ll << cnt);
            ans *= a;
        }
        a = a*a;
        cnt++;
    }
    return ans;
}

void print(ld x){printf("%.20Lf\n", x);}

////////////////////////////////////////////////////////////////

ll GCD(ll A,ll B){
    if(B==0){
        return A; //ベースケース
    }
    return GCD(B,A%B);
}

ll LCM(ll N,ll M){
    return N/GCD(N,M) * M;
}

bool same(char a,char b){
    if(a==b){
        return true;
    }else if(a=='0' && b=='o'){
        return true;
    }else if(a=='o' && b=='0'){
        return true;
    }else if(a=='l' && b=='1'){
        return true;
    }else if(a=='1' && b=='l'){
        return true;
    }else{
        return false;
    }
}
    

ll zoro(ll n,ll d){ //　ｎ月にｄ以下でｎのゾロ目の日は何日あるのか数える
    ll cnt = 0;
    if(n>=10){
        if(n%10==(n/10)%10 && n%10!=0){
            n = n%10;
        }else{
            return 0;
        }
}

    for(ll i=1;i<=d;i++){
        if(i<10){
            if(i==n){
                cnt += 1;
            }
        }else{
            if(i%10==n && (i/10)%10==n){
                cnt += 1;
            }
        }
    }
    return cnt;
}





int main() {

    


    ll P,Q ,X ,Y;
    cin >> P >> Q >> X >> Y;

    if(P<=X && X<=P+99 && Q<=Y && Y<=Q+99){
        cout << "Yes\n";
        return 0;
    }else{
        cout <<  "No\n";
        return 0;
    }



}

    

提出情報

ジャッジ結果