Submission #497972

#	Time	Username	Problem	Language	Result	Execution time	Memory
497972		abc864197532	Vepar (COCI21_vepar)	C++17	0 / 70	522 ms	78612 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#define lli long long int
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define pii pair <int, int>
#define X first
#define Y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
void abc() {cout << endl;}
template <typename T, typename ...U> void abc(T a, U ...b) {
    cout << a << ' ', abc(b...);
}
template <typename T> void printv(T l, T r) {
    while (l != r) cout << *l << " \n"[++l == r];
}
template <typename A, typename B> istream& operator >> (istream& o, pair<A, B> &a) {
    return o >> a.X >> a.Y;
}
template <typename A, typename B> ostream& operator << (ostream& o, pair<A, B> a) {
    return o << '(' << a.X << ", " << a.Y << ')';
}
template <typename T> ostream& operator << (ostream& o, vector<T> a) {
    if (a.empty())
        return o << "{}";
    bool is = false;
    for (T i : a) {o << (is ? ' ' : '{'), is = true, o << i;}
    return o << '}';
}
template <typename T> struct vv : vector <vector <T>> {
    vv(int n, int m, T v) : vector <vector <T>> (n, vector <T>(m, v)) {}
    vv() {}
};
template <typename T> struct vvv : vector <vv <T>> {
    vvv(int n, int m, int k, T v) : vector <vv <T>> (n, vv <T>(m, k, v)) {}
    vvv() {}
};
#ifdef Doludu
#define test(args...) abc("[" + string(#args) + "]", args)
#define owo freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout)
#else
#define test(args...) void(0)
#define owo ios::sync_with_stdio(false); cin.tie(0)
#endif
const int mod = 1e9 + 7, N = 10000010, logN = 17, K = sqrt(N) + 87, M = N * 40;

int lp[N], cur[N];

int main () {
    owo;
    iota(lp, lp + N, 0);
    for (int i = 2; i < N; ++i) if (lp[i] == i) {
        for (int j = i + i; j < N; j += i) if (lp[j] == j) {
            lp[j] = i;
        }
    }
    int t;
    cin >> t;
    while (t--) {
        int a, b, c, d;
        cin >> a >> b >> c >> d;
        for (int i = 2; i < N; ++i) if (lp[i] == i) {
            int now = i;
            while (now < N) {
                cur[i] -= b / now - (a - 1) / now;
                cur[i] += d / now - (c - 1) / now;
                now *= i;
            }
        }
        bool is = true;
        for (int i = 0; i < N; ++i) if (cur[i] < 0) {
            is = false;
            break;
        }
        cout << (is ? "DA\n" : "NE\n");
    }
}

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