제출 #466893

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
466893		XBoRickie	Savrsen (COCI17_savrsen)	C++11	45 / 120	8 ms	8380 KiB

savrsen

#include <bits/stdc++.h>
using namespace std;
// Typedef
typedef string                     str;
typedef long double                ld;
typedef long long int              int64;
typedef unsigned long long int     uint64;
typedef std::pair<int, int>        PII;
typedef std::pair<int64, int64>    PLL;
typedef std::vector<int>           VI;
typedef std::vector<long long>     VLL;
// Define For-loop
#define FOR(i, j, k, in)           for (int i = (j); i < (k) ; i += (in))
#define FORW(i, j, k, in)          for (int i = (j); i <= (k); i += (in))
#define RFOR(i, j, k, in)          for (int i = (j); i >= (k); i -= (in))
// Define Data structure func
#define all(cont)                  cont.begin(), cont.end()
#define rall(cont)                 cont.rbegin(), cont.rend()
#define sz(cont)                   int((cont).size())
#define pb                         push_back
#define mp                         make_pair
#define fi                         first
#define se                         second
// Define number
#define IINF                       0x3f3f3f3f
#define LLINF                      1000111000111000111LL
#define PI                         3.1415926535897932384626433832795
// Other
#define lend                       '\n'
#define hardio(name)               freopen(name".inp","r",stdin), freopen(name".out","w",stdout);
void FastIO() { std::ios_base::sync_with_stdio(false); std::cin.tie(NULL); cin.exceptions(cin.failbit); srand(time(NULL)); }

const int MOD = 1e9 + 7, MOD2 = 1e9 + 9;
// ======================================================================

int f[1000006] = {};;

int main(int argc, char* argv[]) {
    FastIO();

    int l, r; cin >> l >> r;
    FORW(d, 1, r, 1) {
        FORW(x, 2ll * d, r, d) {
            f[x] -= d;
        }
    }

    int64 ans = 0;
    FORW(i, l, r, 1) ans += abs(i + f[i]);
    cout << ans << endl;


    return 0; }

• Subtask 1: 45 / 120