# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
240935 | 2020-06-21T14:21:41 Z | SamAnd | Savrsen (COCI17_savrsen) | C++17 | 1048 ms | 39548 KB |
#include <bits/stdc++.h> using namespace std; #define m_p make_pair #define all(x) (x).begin(),(x).end() #define sz(x) ((int)(x).size()) #define fi first #define se second typedef long long ll; mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count()); mt19937 rnf(2106); const int N = 10000007; int u[N]; void solv() { for (int i = 0; i < N; ++i) u[i] = i; for (int i = 1; i < N; ++i) { for (int j = i + i; j < N; j += i) u[j] -= i; } int l, r; scanf("%d%d", &l, &r); ll ans = 0; for (int i = l; i <= r; ++i) ans += abs(u[i]); printf("%lld\n", ans); } int main() { #ifdef SOMETHING freopen("input.txt", "r", stdin); //freopen("output.txt", "w", stdout); #endif // SOMETHING //ios_base::sync_with_stdio(false), cin.tie(0); solv(); return 0; } //while ((double)clock() / CLOCKS_PER_SEC <= 0.9){}
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 991 ms | 39416 KB | Output is correct |
2 | Correct | 999 ms | 39548 KB | Output is correct |
3 | Correct | 974 ms | 39544 KB | Output is correct |
4 | Correct | 986 ms | 39544 KB | Output is correct |
5 | Correct | 1036 ms | 39544 KB | Output is correct |
6 | Correct | 1014 ms | 39544 KB | Output is correct |
7 | Correct | 1048 ms | 39424 KB | Output is correct |
8 | Correct | 994 ms | 39544 KB | Output is correct |