#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
#define pb push_back
#define all(x) x.begin(), x.end()
const int N = 1e7+10;
int a, b, c, d, T, x, y;
vector<ll> primes;
vector<bool> is(N);
int main(){
cin.tie(0); ios::sync_with_stdio(0);
for(int i = 2; i < N; i++){
if(!is[i]){
primes.pb(i);
for(int j = i; j < N; j += i) is[j] = 1;
}
}
cin >> T;
while(T--){
cin >> a >> b >> c >> d;
bool ok = 1;
for(ll p: primes){
x = y = 0;
ll e = p;
while(e <= max(b, d)){
ll n = ((a+e-1) / e);
ll m = (b / e);
x += max(0LL, m-n+1);
n = ((c+e-1) / e);
m = (d / e);
y += max(0LL, m-n+1);
e *= p;
}
if(x>y) ok = 0;
}
if(ok) cout << "DA\n";
else cout << "NE\n";
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
109 ms |
9764 KB |
Output is correct |
2 |
Correct |
141 ms |
9872 KB |
Output is correct |
3 |
Correct |
95 ms |
9836 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
122 ms |
9824 KB |
Output is correct |
2 |
Correct |
93 ms |
9840 KB |
Output is correct |
3 |
Correct |
98 ms |
9800 KB |
Output is correct |
4 |
Correct |
95 ms |
9848 KB |
Output is correct |
5 |
Correct |
148 ms |
9840 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
94 ms |
9760 KB |
Output is correct |
2 |
Correct |
95 ms |
9848 KB |
Output is correct |
3 |
Correct |
98 ms |
9796 KB |
Output is correct |
4 |
Correct |
94 ms |
9828 KB |
Output is correct |
5 |
Correct |
99 ms |
9836 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
142 ms |
9840 KB |
Output is correct |
2 |
Correct |
140 ms |
9844 KB |
Output is correct |
3 |
Correct |
197 ms |
9848 KB |
Output is correct |
4 |
Correct |
170 ms |
9824 KB |
Output is correct |
5 |
Correct |
169 ms |
9836 KB |
Output is correct |
6 |
Correct |
141 ms |
9912 KB |
Output is correct |
7 |
Correct |
235 ms |
9844 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
200 ms |
9840 KB |
Output is correct |
2 |
Correct |
109 ms |
9848 KB |
Output is correct |
3 |
Correct |
112 ms |
9784 KB |
Output is correct |
4 |
Correct |
130 ms |
9844 KB |
Output is correct |
5 |
Correct |
140 ms |
9784 KB |
Output is correct |
6 |
Correct |
193 ms |
9784 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
198 ms |
9844 KB |
Output is correct |
2 |
Correct |
120 ms |
9832 KB |
Output is correct |
3 |
Correct |
112 ms |
9832 KB |
Output is correct |
4 |
Correct |
135 ms |
9844 KB |
Output is correct |
5 |
Correct |
144 ms |
9912 KB |
Output is correct |
6 |
Correct |
196 ms |
9840 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
196 ms |
9784 KB |
Output is correct |
2 |
Correct |
108 ms |
9784 KB |
Output is correct |
3 |
Correct |
122 ms |
9788 KB |
Output is correct |
4 |
Correct |
131 ms |
9848 KB |
Output is correct |
5 |
Correct |
133 ms |
9832 KB |
Output is correct |
6 |
Correct |
197 ms |
9848 KB |
Output is correct |
7 |
Correct |
226 ms |
9840 KB |
Output is correct |