Submission #747377

#	Time	Username	Problem	Language	Result	Execution time	Memory
747377		vjudge1	Vepar (COCI21_vepar)	C++17	30 / 70	61 ms	10108 KiB

Main

#include <bits/stdc++.h>

using namespace std;

const int maxn = 1e7+1;

bool prim[10000001];
vector<int> primek;

int szamol(int a, int p){
    int r = 0;
    for(int i = p; i <= a; i *= p){
        r += a/i;
    }
    return r;
}

void solve(){
    int a, b, c, d; cin>>a>>b>>c>>d;
    for(int p : primek){
        if(szamol(d, p)-szamol(c-1, p) < szamol(b, p)-szamol(a-1, p)){
            cout<<"NE\n";
            return;
        }
    }
    cout<<"DA\n"<<endl;
}

int main(){
    ios_base::sync_with_stdio(0); cin.tie(0);
    for(int i = 2; i * i <= maxn; i++){
        if(!prim[i]){
            primek.push_back(i);
            for(int j = i*i; j <= maxn; j+=i){
                prim[j] = 1;
            }
        }
    }
    int t; cin>>t;
    while(t--)solve();
    return 0;
}

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