#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(long long i=0;i<(long long)(n);i++)
#define REP(i,k,n) for(long long i=k;i<(long long)(n);i++)
#define all(a) a.begin(),a.end()
#define pb emplace_back
#define eb emplace_back
#define lb(v,k) (lower_bound(all(v),k)-v.begin())
#define ub(v,k) (upper_bound(all(v),k)-v.begin())
#define fi first
#define se second
#define pi M_PI
#define PQ(T) priority_queue<T>
#define SPQ(T) priority_queue<T,vector<T>,greater<T>>
#define dame(a) {out(a);return 0;}
#define decimal cout<<fixed<<setprecision(15);
#define dupli(a) a.erase(unique(all(a)),a.end())
typedef long long ll;
typedef pair<ll,ll> P;
typedef tuple<ll,ll,ll> PP;
typedef tuple<ll,ll,ll,ll> PPP;
typedef multiset<ll> S;
using vi=vector<ll>;
using vvi=vector<vi>;
using vvvi=vector<vvi>;
using vvvvi=vector<vvvi>;
using vp=vector<P>;
using vvp=vector<vp>;
using vb=vector<bool>;
using vvb=vector<vb>;
const ll inf=1001001001001001001;
const ll INF=1001001001;
const ll mod=1000000007;
const double eps=1e-10;
template<class T> bool chmin(T&a,T b){if(a>b){a=b;return true;}return false;}
template<class T> bool chmax(T&a,T b){if(a<b){a=b;return true;}return false;}
template<class T> void out(T a){cout<<a<<'\n';}
template<class T> void outp(T a){cout<<'('<<a.fi<<','<<a.se<<')'<<'\n';}
template<class T> void outvp(T v){rep(i,v.size())cout<<'('<<v[i].fi<<','<<v[i].se<<')';cout<<'\n';}
template<class T> void outvvp(T v){rep(i,v.size())outvp(v[i]);}
template<class T> void outv(T v){rep(i,v.size()){if(i)cout<<' ';cout<<v[i];}cout<<'\n';}
template<class T> void outvv(T v){rep(i,v.size())outv(v[i]);}
template<class T> bool isin(T x,T l,T r){return (l)<=(x)&&(x)<=(r);}
template<class T> void yesno(T b){if(b)out("yes");else out("no");}
template<class T> void YesNo(T b){if(b)out("Yes");else out("No");}
template<class T> void YESNO(T b){if(b)out("YES");else out("NO");}
template<class T> void noyes(T b){if(b)out("no");else out("yes");}
template<class T> void NoYes(T b){if(b)out("No");else out("Yes");}
template<class T> void NOYES(T b){if(b)out("NO");else out("YES");}
void outs(ll a,ll b){if(a>=inf-100)out(b);else out(a);}
ll gcd(ll a,ll b){if(b==0)return a;return gcd(b,a%b);}
ll modpow(ll a,ll b){a%=mod;if(b==0)return 1;if(b&1)return a*modpow(a,b-1)%mod;ll k=modpow(a,b/2);return k*k%mod;}
int main(){
ll n,k;cin>>n>>k;
vi v(n);
rep(i,n)cin>>v[i];
vi cnt(1000005);
ll al=0;
rep(i,n)if(v[i]>k){
cnt[v[i]]++;
al++;
}
vi ans(n);
rep(i,n){
if(v[i]==k)ans[i]=al;
if(v[i]>k){
ll t=v[i]-k;
for(ll j=1;j*j<=t;j++)if(t%j==0){
ans[i]+=cnt[j];
if(t*t!=j)ans[i]+=cnt[t/j];
}
}
}
outv(ans);
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
15 ms |
8192 KB |
Output isn't correct |
| 2 |
Incorrect |
15 ms |
8192 KB |
Output isn't correct |
| 3 |
Incorrect |
370 ms |
10872 KB |
Output isn't correct |
| 4 |
Incorrect |
1070 ms |
16360 KB |
Output isn't correct |
| 5 |
Incorrect |
418 ms |
10744 KB |
Output isn't correct |
| 6 |
Incorrect |
1212 ms |
16120 KB |
Output isn't correct |
| 7 |
Incorrect |
467 ms |
10744 KB |
Output isn't correct |
| 8 |
Incorrect |
469 ms |
10648 KB |
Output isn't correct |
| 9 |
Incorrect |
1370 ms |
15992 KB |
Output isn't correct |
| 10 |
Incorrect |
1375 ms |
15996 KB |
Output isn't correct |
