#include <iostream>
#include <vector>
using namespace std;
#define PB push_back
const int maxn = 1e7 + 5;
bool prime[maxn];
vector<int> primes;
inline int szfact (int a, int p){
int ret = 0;
for(int i=p; i<=a; i*=p) {
ret += a/i;
}
return ret;
}
inline void solve() {
int a,b,c,d;
cin >> a >> b >> c >> d;
for(auto p:primes) {
if(szfact(b,p)-szfact(a-1,p)>szfact(d,p)-szfact(c-1,p)) {
cout << "NE\n";
return;
}
}
cout << "DA\n";
}
int main() {
cin.tie(NULL)->sync_with_stdio(false);
int t;
cin >> t;
for(int i=2; i<maxn; i++) {
if(prime[i]) continue;
for(int j=i*2; j<=1e7+1; j+=i) prime[j] = true;
primes.PB(i);
}
while(t--) solve();
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
63 ms |
16072 KB |
Output is correct |
2 |
Correct |
79 ms |
15736 KB |
Output is correct |
3 |
Correct |
59 ms |
14528 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
64 ms |
15560 KB |
Output is correct |
2 |
Correct |
69 ms |
15976 KB |
Output is correct |
3 |
Correct |
67 ms |
16076 KB |
Output is correct |
4 |
Correct |
68 ms |
15816 KB |
Output is correct |
5 |
Correct |
56 ms |
14540 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
69 ms |
16076 KB |
Output is correct |
2 |
Correct |
80 ms |
14696 KB |
Output is correct |
3 |
Correct |
69 ms |
15048 KB |
Output is correct |
4 |
Correct |
66 ms |
15564 KB |
Output is correct |
5 |
Correct |
67 ms |
15564 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
59 ms |
15648 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
72 ms |
15052 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
68 ms |
14540 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
72 ms |
15308 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |