oj.uz

Submission #541503

# Submission time Handle Problem Language Result Execution time Memory
541503 2022-03-23T17:06:53 Z AlperenT Vepar (COCI21_vepar) C++17
70 / 70
 250 ms 14352 KB 
#include <bits/stdc++.h>

using namespace std;

const int N = 1e7 + 5;

long long t, a, b, c, d, cnt1, cnt2;

bool isprime[N];

vector<int> primes;

void precalc(){
    fill(isprime + 2, isprime + N, true);

    for(int i = 2; i * i < N; i++){
        if(isprime[i]){
            for(int j = i * i; j < N; j += i) isprime[j] = false;
        }
    }

    for(int i = 2; i < N; i++) if(isprime[i]) primes.push_back(i);
}

long long findexp(int n, int x){
    long long cnt = 0;

    while(n > 0){
        cnt += n / x;

        n /= x;
    }

    return cnt;
}

void solve(){
    cin >> a >> b >> c >> d;

    for(auto p : primes){
        cnt1 = findexp(b, p) - findexp(a - 1, p);
        cnt2 = findexp(d, p) - findexp(c - 1, p);

        if(cnt1 > cnt2){
            cout << "NE\n";
            return;
        }
    }

    cout << "DA\n";
}

int main(){
    ios_base::sync_with_stdio(false);cin.tie(NULL);

    precalc();

    cin >> t;

    while(t--){
        solve();
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 142 ms 14312 KB Output is correct
2 Correct 171 ms 14312 KB Output is correct
3 Correct 102 ms 14352 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 146 ms 14296 KB Output is correct
2 Correct 134 ms 14312 KB Output is correct
3 Correct 147 ms 14316 KB Output is correct
4 Correct 145 ms 14312 KB Output is correct
5 Correct 115 ms 14300 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 153 ms 14288 KB Output is correct
2 Correct 136 ms 14296 KB Output is correct
3 Correct 142 ms 14280 KB Output is correct
4 Correct 145 ms 14300 KB Output is correct
5 Correct 142 ms 14312 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 207 ms 14300 KB Output is correct
2 Correct 132 ms 14296 KB Output is correct
3 Correct 108 ms 14312 KB Output is correct
4 Correct 150 ms 14300 KB Output is correct
5 Correct 144 ms 14312 KB Output is correct
6 Correct 135 ms 14312 KB Output is correct
7 Correct 250 ms 14300 KB Output is correct

Subtask #5
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 191 ms 14276 KB Output is correct
2 Correct 106 ms 14300 KB Output is correct
3 Correct 174 ms 14276 KB Output is correct
4 Correct 140 ms 14300 KB Output is correct
5 Correct 142 ms 14272 KB Output is correct
6 Correct 195 ms 14272 KB Output is correct

Subtask #6
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 188 ms 14272 KB Output is correct
2 Correct 87 ms 14316 KB Output is correct
3 Correct 176 ms 14232 KB Output is correct
4 Correct 123 ms 14276 KB Output is correct
5 Correct 148 ms 14256 KB Output is correct
6 Correct 198 ms 14296 KB Output is correct

Subtask #7
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 192 ms 14348 KB Output is correct
2 Correct 128 ms 14300 KB Output is correct
3 Correct 130 ms 14264 KB Output is correct
4 Correct 142 ms 14312 KB Output is correct
5 Correct 127 ms 14232 KB Output is correct
6 Correct 189 ms 14308 KB Output is correct
7 Correct 245 ms 14312 KB Output is correct