제출 #381884

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
381884		ne4eHbKa	Vepar (COCI21_vepar)	C++17	70 / 70	295 ms	14468 KiB

Main

#include <bits/stdc++.h>
using namespace std;
#ifndef _LOCAL
//#pragma GCC optimize("O3,Ofast")
#else
#pragma GCC optimize("O0")
#endif
template<typename t> inline void umin(t &a, const t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, const t b) {a = max(a, b);}
typedef pair<int, int> pii;
typedef long long ll;
typedef long double ld;
typedef int8_t byte;
ll time() {return chrono::system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
#define ft first
#define sd second
#define len(f) int((f).size())
#define bnd(f) (f).begin(), (f).end()
#define _ <<' '<<
const int inf = 1e9 + 5;
const ll inf64 = 4e18 + 5;
const int md = 998244353;
namespace MD {
    void add(int &a, const int b) {if((a += b) >= md) a -= md;}
    void sub(int &a, const int b) {if((a -= b) < 0) a += md;}
    int prod(const int a, const int b) {return ll(a) * b % md;}
};

vector<int> p;
const int N = 1e7 + 5;
bool f[N];

int pw(int n, int d) {
    int res = 0;
    while(n) res += n /= d;
    return res;
}

void solve() {
    int a, b, c, d;
    cin >> a >> b >> c >> d;
    --a, --c;
    for(int i : p)
        if(pw(b, i) - pw(a, i) > pw(d, i) - pw(c, i))
            return void(cout << "NE\n");
    cout << "DA\n";
}

signed main() {
    bool z = false;
    for(int i = 2; i < N; ++i) {
        if(f[i]) continue;
        p.push_back(i);
        if(z || (z = i * i >= N)) continue;
        for(int j = i * i; j < N; j += i)
            f[j] = true;
    }
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#ifndef _LOCAL
//    freopen("file.in", "r", stdin);
//    freopen("file.out", "w", stdout);
#else
    system("color a");
    freopen("in.txt", "r", stdin);
#endif
    int t; cin >> t;
    while(t--)
    solve();
}

• 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