#include<bits/stdc++.h>
using namespace std;
int main(){
long long a,b,c,d,e,p,h;
map <long long, int> 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; sqrt(d) >= 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 |
9 ms |
856 KB |
Output isn't correct |
2 |
Incorrect |
8 ms |
600 KB |
Output isn't correct |
3 |
Correct |
350 ms |
1984 KB |
Output is correct |
4 |
Incorrect |
993 ms |
5820 KB |
Output isn't correct |
5 |
Correct |
573 ms |
10948 KB |
Output is correct |
6 |
Correct |
1664 ms |
12564 KB |
Output is correct |
7 |
Incorrect |
671 ms |
17004 KB |
Output isn't correct |
8 |
Incorrect |
671 ms |
17092 KB |
Output isn't correct |
9 |
Incorrect |
1693 ms |
19840 KB |
Output isn't correct |
10 |
Incorrect |
1738 ms |
20332 KB |
Output isn't correct |