# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
808742 | Tunglam07 | Vepar (COCI21_vepar) | C++17 | 95 ms | 9472 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;
long long t, a, b, c, d, s, s1;
bool chk[10000001];
vector<long long> prim;
long long sol(long long v,long long k)
{
long long ans = 0;
while (v)
{
ans += v/k;
v /= k;
}
return ans;
}
void findprime()
{
for(int i = 2; i <= 5000000; i++)
{
if(!chk[i])
{
prim.push_back(i);
for(int j = i * 2; j <= 5000000; j += i)
{
chk[j] = 1;
}
}
# | 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... |