#include <bits/stdc++.h>
using namespace std;
#define sp " "
#define endl "\n";
#define fastio() cin.tie(0), ios_base::sync_with_stdio(0)
#define pb push_back
#define pii pair<int, int>
#define st first
#define nd second
#define N 1000005
const int modulo = 1e9 + 7;
int cnt[N], res[N], arr[N];
int32_t main()
{
fastio();
int n, k;
cin>>n>>k;
for (int i = 1; i <= n; i++){
cin>>arr[i];
cnt[arr[i]]++;
}
for (int i = k + 1; i < N; i++){
for (int j = 0; j < N; j += i)
res[j] += cnt[i];
}
for (int i = 1; i <= n; i++){
if (arr[i] < k) cout<<0<<sp;
else cout<<res[arr[i] - k]<<sp;
}
cout<<endl;
cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " seconds\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
11 ms |
9304 KB |
Output is correct |
2 |
Correct |
12 ms |
9048 KB |
Output is correct |
3 |
Correct |
25 ms |
11860 KB |
Output is correct |
4 |
Correct |
63 ms |
12372 KB |
Output is correct |
5 |
Incorrect |
24 ms |
12380 KB |
Output isn't correct |
6 |
Incorrect |
47 ms |
12856 KB |
Output isn't correct |
7 |
Correct |
21 ms |
12368 KB |
Output is correct |
8 |
Correct |
23 ms |
12200 KB |
Output is correct |
9 |
Correct |
48 ms |
12948 KB |
Output is correct |
10 |
Correct |
47 ms |
12880 KB |
Output is correct |