Submission #1104922

#TimeUsernameProblemLanguageResultExecution timeMemory
1104922dzhoz0Savrsen (COCI17_savrsen)C++17
120 / 120
446 ms39564 KiB
#include <bits/stdc++.h> using namespace std; const int MAXN = 1e7; int sieve[MAXN + 5]; void init() { memset(sieve, 0, sizeof(sieve)); for(long long i = 2; i <= MAXN; i++) { if(sieve[i] != 0) continue; sieve[i] = i; for(long long j = i * i; j <= MAXN; j += i) { sieve[j] = (sieve[j] == 0 ? i : sieve[j]); } } } long long f(int n) { long long res = 1; while(n > 1) { int d = sieve[n]; int e = 1; while(n % d == 0) e++, n /= d; long long sum = 0, pw = 1; while(e--) { sum += pw; pw *= d; } res *= sum; } return res; } int main() { init(); int l, r; cin >> l >> r; long long res = 0; for(int x = l; x <= r; x++) res += abs(x - (f(x) - x)); cout << res << '\n'; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...