# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
541503 | AlperenT | Vepar (COCI21_vepar) | C++17 | 250 ms | 14352 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;
const int N = 1e7 + 5;
long long t, a, b, c, d, cnt1, cnt2;
bool isprime[N];
vector<int> primes;
void precalc(){
fill(isprime + 2, isprime + N, true);
for(int i = 2; i * i < N; i++){
if(isprime[i]){
for(int j = i * i; j < N; j += i) isprime[j] = false;
}
}
for(int i = 2; i < N; i++) if(isprime[i]) primes.push_back(i);
}
long long findexp(int n, int x){
long long cnt = 0;
while(n > 0){
cnt += n / x;
# | 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... |