#include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b,c,d,e,p,h;
int mp[1000005];
memset(mp,0,sizeof(mp));
vector <long long> arr;
cin>>a>>c;
p=a;
h=0;
while(a--){
cin>>b;
mp[b]++;
arr.push_back(b);
if(b > c){
h++;
}
}
for(long long i=0;p>i;i++){
if(arr[i] <= 2*c){
if(arr[i] == c){
e=h;
}
else{
e=0;
}
}
else{
e=0;
d=arr[i];
d-=c;
for(long long j=1; d >= (j*j);j++){
if(d % j == 0 ){
if(arr[i] % j == c){
e+=mp[j];
}
if(arr[i] % (d / j) == c){
e+=mp[d / j];
}
if(j == (d/j)){
e-=mp[j];
}
}
}
if(c == 0){
e-=1;
}
}
cout<<e<<" ";
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
8 ms |
4184 KB |
Output isn't correct |
2 |
Incorrect |
8 ms |
4184 KB |
Output isn't correct |
3 |
Correct |
290 ms |
5476 KB |
Output is correct |
4 |
Incorrect |
828 ms |
8896 KB |
Output isn't correct |
5 |
Correct |
329 ms |
5320 KB |
Output is correct |
6 |
Correct |
950 ms |
8636 KB |
Output is correct |
7 |
Incorrect |
369 ms |
5704 KB |
Output isn't correct |
8 |
Incorrect |
373 ms |
5440 KB |
Output isn't correct |
9 |
Incorrect |
1087 ms |
9736 KB |
Output isn't correct |
10 |
Incorrect |
1081 ms |
10172 KB |
Output isn't correct |