提出 #73368248

---

ソースコード 拡げる

#include <bits/stdc++.h>
#define loop(n) for (int _i = 0; _i < (n); _i++)
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rrep(i, n) for (int i = (n); i >= 0; --i)
#define rep2(i, r, n) for (int i = (r); i < (n); ++i)
#define all(obj) begin(obj), end(obj)
#define yes cout << "Yes"
#define no cout << "No"
#define sho fixed<<setprecision(10)
using namespace std;
using ll = long long;
using ld = long double;
using ui = unsigned int;
using ull = unsigned long long;
using hll = __int128_t ;
using pll = pair<ll, ll>;
using pii = pair<int, int>;
using pdd = pair<double,double>;
using vi  = vector<int>;
using vll = vector<ll>;
using vd  = vector<double>;
using vvi  = vector<vector<int>>;
using vvll = vector<vector<ll>>;
template<class T> using vec = vector<T>;
constexpr int INF = 1<<30;
constexpr long long LLINF = 1LL<<60;
template<typename T> bool chmin(T &a,const T &b){return (b<a)? (a=b,true) : false;}
template<typename T> bool chmax(T &a,const T &b){return (a<b)? (a=b,true) : false;}
template<typename T> void sort2(T &x, T &y) {if (x > y) swap(x, y);}
template<typename T> using min_queue = priority_queue<T, vector<T>, greater<T>>;
template<typename T> constexpr T max_lim() {
    static_assert(std::is_integral_v<T> || std::is_floating_point_v<T>, "T must be numeric");
    return std::numeric_limits<T>::max();
}
vector<pair<int,int>> dir4 = {{-1,0},{1,0},{0,-1},{0,1}};
vector<pair<int,int>> dir8 = {{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};
vector<pair<int,int>> dir9 = {{-1,-1},{-1,0},{-1,1},{0,-1},{0,0},{0,1},{1,-1},{1,0},{1,1}};

int main(){
    ll n,m,d;
    cin >> n >> m >> d;
    ll ans = 0;
    rep(i,n){
        ll a;
        cin >> a;
        ans += max(0LL,(a-m+d-1)/d);
    }
    cout << ans << endl;
}

提出情報

ジャッジ結果