제출 #388333

#제출 시각아이디문제언어결과실행 시간메모리
388333phathnvVepar (COCI21_vepar)C++11
30 / 70
1591 ms78604 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...