#include <bits/stdc++.h>
#define ll long long
using namespace std;
const int mod=1e9+7;
const int N=1e6+1;
int a[N];
int c[N];
int cnt[N];
bool fl[N];
int main(){
    int n,k;
    cin>>n>>k;
    for(int i=1;i<=n;++i){
        cin>>a[i];
        cnt[a[i]]++;
    }
    for(int i=1;i<=n;++i){
        if(fl[a[i]]){
            cout<<c[a[i]]<<" ";
            continue;
        }
        fl[a[i]]=1;
        if(a[i]==k){
            for(int j=1;j<=n;++j){
                if(a[j]>k){
                    ++c[a[i]];
                }
            }
            cout<<c[a[i]]<<" ";
            continue;
        }
        if(a[i]<k){
            continue;
        }
        for(int j=1;j*j<=(a[i]-k);++j){
            if((a[i]-k)%j==0){
                if(j>k){
                    c[a[i]]+=cnt[j];
                }
                if((a[i]-k)!=j*j && (a[i]-k)/j>k){
                    c[a[i]]+=cnt[(a[i]-k)/j];
                }
            }
        }
        if(k==0){
            c[a[i]]--;
        }
        cout<<c[a[i]]<<" ";
    }
    return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|
| Fetching results... |