제출 #388334

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
388334		phathnv	Vepar (COCI21_vepar)	C++11	70 / 70	318 ms	43812 KiB

Main

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

const int N = 1e7 + 7;

int p[N];
vector<int> primes;

int Calc(int x, int factor){
    int res = 0;
    while (x >= factor)
        res += (x /= factor);
    return res;
}

int Calc(int l, int r, int factor){
    return Calc(r, factor) - Calc(l - 1, factor);
}

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

    for(int i = 2; i < N; i++){
        if (p[i])
            continue;
        primes.push_back(i);
        for(int j = i; j < N; j += i)
            p[j] = i;
    }

    int t;
    cin >> t;
    while (t--){
        int a, b, c, d;
        cin >> a >> b >> c >> d;
        bool stop = 0;
        for(int factor : primes)
            if (Calc(c, d, factor) < Calc(a, b, factor)){
                cout << "NE\n";
                stop = 1;
                break;
            }
        if (!stop)
            cout << "DA\n";
    }

    return 0;
}

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10