제출 #382051

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
382051		kartel	Vepar (COCI21_vepar)	C++14	70 / 70	345 ms	43908 KiB

Main

#include <bits/stdc++.h>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
//#include <time.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
//#define M ll(1e9 + 7)
#define M ll(998244353)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
#define pii pair <int, int>
#define all(x) (x).begin(), (x).end()
#define arr_all(x, n) (x + 1), (x + 1 + n)
#define vi vector<int>
#define eps (ld)1e-9
using namespace std;
typedef long long ll;
//using namespace __gnu_pbds;
//typedef tree <ll, null_type, less_equal <ll> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef double ld;
typedef unsigned long long ull;
typedef short int si;

const int N = 1e7 + 50;

vector <int> primes;
int pr[N];

int calc(int x, int prime) {
    int ret = 0;

    while (x) {
        ret += x / prime;
        x /= prime;
    }

    return ret;
}

int get(int l, int r, int x) {
    return calc(r, x) - calc(l - 1, x);
}

void solve() {
    int a, b, c, d;
    cin >> a >> b >> c >> d;

    bool good = 1;

    for (int i = 0; i < sz(primes); i++) {
        int inab = get(a, b, primes[i]);
        if (inab == 0) {
            continue;
        }

        int incd = get(c, d, primes[i]);

        if (incd < inab) {
            good = 0;
            break;
        }
    }

    cout << (good ? "DA" : "NE") << el;
}

int main()
{
//    mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());;
	ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
//	in("toys.in");
//	out("toys.out");
//    in("input.txt");
//    out("output.txt");
//    cerr.precision(9); cerr << fixed;

//    clock_t tStart = clock();

    for (int i = 2; i <= (int)1e7; i++) {
        if (pr[i]) {
            continue;
        }

        primes.pb(i);

        for (ll j = i * 1ll * i; j <= (int)1e7; j += i) {
            pr[j] = 1;
        }
    }

    int q;
    cin >> q;

    while (q--) {
        solve();
    }
}


/*

7
4 6 7 2 3 1 5
*/

• Subtask 1: 10 / 10
• Subtask 2: 10 / 10
• Subtask 3: 10 / 10
• Subtask 4: 10 / 10
• Subtask 5: 10 / 10
• Subtask 6: 10 / 10
• Subtask 7: 10 / 10