oj.uz

Submission #872988

# Submission time Handle Problem Language Result Execution time Memory
872988 2023-11-14T08:42:37 Z aeg Vepar (COCI21_vepar) C++17
70 / 70
 91 ms 20504 KB 
#include <iostream>
#include <vector>

using namespace std;

#define PB push_back
typedef long long ll;

const ll maxn = 1e7 + 5;

bool prime[maxn];
vector<ll> primes;

inline ll szfact (ll a, ll p){
    ll ret = 0;
    for(ll i=p; i<=a; i*=p) {
        ret += a/i;
    }
    return ret;
}

inline void solve() {
    ll a,b,c,d;
    cin >> a >> b >> c >> d;
    for(auto p:primes) {
        if(szfact(b,p)-szfact(a-1,p)>szfact(d,p)-szfact(c-1,p)) {
            cout << "NE\n";
            return;
        }
    }
    cout << "DA\n";
}

int main() {
    cin.tie(NULL)->sync_with_stdio(false);
    ll t;
    cin >> t;
    for(ll i=2; i<maxn; i++) {
        if(prime[i]) continue;
        for(ll j=i*i; j<maxn; j+=i) prime[j] = true;
        primes.PB(i);
    }
    while(t--) solve();
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 36 ms 20504 KB Output is correct
2 Correct 45 ms 18884 KB Output is correct
3 Correct 30 ms 18892 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 19316 KB Output is correct
2 Correct 41 ms 18728 KB Output is correct
3 Correct 34 ms 18956 KB Output is correct
4 Correct 41 ms 20440 KB Output is correct
5 Correct 35 ms 19140 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 18892 KB Output is correct
2 Correct 40 ms 19856 KB Output is correct
3 Correct 40 ms 19816 KB Output is correct
4 Correct 36 ms 19396 KB Output is correct
5 Correct 36 ms 19268 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 55 ms 18884 KB Output is correct
2 Correct 46 ms 19148 KB Output is correct
3 Correct 34 ms 19656 KB Output is correct
4 Correct 60 ms 20344 KB Output is correct
5 Correct 45 ms 20336 KB Output is correct
6 Correct 49 ms 18716 KB Output is correct
7 Correct 91 ms 19912 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 19920 KB Output is correct
2 Correct 34 ms 18888 KB Output is correct
3 Correct 48 ms 18884 KB Output is correct
4 Correct 42 ms 18964 KB Output is correct
5 Correct 44 ms 20432 KB Output is correct
6 Correct 72 ms 19460 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 18796 KB Output is correct
2 Correct 34 ms 18892 KB Output is correct
3 Correct 40 ms 19148 KB Output is correct
4 Correct 37 ms 19908 KB Output is correct
5 Correct 41 ms 19820 KB Output is correct
6 Correct 73 ms 18612 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 18532 KB Output is correct
2 Correct 38 ms 19664 KB Output is correct
3 Correct 39 ms 20168 KB Output is correct
4 Correct 44 ms 19920 KB Output is correct
5 Correct 50 ms 19152 KB Output is correct
6 Correct 74 ms 19052 KB Output is correct
7 Correct 90 ms 20172 KB Output is correct