oj.uz

답안 #89173

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
89173 2018-12-10T21:19:20 Z jasony123123 Savrsen (COCI17_savrsen) C++11
120 / 120
 1516 ms 40020 KB 
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <unordered_map>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/assoc_container.hpp>
using namespace std;
//using namespace __gnu_pbds;
#define FOR(i,start,end) for(int i=start;i<(int)(end);i++)
#define FORE(i,start,end) for(int i=start;i<=(int)end;i++)
#define RFOR(i,start,end) for(int i = start; i>end; i--)
#define RFORE(i,start,end) for(int i = start; i>=end; i--)
#define all(a) a.begin(), a.end()
#define mt make_tuple
#define v vector
#define sf scanf
#define pf printf
#define dvar(x) cout << #x << " := " << x << "\n"
#define darr(x,n) FOR(i,0,n) cout << #x << "[" << i << "]" << " := " << x[i] << "\n"
typedef long long ll;
typedef long double ld;
typedef pair<int, int > pii;
typedef pair<ll, ll> pll;
//template <class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<class T> void minn(T &a, T b) { a = min(a, b); }
template<class T> void maxx(T &a, T b) { a = max(a, b); }
inline void io() {
#ifdef LOCAL_PROJECT 
	freopen("input.in", "r", stdin); freopen("output.out", "w", stdout);
#else 
	/* online submission */
#endif 
	ios_base::sync_with_stdio(false); cin.tie(NULL);
}
/**************************COCI 2016-2017 R6 P4*************************/

int A, B, sum[(int)1e7 + 1];

int main() {
	io();
	cin >> A >> B;
	FORE(i, 1, B) {
		for (int j = i; j <= B; j += i)
			sum[j] += i;
	}
	ll ans = 0;
	FORE(i, A, B) {
		ans += abs(i + i - sum[i]);
	}
	cout << ans << "\n";
	return 0;
}

Subtask #1
120.0 / 120.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 504 KB Output is correct
3 Correct 5 ms 880 KB Output is correct
4 Correct 1428 ms 39708 KB Output is correct
5 Correct 1366 ms 39864 KB Output is correct
6 Correct 1516 ms 40020 KB Output is correct
7 Correct 1297 ms 40020 KB Output is correct
8 Correct 145 ms 40020 KB Output is correct