# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
638140 | Mr_Ph | Spiderman (COCI20_spiderman) | C++14 | 2088 ms | 72796 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
///Never gonna give you up.
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
typedef long long ll;
typedef long long int lli;
typedef unsigned long long ull;
using namespace std;
using namespace __gnu_pbds;
template<class x>
using ordered_set = tree<x, null_type,less<x>, rb_tree_tag,tree_order_statistics_node_update>;
const ll mod=(ll)1e9+7;
const ll mod1=998244353;
///the defines :)
#define endl '\n'
#define vi vector<int>
#define vll vector<ll>
#define ent(arr) for(int i=0;i<arr.size();i++)cin>>arr[i];
#define all(arr) arr.begin(),arr.end()
#define allr(arr) arr.rbegin(),arr.rend()
#define sz size()
#define int long long
///the end of the defines ;)
void bla()
{
#ifndef ONLINE_JUDGE
freopen("input.txt","r",stdin);
freopen("notsus.txt","w",stdout);
#endif
}
ll power(ll x,ll y)
{
if(y==0)
return 1;
if(y==1)
return x%mod;
ll r=power(x%mod,(y%mod)/2)%mod;
if(y%2)
return ((r%mod)*(r%mod)*(x%mod));
else
return ((r%mod)*(r%mod));
}
ll lcm(ll a,ll b)
{
return max(a,b)/__gcd(a,b)*min(a,b);
}
void preprocess(){}
void solve()
{
int n,k;
cin>>n>>k;
map<int,int>mp;
vi arr(n);
ent(arr);
map<int,int>mp1;
int x=*max_element(all(arr));
for(int i=0;i<n;i++)mp[arr[i]]++;
for(int i=k+1;i<=x;i++)
{
for(int j=k;j<=x;j+=i)
mp1[j]+=mp[i];
}
for(int i=0;i<n;i++)
cout<<mp1[arr[i]]<<" ";
}
int32_t main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
preprocess();
//bla();
int t=1;
//cin>>t;
while(t--)
solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |