Submission #198227

#TimeUsernameProblemLanguageResultExecution timeMemory
198227alradSpiderman (COCI20_spiderman)C++17
49 / 70
2067 ms57680 KiB
#include <bits/stdc++.h> using namespace std; const int LIMIT = 1e6 + 5; int main() { ios_base :: sync_with_stdio(0); cin.tie(0) , cout.tie(0); int n , k; cin >> n >> k; vector<int> a(n); unordered_map<int , int> tot; unordered_map<int , int> ans; for (int i = 0; i < n; i++) { cin >> a[i]; tot[a[i]]++; } for (auto e : tot) { int num = e.first; int counter = e.second; if (num <= k) { continue; } for (int j = k; j < LIMIT; j += num) { ans[j] += counter; } if (k == 0) { ans[num]--; } } for (int i = 0; i < n; i++) { cout << ans[a[i]] << " "; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...