# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
872987 |
2023-11-14T08:36:19 Z |
aeg |
Vepar (COCI21_vepar) |
C++14 |
|
22 ms |
20480 KB |
#include <iostream>
#include <vector>
using namespace std;
#define PB push_back
const int maxn = 1e7 + 5;
bool prime[maxn];
vector<int> primes;
inline int szfact (int a, int p){
int ret = 0;
for(int i=p; i<=a; i*=p) {
ret += a/i;
}
return ret;
}
inline void solve() {
int a,b,c,d;
cin >> a >> b >> c >> d;
for(auto p:primes) {
if(szfact(b,p)-szfact(a-1,p)>szfact(d,p)-szfact(c-1,p)) {
cout << "NE\n";
return;
}
}
cout << "DA\n";
}
int main() {
cin.tie(NULL)->sync_with_stdio(false);
int t;
cin >> t;
for(int i=2; i<maxn; i++) {
if(prime[i]) continue;
for(int j=i*i; j<maxn; j+=i) prime[j] = true;
primes.PB(i);
}
while(t--) solve();
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
19 ms |
20312 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
19 ms |
20316 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
20 ms |
20316 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
20 ms |
20480 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
21 ms |
20312 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
22 ms |
20316 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
21 ms |
20316 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |