oj.uz

답안 #373823

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
373823 2021-03-05T20:44:45 Z Nimbostratus Vepar (COCI21_vepar) C++17
70 / 70
 320 ms 14568 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ub upper_bound
#define lb lower_bound
#define clean(a,s) memset((a),0,sizeof((a)[0])*(s))
#define all(x) (x).begin() , (x).end()
#define fi first
#define se second
#define int int
using pii = pair<int,int>;
using ll = long long;
const int maxn = 1e7+5;
const int inf = 2e9;
const int mod = 1e9+7;

int t,a,b,c,d;
vector<int> prime;
bool composite[maxn];

int count(int x,int p) {
	int cnt = 0;
	int cur = 1;
	while(cur <= x/p) {
		cur *= p;
		cnt += x/cur;
	}
	return cnt;
}

int32_t main () {
	//freopen("in","r",stdin); freopen("out","w",stdout);
	ios_base::sync_with_stdio(0); cout.tie(0); cin.tie(0);
	for(int i=2;i<=maxn-5;i++) {
		if(composite[i]) continue;
		prime.pb(i);
		for(ll j=1ll*i*i;j<=maxn-5;j+=i)
			composite[j] = true;
	}
	cin >> t;
	while(t--) {
		cin >> a >> b >> c >> d;
		bool ans = true;
		for(int p : prime) {
			if(count(b,p)-count(a-1,p) > count(d,p)-count(c-1,p)) {
				ans = false;
				break;
			}
		}
		cout << (ans ? "DA" : "NE") << endl;
	}
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 171 ms 14308 KB Output is correct
2 Correct 230 ms 14308 KB Output is correct
3 Correct 119 ms 14564 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 190 ms 14308 KB Output is correct
2 Correct 160 ms 14308 KB Output is correct
3 Correct 161 ms 14308 KB Output is correct
4 Correct 169 ms 14436 KB Output is correct
5 Correct 129 ms 14308 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 185 ms 14308 KB Output is correct
2 Correct 146 ms 14472 KB Output is correct
3 Correct 166 ms 14308 KB Output is correct
4 Correct 172 ms 14436 KB Output is correct
5 Correct 173 ms 14436 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 250 ms 14308 KB Output is correct
2 Correct 169 ms 14308 KB Output is correct
3 Correct 126 ms 14456 KB Output is correct
4 Correct 195 ms 14308 KB Output is correct
5 Correct 175 ms 14392 KB Output is correct
6 Correct 182 ms 14308 KB Output is correct
7 Correct 320 ms 14308 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 234 ms 14392 KB Output is correct
2 Correct 121 ms 14308 KB Output is correct
3 Correct 184 ms 14308 KB Output is correct
4 Correct 182 ms 14436 KB Output is correct
5 Correct 166 ms 14568 KB Output is correct
6 Correct 236 ms 14308 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 239 ms 14308 KB Output is correct
2 Correct 121 ms 14308 KB Output is correct
3 Correct 193 ms 14308 KB Output is correct
4 Correct 152 ms 14308 KB Output is correct
5 Correct 169 ms 14308 KB Output is correct
6 Correct 230 ms 14308 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 238 ms 14308 KB Output is correct
2 Correct 157 ms 14308 KB Output is correct
3 Correct 155 ms 14308 KB Output is correct
4 Correct 190 ms 14308 KB Output is correct
5 Correct 153 ms 14308 KB Output is correct
6 Correct 234 ms 14308 KB Output is correct
7 Correct 318 ms 14308 KB Output is correct