# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1059091 | vjudge1 | Sirni (COCI17_sirni) | C++17 | 41 ms | 2744 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
const int N = 1e5 + 3;
const int MX = 1e7 + 3;
bitset<MX> bs;
int n, p[N];
ll ans = 0;
int main () {
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
#define task "code"
if (fopen (task".inp", "r")) {
freopen (task".inp", "r", stdin);
freopen (task".out", "w", stdout);
}
cin >> n;
for (int i = 1; i <= n; ++ i) cin >> p[i];
sort (p + 1, p + n + 1);
for (int i = 1, x = 0; i <= n; ++ i) {
while (bs._Find_next(x) != bs.size() && bs._Find_next(x) <= p[i])
x = bs._Find_next(x);
if (i > 1) ans += (p[i] - x);
for (int j = p[i]; j < MX; j += p[i]) bs[j] = 1;
}
cout << ans;
return 0;
}
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... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |