Submission #1187068

#TimeUsernameProblemLanguageResultExecution timeMemory
1187068MoonnVepar (COCI21_vepar)C++20
30 / 70
1598 ms112812 KiB
#pragma GCC optimize("O3")//tle? #include<bits/stdc++.h>// #define ll long long #define endl "\n" #define AI ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0); using namespace std; vector<ll>pr; vector<ll>ma; ll n,m; void solve() { ll a,b,c,d,i,j,x; cin>>a>>b>>c>>d; map<ll,ll>mp; for(i=c;i<=d;i++) { j=i; while(j>1) { x=ma[j]; while(j%x==0) { mp[x]++; j/=x; } } } for(i=a;i<=b;i++) { j=i; while(j>1) { x=ma[j]; while(j%x==0) { mp[x]--; if(mp[x]<0) { cout<<"NE\n"; return; } j/=x; } } } cout<<"DA\n"; } int main() { AI //freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout); ll t=1,sz=1e7+3,i,j; ma.resize(sz,0); for(i=0;i<=sz;i++) ma[i]=i; for(i=2;i<=sz;i++) { if(ma[i]==i) { pr.push_back(i); for(j=i*i;j<=sz;j+=i) ma[j]=min(ma[j],i); } } cin>>t; while(t--) solve(); }
#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...