2021年“图森未来杯”全国程序设计邀请赛（校外组）D题题解

int cal(int num, int p)
{
    if (num == 0)
        return 0;
    return cal(num / p, p) + num / p;
}

#include <bits/stdc++.h>

using namespace std;

const int N = 1e7;

vector<int> prime;
bool is_prime[N + 1];

void sieve()
{
    for (int i = 2; i <= N; i++)
    {

        if (!is_prime[i])
            prime.push_back(i);
        for (int j = 0; prime[j] <= N / i; j++)
        {
            is_prime[prime[j] * i] = true;
            if (i % prime[j] == 0)
                break;
        }
    }
}

int cal(int num, int p)
{
    if (num == 0)
        return 0;
    return cal(num / p, p) + num / p;
}

int main()
{
    sieve();
    int t;
    cin >> t;
    while (t--)
    {
        int l1, r1, l2, r2;
        cin >> l1 >> r1 >> l2 >> r2;

        bool ok = true;
        for (int i = 0; i < (int)prime.size(); i++)
        {
            int p = prime[i];
            int fac1 = cal(r2, p) + cal(l1 - 1, p);
            int fac2 = cal(l2 - 1, p) + cal(r1, p);
            if (fac1 < fac2)
            {
                ok = false;
                break;
            }
        }
        if (ok)
            puts("Yes");
        else
            puts("No");
    }

    return 0;
}