oj.uz

답안 #372992

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
372992 2021-03-02T23:39:27 Z sam571128 Vepar (COCI21_vepar) C++14
70 / 70
 413 ms 87136 KB 
#include <bits/stdc++.h>

#define int long long
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

using namespace std;

const int N = 1e7+5;
int isprime[N];
vector<int> primes;

void init(){
	fill(isprime,isprime+N,1);
	for(int i = 2;i < N;i++){
		if(isprime[i]){
			primes.push_back(i);
			for(int j = i*i;j < N;j += i){
				isprime[j] = 0;
			}
		}
	}
}

int val(int n, int p){
	int res = 0;
	while(n){
		res += n/p;
		n/=p;
	}
	return res;
}

void solve(){
	int a,b,c,d;
	cin >> a >> b >> c >> d;
	//O(psize*4log_psize(C))
	for(auto x : primes){
		if(val(c-1,x)+val(b,x)>val(d,x)+val(a-1,x)){
			cout << "NE\n";
			return;
		}
	}
	cout << "DA\n";
}

signed main(){
	fastio
	init();
	int t;
	cin >> t;
	while(t--) solve();
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 305 ms 87008 KB Output is correct
2 Correct 327 ms 87008 KB Output is correct
3 Correct 257 ms 87008 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 305 ms 87008 KB Output is correct
2 Correct 291 ms 87008 KB Output is correct
3 Correct 305 ms 87004 KB Output is correct
4 Correct 317 ms 87028 KB Output is correct
5 Correct 258 ms 87008 KB Output is correct

Subtask #3
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 312 ms 87040 KB Output is correct
2 Correct 273 ms 87004 KB Output is correct
3 Correct 291 ms 87008 KB Output is correct
4 Correct 288 ms 87008 KB Output is correct
5 Correct 305 ms 87008 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 344 ms 87008 KB Output is correct
2 Correct 279 ms 87008 KB Output is correct
3 Correct 248 ms 87008 KB Output is correct
4 Correct 303 ms 87008 KB Output is correct
5 Correct 289 ms 87128 KB Output is correct
6 Correct 292 ms 87008 KB Output is correct
7 Correct 413 ms 87008 KB Output is correct

Subtask #5
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 348 ms 87004 KB Output is correct
2 Correct 252 ms 87132 KB Output is correct
3 Correct 307 ms 87008 KB Output is correct
4 Correct 289 ms 87008 KB Output is correct
5 Correct 295 ms 87008 KB Output is correct
6 Correct 346 ms 87008 KB Output is correct

Subtask #6
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 350 ms 86984 KB Output is correct
2 Correct 239 ms 87004 KB Output is correct
3 Correct 322 ms 87008 KB Output is correct
4 Correct 272 ms 87008 KB Output is correct
5 Correct 296 ms 86980 KB Output is correct
6 Correct 344 ms 87004 KB Output is correct

Subtask #7
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 343 ms 87008 KB Output is correct
2 Correct 284 ms 87008 KB Output is correct
3 Correct 275 ms 87008 KB Output is correct
4 Correct 297 ms 87008 KB Output is correct
5 Correct 279 ms 87008 KB Output is correct
6 Correct 346 ms 87136 KB Output is correct
7 Correct 410 ms 87008 KB Output is correct