# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1191673 | SmuggingSpun | Vepar (COCI21_vepar) | C++20 | 127 ms | 1656 KiB |
#include<bits/stdc++.h>
#define taskname "B"
using namespace std;
const int lim = 1e7 + 5;
bitset<lim>is_prime;
int fact_count(int n, int p){
int ans = 0, k = p;
while(true){
int temp = n / k;
ans += temp;
if(temp < p){
break;
}
k *= p;
}
return ans;
}
int a, b, c, d;
bool check(int p){
return fact_count(b, p) - fact_count(a - 1, p) > fact_count(d, p) - fact_count(c - 1, p);
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
}
is_prime.set();
for(int i = 3; i * i < lim; i += 2){
if(is_prime.test(i)){
for(int j = i * i; j < lim; j += i << 1){
is_prime.reset(j);
}
}
}
int _t;
cin >> _t;
for(int _ = 0; _ < _t; _++){
cin >> a >> b >> c >> d;
if(check(2)){
cout << "NE\n";
continue;
}
bool ans = true;
for(int i = 3; i < lim; i += 2){
if(is_prime.test(i) && check(i)){
ans = false;
break;
}
}
cout << (ans ? "DA\n" : "NE\n");
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |