oj.uz

Submission #541500

# Submission time Handle Problem Language Result Execution time Memory
541500 2022-03-23T17:04:52 Z AlperenT Vepar (COCI21_vepar) C++17
30 / 70
 62 ms 10196 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]){
            primes.push_back(i);
            for(int j = i * i; j < N; j += i) isprime[j] = false;
        }
    }
}

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 43 ms 10068 KB Output is correct
2 Correct 62 ms 10084 KB Output is correct
3 Correct 58 ms 10092 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 44 ms 10084 KB Output is correct
2 Correct 44 ms 10068 KB Output is correct
3 Correct 45 ms 10092 KB Output is correct
4 Correct 49 ms 10096 KB Output is correct
5 Correct 51 ms 10196 KB Output is correct

Subtask #3
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 48 ms 10100 KB Output is correct
2 Correct 49 ms 10068 KB Output is correct
3 Correct 45 ms 10084 KB Output is correct
4 Correct 47 ms 10068 KB Output is correct
5 Correct 43 ms 10108 KB Output is correct

Subtask #4
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 47 ms 10068 KB Output is correct
2 Correct 50 ms 10084 KB Output is correct
3 Correct 54 ms 10080 KB Output is correct
4 Correct 46 ms 10080 KB Output is correct
5 Correct 43 ms 10068 KB Output is correct
6 Correct 44 ms 10088 KB Output is correct
7 Incorrect 49 ms 10088 KB Output isn't correct
8 Halted 0 ms 0 KB -

Subtask #5
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 49 ms 10096 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 46 ms 10084 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #7
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 45 ms 10088 KB Output isn't correct
2 Halted 0 ms 0 KB -