#include <bits/stdc++.h>
#define ll long long
#define fi first
#define se second
#define mp make_pair
using namespace std;
void db() {cout << endl;}
template <typename T, typename ...U> void db(T a, U ...b) {
//return;
cout << a << ' ', db(b...);
}
#ifdef Cloud
#define file freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#else
#define file ios::sync_with_stdio(false); cin.tie(0)
#endif
const int inf = 1e9 + 1, N = 1e7 + 1, mod = 1e9 + 7;
vector<int> p;
int cnt(int l, int r, int x){
return r / x - (l - 1) / x;
}
void solve(){
int a, b, c, d;
cin >> a >> b >> c >> d;
for (int i : p){
if (i > d) break;
ll x = i, pre1 = 0, pre2 = 0, pw = 1, sum = 0;
while (x * i <= N) x *= i, pw++;
for (ll j = x; j > 1; j /= i){
sum += pw * (cnt(c, d, j) - pre1);
pre1 = cnt(c, d, j);
sum -= pw * (cnt(a, b, j) - pre2);
pre2 = cnt(a, b, j);
pw--;
}
if (sum < 0) return void(cout << "NE\n");
}
cout << "DA\n";
}
int main(){
file;
bool out[N]{};
for (int i = 2; i < N; i++){
if (!out[i]) p.push_back(i);
for (int j : p){
if (j * i >= N) break;
out[j * i] = 1;
}
}
int t;
cin >> t;
while (t--) solve();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
132 ms |
14224 KB |
Output is correct |
2 |
Correct |
132 ms |
14300 KB |
Output is correct |
3 |
Correct |
131 ms |
14284 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
140 ms |
14288 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
132 ms |
14212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
180 ms |
14256 KB |
Output is correct |
2 |
Correct |
158 ms |
14336 KB |
Output is correct |
3 |
Correct |
154 ms |
14324 KB |
Output is correct |
4 |
Correct |
168 ms |
14220 KB |
Output is correct |
5 |
Correct |
172 ms |
14380 KB |
Output is correct |
6 |
Correct |
191 ms |
14208 KB |
Output is correct |
7 |
Incorrect |
288 ms |
14304 KB |
Output isn't correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
229 ms |
14440 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
204 ms |
14388 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Incorrect |
204 ms |
14272 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |