# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
732877 | vjudge1 | Spiderman (COCI20_spiderman) | C++17 | 1845 ms | 19316 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>
#define int long long
#define MOD 1000000007
#define all(x) x.begin(),x.end()
#define ff first
#define ss second
#define pb push_back
#define fast ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
int32_t main(){
fast;
int n,k;
cin>>n>>k;
int arr[n],cnt=0;
map<int,int>mp;
for(int i=0;i<n;i++){
cin>>arr[i];
if(arr[i]>k)cnt++;
mp[arr[i]]++;
}
for(int i=0;i<n;i++){
if(arr[i]==k){
cout<<cnt<<" ";
continue;
}
int ans=0;
arr[i]-=k;
for(int j=1;j*j<=arr[i];j++){
if(arr[i]%j)continue;
if(j>k)ans+=mp[j];
if(arr[i]/j>k && j*j!=arr[i])ans+=mp[arr[i]/j];
}
cout<<ans<<" ";
}
cout<<endl;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |