oj.uz

Submission #917462

# Submission time Handle Problem Language Result Execution time Memory
917462 2024-01-28T08:46:04 Z LOLOLO Vepar (COCI21_vepar) C++17
70 / 70
 94 ms 20432 KB 
#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.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 19564 KB Output is correct
2 Correct 58 ms 19408 KB Output is correct
3 Correct 40 ms 18640 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 18628 KB Output is correct
2 Correct 38 ms 18752 KB Output is correct
3 Correct 39 ms 19560 KB Output is correct
4 Correct 39 ms 18896 KB Output is correct
5 Correct 40 ms 18968 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 43 ms 18640 KB Output is correct
2 Correct 36 ms 19620 KB Output is correct
3 Correct 45 ms 18672 KB Output is correct
4 Correct 40 ms 20340 KB Output is correct
5 Correct 45 ms 20432 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 19140 KB Output is correct
2 Correct 48 ms 20424 KB Output is correct
3 Correct 36 ms 18884 KB Output is correct
4 Correct 63 ms 19288 KB Output is correct
5 Correct 46 ms 18892 KB Output is correct
6 Correct 50 ms 20172 KB Output is correct
7 Correct 90 ms 19048 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 20164 KB Output is correct
2 Correct 37 ms 19920 KB Output is correct
3 Correct 53 ms 20336 KB Output is correct
4 Correct 45 ms 19404 KB Output is correct
5 Correct 43 ms 19656 KB Output is correct
6 Correct 75 ms 19948 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 19872 KB Output is correct
2 Correct 32 ms 19652 KB Output is correct
3 Correct 46 ms 19396 KB Output is correct
4 Correct 44 ms 19664 KB Output is correct
5 Correct 45 ms 19404 KB Output is correct
6 Correct 74 ms 19152 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 20172 KB Output is correct
2 Correct 39 ms 18524 KB Output is correct
3 Correct 40 ms 20168 KB Output is correct
4 Correct 45 ms 19660 KB Output is correct
5 Correct 41 ms 20424 KB Output is correct
6 Correct 74 ms 18640 KB Output is correct
7 Correct 94 ms 19916 KB Output is correct