제출 #86363

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
86363		dimash241	Savrsen (COCI17_savrsen)	C++17	45 / 120	20 ms	16528 KiB

savrsen

# include <stdio.h>
# include <bits/stdc++.h>


#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define F first
#define S second
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

using namespace std;

inline bool isvowel (char c) {
	c = tolower(c);
    if (c == 'a' || c == 'e' || c == 'i' || c == 'y' || c == 'o' || c == 'u') return 1;
    return 0;
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
 
ll f[mxn];

int main () {               
	SpeedForce;
	int a, b;
	cin >> a >> b;
	for (int i = 2; i <= b; ++ i) {
		int it = i + i;
		while (it <= b) {
			f[it] += i;
			it += i;
		} 
	}
	ll ans = 0;
	for (int i = a; i <= b; ++ i)
		ans += abs(i - f[i] - (i > 1));
   	cout << ans;
    return Accepted;
}

// Coded By OB

• Subtask 1: 45 / 120