# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
380444 | penguinhacker | Vepar (COCI21_vepar) | C++14 | 334 ms | 15640 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 ll long long
#define ar array
const int MX = 10000001;
bool p[MX];
vector<int> primes;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
memset(p, 1, sizeof(p));
for (int i = 2; i < MX; ++i) {
if (!p[i])
continue;
primes.push_back(i);
if ((ll)i * i >= MX)
continue;
for (int j = i * i; j < MX; j += i)
p[j] = 0;
}
int t; cin >> t;
for (int a, b, c, d; t--;) {
cin >> a >> b >> c >> d;
vector<int> ct(primes.size());
auto Upd = [&](int n, int i, int inc) {
int x = primes[i];
n /= x;
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... |