Submission #735199

#TimeUsernameProblemLanguageResultExecution timeMemory
735199DangerNoodle7591Spiderman (COCI20_spiderman)C++17
14 / 70
2083 ms8636 KiB
#include <bits/stdc++.h> using namespace std; //#define endl "\n" #define ll long long #define lalala ios_base::sync_with_stdio(false);cin.tie(NULL); #define mod 1000000007 #define N 1000005 #define big 1000000000000000007 int main(){ lalala; int n,k;cin>>n>>k; int cnt=0; ll int arr[n]; map<ll int,int> mp; for(int i=0;i<n;i++){ cin>>arr[i]; mp[arr[i]]++; if(arr[i]>k)cnt++; } for(int i=0;i<n;i++){ int cev=0; for(int j=0;j<n;j++){ if(i==j)continue; if(arr[i]%arr[j]==k)cev++; }cout<<cev<<" "; } /*for(int i=0;i<n;i++){ if(arr[i]<k){cout<<"0 ";continue;} if(arr[i]==k){cout<<cnt<<" ";continue;} ll int uwu=arr[i]-k; int cev=0; //cout<<arr[i]<<" "<<uwu<<endl; for(int j=1;j<=sqrt(arr[i]);j++){ if(uwu%j)continue; //cout<<cev<<" "<<j<<" "<<uwu/j<<" "<<mp[j]<<" "<<mp[uwu/j]<<endl; if(arr[i]%j==k){ cev+=mp[j]; } if(j*j!=uwu && arr[i]%(uwu/j)==k)cev+=mp[uwu/j]; }cout<<cev<<" "; }*/ }
#Verdict Execution timeMemoryGrader output
Fetching results...