# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
747379 | vjudge1 | Vepar (COCI21_vepar) | C++17 | 61 ms | 10104 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int maxn = 1e7+1;
bool prim[10000001];
vector<int> primek;
int szamol(int a, int p){
int r = 0;
for(int i = p; i <= a; i *= p){
r += a/i;
}
return r;
}
void solve(){
int a, b, c, d; cin>>a>>b>>c>>d;
for(int p : primek){
if(szamol(d, p)-szamol(c-1, p) < szamol(b, p)-szamol(a-1, p)){
cout<<"NE\n";
return;
}
}
cout<<"DA\n"<<endl;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |