Submission #1017197

#TimeUsernameProblemLanguageResultExecution timeMemory
1017197vjudge1Spiderman (COCI20_spiderman)C++17
56 / 70
85 ms10188 KiB
#include <bits/stdc++.h> using namespace std; const int N = 3e5 + 10, A = 1e6 + 10; int n, k, a[N], cnt[A], ans[A]; int main(){ cin >> n >> k; for (int i = 0; i < n; i ++) cin >> a[i], cnt[a[i]]++; for (int i = 0; i < n; i ++){ if (cnt[a[i]] == 0 or k >= a[i]) continue; for (int r = k; r <= 1e6; r += a[i]) ans[r] += cnt[a[i]]; cnt[a[i]] = 0; } for (int i = 0; i < n; i ++) cout << ans[a[i]] << " "; cout << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...