#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e7 + 7;
int p[N];
vector<int> primes;
int Calc(int x, int factor){
int res = 0;
while (x >= factor)
res += (x /= factor);
return res;
}
int Calc(int l, int r, int factor){
return Calc(r, factor) - Calc(l - 1, factor);
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
for(int i = 2; i < N; i++){
if (p[i])
continue;
primes.push_back(i);
for(int j = i; j < N; j += i)
p[j] = i;
}
int t;
cin >> t;
while (t--){
int a, b, c, d;
cin >> a >> b >> c >> d;
bool stop = 0;
for(int factor : primes)
if (Calc(c, d, factor) < Calc(a, b, factor)){
cout << "NE\n";
stop = 1;
break;
}
if (!stop)
cout << "DA\n";
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
272 ms |
43580 KB |
Output is correct |
2 |
Correct |
270 ms |
43580 KB |
Output is correct |
3 |
Correct |
249 ms |
43580 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
260 ms |
43648 KB |
Output is correct |
2 |
Correct |
255 ms |
43652 KB |
Output is correct |
3 |
Correct |
254 ms |
43640 KB |
Output is correct |
4 |
Correct |
256 ms |
43644 KB |
Output is correct |
5 |
Correct |
258 ms |
43648 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
259 ms |
43648 KB |
Output is correct |
2 |
Correct |
247 ms |
43644 KB |
Output is correct |
3 |
Correct |
262 ms |
43580 KB |
Output is correct |
4 |
Correct |
256 ms |
43660 KB |
Output is correct |
5 |
Correct |
261 ms |
43572 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
283 ms |
43608 KB |
Output is correct |
2 |
Correct |
282 ms |
43652 KB |
Output is correct |
3 |
Correct |
253 ms |
43688 KB |
Output is correct |
4 |
Correct |
269 ms |
43672 KB |
Output is correct |
5 |
Correct |
261 ms |
43656 KB |
Output is correct |
6 |
Correct |
271 ms |
43580 KB |
Output is correct |
7 |
Correct |
318 ms |
43680 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
295 ms |
43660 KB |
Output is correct |
2 |
Correct |
254 ms |
43648 KB |
Output is correct |
3 |
Correct |
265 ms |
43652 KB |
Output is correct |
4 |
Correct |
272 ms |
43628 KB |
Output is correct |
5 |
Correct |
262 ms |
43720 KB |
Output is correct |
6 |
Correct |
306 ms |
43664 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
293 ms |
43580 KB |
Output is correct |
2 |
Correct |
254 ms |
43752 KB |
Output is correct |
3 |
Correct |
272 ms |
43612 KB |
Output is correct |
4 |
Correct |
257 ms |
43656 KB |
Output is correct |
5 |
Correct |
260 ms |
43664 KB |
Output is correct |
6 |
Correct |
298 ms |
43644 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
290 ms |
43780 KB |
Output is correct |
2 |
Correct |
256 ms |
43568 KB |
Output is correct |
3 |
Correct |
255 ms |
43796 KB |
Output is correct |
4 |
Correct |
276 ms |
43656 KB |
Output is correct |
5 |
Correct |
257 ms |
43812 KB |
Output is correct |
6 |
Correct |
299 ms |
43644 KB |
Output is correct |
7 |
Correct |
316 ms |
43776 KB |
Output is correct |