#include<bits/stdc++.h>
using namespace std;
void DBG() { cerr << "]\n"; }
template<class H, class... T> void DBG(H h, T... t) {
cerr << h; if(sizeof...(t)) cerr << ", ";
DBG(t...);
}
#ifdef LOCAL
#define dbg(...) cerr << "[" << #__VA_ARGS__ << "]: [", DBG(__VA_ARGS__)
#else
#define dbg(...) 0
#endif // LOCAL
#define FOR(i,a,b) for(int i = (a) ; i<(b) ; i++)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for(int i = (b)-1 ; i>=(a) ; i--)
#define R0F(i,a) ROF(i,0,a)
#define each(e,a) for(auto &e : (a))
#define sz(v) (int)(v).size()
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define pb push_back
#define tcT template<class T
#define nl "\n"
using ll = long long;
using vi = vector<int>;
using pi = pair<int,int>;
using str = string;
tcT> using V = vector<T>;
tcT> using pqg = priority_queue<T,vector<T>,greater<T>>;
void setIO(string NAME = "") {
cin.tie(0)->sync_with_stdio(0);
if(sz(NAME)) {
freopen((NAME + ".inp").c_str(),"r",stdin);
freopen((NAME + ".out").c_str(),"w",stdout);
}
}
const int MX = 1e6 + 5;
int N, K, cnt[2*MX], ans[MX], A[MX];
void solve() {
cin>>N>>K;
int mx = -1;
F0R(i,N) {
cin>>A[i];
mx = max(mx, A[i]);
cnt[A[i]]++;
}
for(int i = K+1; i<=mx; i++) {
for(int j = K; j<=mx; j+=i) {
ans[j] += cnt[i];
}
}
F0R(i,N) cout << ans[A[i]] << " ";
}
int main() {
setIO();
int t=1;
//cin>>t;
while(t-->0) {
solve();
}
return 0;
}
Compilation message
spiderman.cpp: In function 'void setIO(std::string)':
spiderman.cpp:37:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
37 | freopen((NAME + ".inp").c_str(),"r",stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
spiderman.cpp:38:16: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
38 | freopen((NAME + ".out").c_str(),"w",stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
13 ms |
6484 KB |
Output is correct |
2 |
Correct |
24 ms |
5688 KB |
Output is correct |
3 |
Correct |
32 ms |
7832 KB |
Output is correct |
4 |
Correct |
62 ms |
10532 KB |
Output is correct |
5 |
Incorrect |
44 ms |
9328 KB |
Output isn't correct |
6 |
Incorrect |
79 ms |
12100 KB |
Output isn't correct |
7 |
Correct |
32 ms |
9308 KB |
Output is correct |
8 |
Correct |
32 ms |
9420 KB |
Output is correct |
9 |
Correct |
72 ms |
11980 KB |
Output is correct |
10 |
Correct |
95 ms |
11924 KB |
Output is correct |