oj.uz

Submission #249182

# Submission time Handle Problem Language Result Execution time Memory
249182 2020-07-14T13:09:27 Z Vimmer Savrsen (COCI17_savrsen) C++14
120 / 120
 1039 ms 39552 KB 
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 10000100
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9

using namespace std;
//using namespace __gnu_pbds;

typedef long double ld;
typedef long long ll;
typedef short int si;
typedef array <int, 6> a6;

//typedef tree <int, null_type, less_equal<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;


int mk[N];

int main()
{
    //freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int l, r;

    cin >> l >> r;

    for (int i = 1; i <= r; i++)
        for (int j = i + i; j <= r; j += i) mk[j] += i;

    ll ans = 0;

    for (int i = l; i <= r; i++) ans += abs(i - mk[i]);

    cout << ans << endl;
}

Subtask #1
120.0 / 120.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 384 KB Output is correct
2 Correct 0 ms 384 KB Output is correct
3 Correct 2 ms 768 KB Output is correct
4 Correct 1039 ms 39520 KB Output is correct
5 Correct 1027 ms 39552 KB Output is correct
6 Correct 1027 ms 39544 KB Output is correct
7 Correct 948 ms 36452 KB Output is correct
8 Correct 152 ms 10240 KB Output is correct