Submission #3271638

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define IOS ios::sync_with_stdio(false), cin.tie(0)
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, a, b) for (int i = a; i < b; i++)
#define ALL(x) (x).begin(), (x).end()
#define dump(x) cout << (x) << endl
#define LMAX 9223372036854775807LL
#define LMIN -9223372036854775807LL
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val){
    fill((T *)array, (T *)(array + N), val);
}

const ll INF = 1e18;
const ll mod = 1e9 + 7;

int main(){
    int n ,k;
    cin >> n >> k;
    ll cnt = 0;
    if(k == 0){
        dump(n * n);
    }
    else{
        for(int b = k + 1;b <= n;b++){
            cnt += (n / b) * (b - k);
            ll t = n / b;
            t *= b;
            if(t + k <= n)cnt += n - (t + k) + 1; 
        }
        dump(cnt);
    }
    
}

Submission Info

Judge Result