# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
477972 | mychecksedad | Spiderman (COCI20_spiderman) | C++17 | 124 ms | 15300 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.
/* Author : Mychecksdead */
#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef long double ld;
#define MOD (1000000000+7)
#define MOD1 (998244353)
#define PI 3.1415926535
#define pb push_back
#define setp() cout << setprecision(15)
#define all(x) x.begin(), x.end()
const int N = 1e6+100, M = 1e5+10, F = 2147483646, K = 20;
ll n, k, arr[N], ans[N];
vector<int> a(N, 0);
void solve(){
cin >> n >> k;
for(int i = 1; i <= 1e6; ++i) ans[i] = 0;
for(int i = 0; i < n; ++i){
cin >> arr[i];
++a[arr[i]];
if(arr[i] > k) ++ans[k];
}
for(int i = k + 1; i <= 1e6; ++i){
for(int j = 1; j * i + k <= 1e6; ++j){
ans[j * i + k] += a[i];
}
if(k == 0) ans[i]--;
}
for(int i = 0; i < n; ++i) cout << ans[arr[i]] << ' ';
}
int main(){
cin.tie(0); ios::sync_with_stdio(0);
int T = 1, aa;
// cin >> T;aa=T;
while(T--){
// cout << "Case #" << aa-T << ": ";
solve();
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |