제출 #917462

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
917462		LOLOLO	Vepar (COCI21_vepar)	C++17	70 / 70	94 ms	20432 KiB

Main

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

#define           f     first
#define           s     second
#define           pb    push_back
#define           ep    emplace
#define           eb    emplace_back
#define           lb    lower_bound
#define           ub    upper_bound
#define       all(x)    x.begin(), x.end()
#define      rall(x)    x.rbegin(), x.rend()
#define   uniquev(v)    sort(all(v)), (v).resize(unique(all(v)) - (v).begin())
#define     mem(f,x)    memset(f , x , sizeof(f))
#define        sz(x)    (int)(x).size()
#define  __lcm(a, b)    (1ll * ((a) / __gcd((a), (b))) * (b))
#define          mxx    *max_element
#define          mnn    *min_element
#define    cntbit(x)    __builtin_popcountll(x)
#define       len(x)    (int)(x.length())

const int N = 3e5 + 10;
const int lim = 1e7 + 10;
bool is[lim];
vector <ll> save;

void prepare() {
    for (ll i = 2; i < lim; i++) {
        if (is[i] == 0) {
            save.pb(i);
            for (ll j = i * i; j < lim; j += i)
                is[j] = 1;
        }
    }
}

ll get(ll x, ll n) {
    ll ans = 0, pr = x;
    while (x <= n) {
        ans += n / x;
        x *= pr;
    }

    return ans;
}

ll cal(ll x, ll l, ll r) {
    return get(x, r) - get(x, l - 1);
}

string solve() {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    for (auto x : save) {
        if (cal(x, a, b) > cal(x, c, d))
            return "NE";
    }

    return "DA";
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    prepare();
    int t = 1;
    cin >> t;

    while (t--) {
        //solve();
        cout << solve() << '\n';
    }

    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10