Submission #872977

#	Time	Username	Problem	Language	Result	Execution time	Memory
872977		aeg	Vepar (COCI21_vepar)	C++14	30 / 70	1563 ms	852 KiB

Main

#include <unordered_map>
#include <iostream>

using namespace std;

#define F first
#define S second

unordered_map<int, int> ab, cd;

inline void factorize(int i, bool b) {
    for(int j=2; j<=i; j++) {
        while(i%j==0) {
            if(b) ab[j]++;
            else cd[j]++;
            i/=j;
        }
    }
}

inline void solve() {
    int a,b,c,d;
    cin >> a >> b >> c >> d;
    for(int i=a; i<=b; i++) factorize(i, true);
    for(int i=c; i<=d; i++) factorize(i, false);
    for(auto x:ab) {
        if(cd[x.F]<x.S) {
            cout << "NE\n";
            ab.clear();
            cd.clear();
            return;
        }
    }
    ab.clear();
    cd.clear();
    cout << "DA\n";
}

int main() {
    cin.tie(NULL)->sync_with_stdio(false);
    int t;
    cin >> t;
    while(t--) solve();
}

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