Submission #1032610

#TimeUsernameProblemLanguageResultExecution timeMemory
1032610Khanhcsp2Spiderman (COCI20_spiderman)C++14
70 / 70
72 ms19400 KiB
#include<bits/stdc++.h> #define el '\n' #define fi first #define sc second #define int ll #define pii pair<int, int> #define all(v) v.begin(), v.end() using namespace std; using ll=long long; using ull=unsigned long long; using ld=long double; const int mod=1e9+7; const int N=1e6+11; int n, a[N], cnt[N], ans[N], k; void sol() { cin >> n >> k; for(int i=1;i<=n;i++) cin >> a[i], cnt[a[i]]++; for(int i=k+1;i<=1e6;i++) { for(int j=k;j<=1e6;j+=i) ans[j]+=cnt[i]; cnt[i]=0; } for(int i=1;i<=n;i++) { cout << ans[a[i]]-(k==0) << ' '; } } signed main() { // freopen("divisor.INP", "r", stdin); // freopen("divisor.OUT", "w", stdout); ios_base::sync_with_stdio(0); cin.tie(0); int t=1; //cin >> t; while(t--) { sol(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...