//{ <defines>
#include <bits/stdc++.h>
using namespace std;
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,-O3")
#define fr(i, n) for(int i = 0; i < n; ++i)
#define fo(n) fr(i, n)
#define re return
#define ef else if
#define ifn(x) if(!(x))
#define _ << ' ' <<
#define ft first
#define sd second
#define ve vector
#define pb push_back
#define eb emplace_back
#define sz(x) int((x).size())
#define bnd(x) x.begin(), x.end()
#define clr(x, y) memset((x), (y), sizeof (x))
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef ve<int> vi;
inline ll time() {re chrono :: system_clock().now().time_since_epoch().count();}
mt19937 rnd(time());
mt19937_64 RND(time());
template<typename t> inline void umin(t &a, t b) {a = min(a, b);}
template<typename t> inline void umax(t &a, t b) {a = max(a, b);}
int md = 998244353;
inline int m_add(int&a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_sum(int a, int b) {a += b; if(a < 0) a += md; if(a >= md) a -= md; re a;}
inline int m_mul(int&a, int b) {re a = 1ll * a * b % md;}
inline int m_prod(int a, int b) {re 1ll * a * b % md;}
int m_bpow(ll A, ll b) {
int a = A % md;
ll ans = 1;
for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
(ans *= ans) %= md;
if(p & b)
(ans *= a) %= md;
}
re ans;
}
//const ld pi = arg(complex<ld>(-1, 0));
//const ld pi2 = pi + pi;
const int oo = 2e9;
const ll OO = 4e18;
//} </defines>
const int N = 2e5 + 5;
void solve() {
int a, b;
cin >> a >> b;
int *s = (int*) calloc(b + 1, 4);
int *p = (int*) malloc(b + 1 << 2);
int *f = (int*) malloc(b + 1 << 2);
for(int i = 2; i <= b; ++i) {
if(s[i]) continue;
for(int t = 1, j = i; j <= b; j += i, ++t)
s[j] = i, p[j] = t;
}
ll ans = 0;
for(int i = 1; i <= b; ++i) {
if(i == 1) {
f[i] = 1;
} else {
int x = s[i], y = 0, j = i;
for(; s[j] == x; j = p[j]) ++y;
ll u = f[j];
f[i] = f[j];
while(y--) f[i] += u *= x;
}
if(i >= a) ans += abs(f[i] - i - i);
}
cout << ans << endl;
free(s);
free(p);
free(f);
}
int main() {
#ifdef _LOCAL
freopen("in.txt", "r", stdin);
int tests; cin >> tests;
for(int test = 1; test <= tests; ++test) {
cerr << "case #" << test << endl;
solve();
cerr << endl;
}
#else
// freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);
ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0);
solve();
#endif
return 0;
}
Compilation message
savrsen.cpp: In function 'int m_bpow(ll, ll)':
savrsen.cpp:50:26: warning: suggest parentheses around '-' inside '<<' [-Wparentheses]
for(ll p = 1ll << 63 - __builtin_clzll(b); p; p >>= 1) {
~~~^~~~~~~~~~~~~~~~~~~~
savrsen.cpp: In function 'void solve()':
savrsen.cpp:69:30: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
int *p = (int*) malloc(b + 1 << 2);
~~^~~
savrsen.cpp:70:30: warning: suggest parentheses around '+' inside '<<' [-Wparentheses]
int *f = (int*) malloc(b + 1 << 2);
~~^~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
384 KB |
Output is correct |
| 2 |
Correct |
0 ms |
384 KB |
Output is correct |
| 3 |
Correct |
2 ms |
1536 KB |
Output is correct |
| 4 |
Correct |
413 ms |
117728 KB |
Output is correct |
| 5 |
Correct |
439 ms |
117752 KB |
Output is correct |
| 6 |
Correct |
431 ms |
117732 KB |
Output is correct |
| 7 |
Correct |
380 ms |
108536 KB |
Output is correct |
| 8 |
Correct |
97 ms |
30204 KB |
Output is correct |
