#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ar array
const int MX = 10000001;
bool p[MX];
vector<int> primes;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
memset(p, 1, sizeof(p));
for (int i = 2; i < MX; ++i) {
if (!p[i])
continue;
primes.push_back(i);
if ((ll)i * i >= MX)
continue;
for (int j = i * i; j < MX; j += i)
p[j] = 0;
}
int t; cin >> t;
for (int a, b, c, d; t--;) {
cin >> a >> b >> c >> d;
vector<int> ct(primes.size());
auto Upd = [&](int n, int i, int inc) {
int x = primes[i];
n /= x;
while(n) {
ct[i] += inc * n;
n /= x;
}
};
for (int i = 0; i < primes.size(); ++i) {
Upd(d, i, 1);
Upd(c - 1, i, -1);
Upd(b, i, -1);
Upd(a - 1, i, 1);
}
cout << (*min_element(ct.begin(), ct.end()) >= 0 ? "DA" : "NE") << "\n";
}
return 0;
}
Compilation message
Main.cpp: In function 'int main()':
Main.cpp:36:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
36 | for (int i = 0; i < primes.size(); ++i) {
| ~~^~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
255 ms |
15456 KB |
Output is correct |
2 |
Correct |
254 ms |
15456 KB |
Output is correct |
3 |
Correct |
263 ms |
15456 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
248 ms |
15456 KB |
Output is correct |
2 |
Correct |
254 ms |
15456 KB |
Output is correct |
3 |
Correct |
259 ms |
15456 KB |
Output is correct |
4 |
Correct |
266 ms |
15584 KB |
Output is correct |
5 |
Correct |
258 ms |
15456 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
243 ms |
15456 KB |
Output is correct |
2 |
Correct |
260 ms |
15456 KB |
Output is correct |
3 |
Correct |
259 ms |
15456 KB |
Output is correct |
4 |
Correct |
262 ms |
15612 KB |
Output is correct |
5 |
Correct |
255 ms |
15456 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
296 ms |
15584 KB |
Output is correct |
2 |
Correct |
279 ms |
15456 KB |
Output is correct |
3 |
Correct |
322 ms |
15584 KB |
Output is correct |
4 |
Correct |
302 ms |
15612 KB |
Output is correct |
5 |
Correct |
293 ms |
15456 KB |
Output is correct |
6 |
Correct |
223 ms |
15456 KB |
Output is correct |
7 |
Correct |
334 ms |
15464 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
326 ms |
15540 KB |
Output is correct |
2 |
Correct |
274 ms |
15540 KB |
Output is correct |
3 |
Correct |
263 ms |
15456 KB |
Output is correct |
4 |
Correct |
279 ms |
15452 KB |
Output is correct |
5 |
Correct |
284 ms |
15584 KB |
Output is correct |
6 |
Correct |
322 ms |
15456 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
327 ms |
15584 KB |
Output is correct |
2 |
Correct |
268 ms |
15624 KB |
Output is correct |
3 |
Correct |
281 ms |
15456 KB |
Output is correct |
4 |
Correct |
278 ms |
15584 KB |
Output is correct |
5 |
Correct |
284 ms |
15456 KB |
Output is correct |
6 |
Correct |
317 ms |
15584 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
327 ms |
15532 KB |
Output is correct |
2 |
Correct |
277 ms |
15584 KB |
Output is correct |
3 |
Correct |
260 ms |
15416 KB |
Output is correct |
4 |
Correct |
280 ms |
15456 KB |
Output is correct |
5 |
Correct |
278 ms |
15640 KB |
Output is correct |
6 |
Correct |
317 ms |
15524 KB |
Output is correct |
7 |
Correct |
332 ms |
15540 KB |
Output is correct |