# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
381896 | VEGAnn | Vepar (COCI21_vepar) | C++14 | 1601 ms | 74868 KiB |
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 MX = int(1e7) + 10;
const int oo = 2e9;
int mn[MX], cnt[MX], now;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0);
#ifdef _LOCAL
freopen("in.txt","r",stdin);
#endif // _LOCAL
fill(mn, mn + MX, oo);
for (int i = 2; i < MX; i++){
if (mn[i] < oo) continue;
mn[i] = i;
if (ll(i) * ll(i) > MX) continue;
for (int j = i * i; j < MX; j += i)
mn[j] = min(mn[j], i);
}
int qq; cin >> qq;
for (; qq; qq--){
memset(cnt, sizeof(cnt), 0);
int a, b, c, d;
cin >> a >> b >> c >> d;
for (int i = c; i <= d; i++){
now = i;
while (now > 1){
cnt[mn[now]]++;
now /= mn[now];
}
}
bool ok = 1;
for (int i = a; i <= b && ok; i++){
now = i;
while (now > 1){
cnt[mn[now]]--;
if (cnt[mn[now]] < 0) {
ok = 0;
break;
}
now /= mn[now];
}
}
cout << (ok ? "DA\n" : "NE\n");
}
return 0;
}
Compilation message (stderr)
# | 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... |