oj.uz

Submission #464450

# Submission time Handle Problem Language Result Execution time Memory
464450 2021-08-13T08:50:47 Z TheScrasse Vepar (COCI21_vepar) C++14
70 / 70
 342 ms 43864 KB 
#include <bits/stdc++.h>
using namespace std;

#define nl "\n"
#define nf endl
#define ll long long
#define pb push_back
#define _ << ' ' <<

#define INF (ll)1e18
#define mod 998244353
#define maxn 10000010

int i, i1, j, k, k1, t, n, m, res, flag[10], a, b, c, d, er[maxn];
vector<int> pr;

int pdc(int a, int p) {
    if (a < p) return 0;
    return a / p + pdc(a / p, p);
}

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

    /* #if !ONLINE_JUDGE && !EVAL
        ifstream cin("input.txt");
        ofstream cout("output.txt");
    #endif */

    for (i = 0; i < maxn; i++) er[i] = i;
    for (i = 2; i < maxn; i++) {
        if (er[i] != i) continue;
        for (j = 2 * i; j < maxn; j += i) er[j] = i;
    }

    for (i = 2; i < maxn; i++) {
        if (er[i] == i) pr.pb(i);
    }

    cin >> t;
    while (t--) {
        cin >> a >> b >> c >> d; flag[0] = 1;
        for (auto u : pr) {
            if (pdc(d, u) - pdc(c - 1, u) - pdc(b, u) + pdc(a - 1, u) < 0) flag[0] = 0;
        }

        if (flag[0] == 1) cout << "DA" << nl;
        else cout << "NE" << nl;
    }

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 274 ms 43632 KB Output is correct
2 Correct 269 ms 43568 KB Output is correct
3 Correct 276 ms 43644 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 272 ms 43648 KB Output is correct
2 Correct 290 ms 43704 KB Output is correct
3 Correct 286 ms 43652 KB Output is correct
4 Correct 269 ms 43600 KB Output is correct
5 Correct 279 ms 43640 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 282 ms 43644 KB Output is correct
2 Correct 283 ms 43580 KB Output is correct
3 Correct 285 ms 43644 KB Output is correct
4 Correct 289 ms 43644 KB Output is correct
5 Correct 280 ms 43580 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 308 ms 43648 KB Output is correct
2 Correct 307 ms 43708 KB Output is correct
3 Correct 319 ms 43576 KB Output is correct
4 Correct 306 ms 43644 KB Output is correct
5 Correct 309 ms 43632 KB Output is correct
6 Correct 281 ms 43632 KB Output is correct
7 Correct 329 ms 43580 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 331 ms 43672 KB Output is correct
2 Correct 290 ms 43640 KB Output is correct
3 Correct 280 ms 43692 KB Output is correct
4 Correct 300 ms 43652 KB Output is correct
5 Correct 298 ms 43580 KB Output is correct
6 Correct 336 ms 43660 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 327 ms 43644 KB Output is correct
2 Correct 294 ms 43644 KB Output is correct
3 Correct 291 ms 43864 KB Output is correct
4 Correct 300 ms 43644 KB Output is correct
5 Correct 327 ms 43708 KB Output is correct
6 Correct 342 ms 43760 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 337 ms 43576 KB Output is correct
2 Correct 287 ms 43636 KB Output is correct
3 Correct 284 ms 43700 KB Output is correct
4 Correct 288 ms 43640 KB Output is correct
5 Correct 294 ms 43580 KB Output is correct
6 Correct 338 ms 43640 KB Output is correct
7 Correct 327 ms 43580 KB Output is correct