This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 1e7 + 7;
int p[N], cnt[N];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
for(int i = 2; i < N; i++){
if (p[i])
continue;
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;
memset(cnt, 0, sizeof(cnt));
for(int i = a; i <= b; i++){
int x = i;
while (x > 1){
cnt[p[x]]--;
x /= p[x];
}
}
for(int i = c; i <= d; i++){
int x = i;
while (x > 1){
cnt[p[x]]++;
x /= p[x];
}
}
bool ok = 1;
for(int i = 1; i < N; i++)
ok &= (cnt[i] >= 0);
cout << (ok? "DA" : "NE") << '\n';
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |