# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
543961 | AlperenT | Spiderman (COCI20_spiderman) | C++17 | 107 ms | 19212 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
long long n, k, arr[N], cnt[N], ans[N];
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
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 = k; j < N; j += i){
ans[j] += cnt[i] - (i == j);
}
}
for(int i = 1; i <= n; i++) cout << ans[arr[i]] << " ";
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |