oj.uz

답안 #515543

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
515543 2022-01-19T08:32:32 Z KoD Vepar (COCI21_vepar) C++17
70 / 70
 341 ms 14432 KB 
#include <bits/stdc++.h>

using std::vector;
using std::array;
using std::pair;
using std::tuple;

int main() {
    std::ios_base::sync_with_stdio(false);
    std::cin.tie(nullptr);
    const int MAX = 10000000;
    vector<char> is_prime(MAX + 1, true);
    is_prime[0] = is_prime[1] = false;
    vector<int> prime;
    for (int i = 2; i <= MAX; ++i) {
        if (is_prime[i]) {
            prime.push_back(i);
            for (int j = i + i; j <= MAX; j += i) {
                is_prime[j] = false;
            }
        }
    }
    const auto count = [&](int x, int p) {
        int ret = 0;
        while (x > 0) {
            ret += x /= p;
        }
        return ret;
    };
    int T;
    std::cin >> T;
    while (T--) {
        int a, b, c, d;
        std::cin >> a >> b >> c >> d;
        a -= 1, c -= 1;
        bool f = true;
        for (const int p : prime) {
            if (count(b, p) - count(a, p) > count(d, p) - count(c, p)) {
                f = false;
                break;
            }
        }
        std::cout << (f ? "DA" : "NE") << '\n';
    }    
    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 238 ms 14288 KB Output is correct
2 Correct 244 ms 14320 KB Output is correct
3 Correct 166 ms 14260 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 224 ms 14300 KB Output is correct
2 Correct 213 ms 14304 KB Output is correct
3 Correct 202 ms 14260 KB Output is correct
4 Correct 220 ms 14284 KB Output is correct
5 Correct 183 ms 14312 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 216 ms 14312 KB Output is correct
2 Correct 193 ms 14296 KB Output is correct
3 Correct 212 ms 14400 KB Output is correct
4 Correct 220 ms 14296 KB Output is correct
5 Correct 222 ms 14312 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 277 ms 14260 KB Output is correct
2 Correct 218 ms 14308 KB Output is correct
3 Correct 209 ms 14316 KB Output is correct
4 Correct 258 ms 14300 KB Output is correct
5 Correct 208 ms 14316 KB Output is correct
6 Correct 229 ms 14268 KB Output is correct
7 Correct 341 ms 14300 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 255 ms 14308 KB Output is correct
2 Correct 192 ms 14316 KB Output is correct
3 Correct 238 ms 14272 KB Output is correct
4 Correct 220 ms 14312 KB Output is correct
5 Correct 238 ms 14304 KB Output is correct
6 Correct 252 ms 14308 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 270 ms 14288 KB Output is correct
2 Correct 181 ms 14220 KB Output is correct
3 Correct 261 ms 14308 KB Output is correct
4 Correct 204 ms 14300 KB Output is correct
5 Correct 217 ms 14376 KB Output is correct
6 Correct 261 ms 14304 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 259 ms 14308 KB Output is correct
2 Correct 210 ms 14400 KB Output is correct
3 Correct 199 ms 14304 KB Output is correct
4 Correct 213 ms 14304 KB Output is correct
5 Correct 221 ms 14432 KB Output is correct
6 Correct 262 ms 14320 KB Output is correct
7 Correct 312 ms 14308 KB Output is correct