Submission #844462

#TimeUsernameProblemLanguageResultExecution timeMemory
844462vjudge1Spiderman (COCI20_spiderman)C++98
0 / 70
145 ms24892 KiB
#include<bits/stdc++.h> using namespace std; int main(){ long long a,b,c,d,e,p,h; map <long long, long long> 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] <= c){ if(arr[i] == c){ e=h; } else{ e=0; } } else{ e=0; d=arr[i]; d-=c; long long bol[300005]; memset(bol,0,sizeof(bol)); if(mp[1] != 0 && (arr[i] % (1) == c)){ e+=mp[1]; bol[1]=1; } if(bol[d] == 0 && mp[d] != 0 && (arr[i] % (d) == c)){ e+=mp[d]; bol[d]=1; } for(long long j=2; sqrt(d) >= j;j++){ if(d % j == 0 && bol[j] == 0){ e+=mp[j]; bol[j]=1; } if(d % j== 0 && bol[d/j] == 0){ e+=mp[d/j]; bol[d/j]=1; } } } cout<<e<<" "; } }
#Verdict Execution timeMemoryGrader output
Fetching results...