# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
388334 | phathnv | Vepar (COCI21_vepar) | C++11 | 318 ms | 43812 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;
typedef long long ll;
const int N = 1e7 + 7;
int p[N];
vector<int> primes;
int Calc(int x, int factor){
int res = 0;
while (x >= factor)
res += (x /= factor);
return res;
}
int Calc(int l, int r, int factor){
return Calc(r, factor) - Calc(l - 1, factor);
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
for(int i = 2; i < N; i++){
if (p[i])
continue;
primes.push_back(i);
for(int j = i; j < N; j += i)
# | 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... |