#include<bits/stdc++.h>
using namespace std;
long long t, a, b, c, d, s, s1;
bool chk[10000001];
vector<long long> prim;
long long sol(long long v,long long k)
{
long long ans = 0;
while (v)
{
ans += v/k;
v /= k;
}
return ans;
}
void findprime()
{
for(int i = 2; i <= 5000000; i++)
{
if(!chk[i])
{
prim.push_back(i);
for(int j = i * 2; j <= 5000000; j += i)
{
chk[j] = 1;
}
}
}
}
int main()
{
ios::sync_with_stdio (0);
cin.tie (0);
cout.tie (0);
findprime();
cin >> t;
while(t--)
{
cin >> a >> b >> c >> d;
bool ck = 0;
for (int v : prim)
{
if (sol(b, v) - sol(a - 1, v) > sol(d, v) - sol(c - 1, v))
{
ck = 1;
break;
}
}
if(!ck)
{
cout << "DA" << endl;
}
else
{
cout << "NE" << endl;
}
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
47 ms |
9420 KB |
Output is correct |
2 |
Correct |
58 ms |
9408 KB |
Output is correct |
3 |
Correct |
24 ms |
9364 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
48 ms |
9388 KB |
Output is correct |
2 |
Correct |
42 ms |
9412 KB |
Output is correct |
3 |
Correct |
45 ms |
9412 KB |
Output is correct |
4 |
Correct |
48 ms |
9396 KB |
Output is correct |
5 |
Correct |
30 ms |
9420 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
47 ms |
9420 KB |
Output is correct |
2 |
Correct |
35 ms |
9420 KB |
Output is correct |
3 |
Correct |
43 ms |
9388 KB |
Output is correct |
4 |
Correct |
41 ms |
9440 KB |
Output is correct |
5 |
Correct |
48 ms |
9440 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
83 ms |
9448 KB |
Output is correct |
2 |
Correct |
42 ms |
9420 KB |
Output is correct |
3 |
Correct |
27 ms |
9420 KB |
Output is correct |
4 |
Correct |
56 ms |
9420 KB |
Output is correct |
5 |
Correct |
49 ms |
9420 KB |
Output is correct |
6 |
Correct |
46 ms |
9472 KB |
Output is correct |
7 |
Incorrect |
95 ms |
9420 KB |
Output isn't correct |
8 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
82 ms |
9440 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
78 ms |
9468 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
78 ms |
9364 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |