#include<bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#define tof_io ios_base::sync_with_stdio(false);cin.tie(0) , cout.tie(0);
#define double long double
#define int long long
#define pb push_back
#define all(x) x.begin(),x.end()
#define endl '\n'
const int mod = 998244353; //998244353 1e9+7 1e9+9
const int inf = 1e18;
const int N = 1e6 + 23;
const int lg = 23;
int fac[N];
int inv[N];
int dnt_pow (int a, int b, int md = mod){int ans = 1; while(b){if(b&1){ans = (a*ans)%md;}a = (a*a)%md;b >>= 1;}return ans ;}
void dnt_bld (){fac[0] = 1; inv[0] = dnt_pow(fac[0],mod-2) ;for(int i = 1 ; i < N ; i++) {fac[i] = (fac[i-1] * i) % mod;inv[i] = dnt_pow( fac[i] , mod-2);}}
int dnt_ncr (int r,int n){if(r>n) return 0; return fac[n] * inv[r] % mod * inv[n-r] % mod;}
bool cmp (pair<int,int> a, pair<int,int> b){ return a.second > b.second; }
int d[N];
int n, k;
int mx = 0;
int ans[N];
void solve(int height)
{
if(k >= height) return;
for(int i = k ; i < N; i = i + height)
{
ans[i]++;
}
}
int32_t main()
{
cin >> n >> k;
vector<int> h(n);
for(int i = 0; i < n; i++)
{
cin >> h[i];
d[h[i]]++;
}
for(int i = 0; i < n; i++)
{
solve(h[i]);
}
bool fl = 0;
if(k == 0) fl = 1;
for(int i = 0; i < n; i++)
{
cout << ans[h[i]] - fl <<' ';
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
5 ms |
16984 KB |
Output is correct |
| 2 |
Correct |
8 ms |
16988 KB |
Output is correct |
| 3 |
Correct |
276 ms |
18004 KB |
Output is correct |
| 4 |
Correct |
510 ms |
20304 KB |
Output is correct |
| 5 |
Correct |
48 ms |
17872 KB |
Output is correct |
| 6 |
Correct |
110 ms |
20224 KB |
Output is correct |
| 7 |
Correct |
36 ms |
18008 KB |
Output is correct |
| 8 |
Correct |
38 ms |
18000 KB |
Output is correct |
| 9 |
Correct |
111 ms |
20052 KB |
Output is correct |
| 10 |
Correct |
125 ms |
19952 KB |
Output is correct |
