Submission #1187135

#TimeUsernameProblemLanguageResultExecution timeMemory
1187135MoonnVepar (COCI21_vepar)C++20
70 / 70
212 ms87084 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;
ll sa(ll x,ll i)
{
    ll res=0,a=i;
    while(1)
    {
        if(x<a)
        break;
        res+=x/a;
        a*=i;
    }
    return res;
}
void solve()
{
    ll a,b,c,d;
    cin>>a>>b>>c>>d;
    for(ll x:pr)
    {
        if(sa(b,x)-sa(a-1,x)>sa(d,x)-sa(c-1,x))
        {
          //  cout<<sa(b,x)-sa(a,x)<<' '<<sa(d,x)-sa(c,x);
            cout<<"NE\n";
            return;
        }
    }
    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();
}//3 9 5 14
#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...