/**
* author: wxhtzdy
* created: 03.07.2022 11:06:33
**/
#include <bits/stdc++.h>
using namespace std;
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
const int MAX = 1e7 + 5;
vector<bool> pr(MAX, true);
for (int i = 2; i < MAX; i++) {
if (pr[i]) {
for (long long j = i * 1LL * i; j < MAX; j += i) {
pr[j] = false;
}
}
}
vector<int> primes;
for (int i = 2; i < MAX; i++) {
if (pr[i]) {
primes.push_back(i);
}
}
auto Count = [&](int x, int L, int R) {
long long p = x, cnt = 0;
while (p <= R) {
cnt += (R / p - (L - 1) / p);
p *= x;
}
return cnt;
};
int tt;
cin >> tt;
while (tt--) {
int a, b, c, d;
cin >> a >> b >> c >> d;
bool ok = true;
for (int i = 0; i < (int) primes.size(); i++) {
if (Count(primes[i], a, b) > Count(primes[i], c, d)) {
ok = false;
break;
}
}
cout << (ok ? "DA" : "NE") << '\n';
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
89 ms |
5696 KB |
Output is correct |
2 |
Correct |
111 ms |
5756 KB |
Output is correct |
3 |
Correct |
77 ms |
5752 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
80 ms |
5756 KB |
Output is correct |
2 |
Correct |
79 ms |
5688 KB |
Output is correct |
3 |
Correct |
77 ms |
5764 KB |
Output is correct |
4 |
Correct |
88 ms |
5720 KB |
Output is correct |
5 |
Correct |
74 ms |
5732 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
79 ms |
5748 KB |
Output is correct |
2 |
Correct |
78 ms |
5760 KB |
Output is correct |
3 |
Correct |
87 ms |
5764 KB |
Output is correct |
4 |
Correct |
83 ms |
5768 KB |
Output is correct |
5 |
Correct |
79 ms |
5716 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
109 ms |
5752 KB |
Output is correct |
2 |
Correct |
93 ms |
5752 KB |
Output is correct |
3 |
Correct |
85 ms |
5756 KB |
Output is correct |
4 |
Correct |
107 ms |
5756 KB |
Output is correct |
5 |
Correct |
96 ms |
5752 KB |
Output is correct |
6 |
Correct |
111 ms |
5752 KB |
Output is correct |
7 |
Correct |
209 ms |
5664 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
125 ms |
5692 KB |
Output is correct |
2 |
Correct |
79 ms |
5700 KB |
Output is correct |
3 |
Correct |
83 ms |
5788 KB |
Output is correct |
4 |
Correct |
87 ms |
5752 KB |
Output is correct |
5 |
Correct |
99 ms |
5760 KB |
Output is correct |
6 |
Correct |
147 ms |
5776 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
121 ms |
5760 KB |
Output is correct |
2 |
Correct |
79 ms |
5732 KB |
Output is correct |
3 |
Correct |
89 ms |
5668 KB |
Output is correct |
4 |
Correct |
84 ms |
5692 KB |
Output is correct |
5 |
Correct |
89 ms |
5752 KB |
Output is correct |
6 |
Correct |
141 ms |
5768 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
155 ms |
5744 KB |
Output is correct |
2 |
Correct |
88 ms |
5744 KB |
Output is correct |
3 |
Correct |
80 ms |
5744 KB |
Output is correct |
4 |
Correct |
92 ms |
5760 KB |
Output is correct |
5 |
Correct |
86 ms |
5756 KB |
Output is correct |
6 |
Correct |
154 ms |
5784 KB |
Output is correct |
7 |
Correct |
195 ms |
5748 KB |
Output is correct |