# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
643887 | MuntherCarrot | Spiderman (COCI20_spiderman) | C++14 | 540 ms | 6312 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.
#include <bits/stdc++.h>
using namespace std;
//#define int long long
#define ll long long
#define endl "\n"
#define all(x) x.begin(),x.end()
const int MOD = 0, SZ = 1e4+5e3, MX = 1e6+1;
void solve(){
int n, k;
cin >> n >> k;
int arr[n];
vector<int> vec(MX, 0);
for(int &i : arr)
cin >> i;
for(int i : arr){
if(i <= k) continue;
for(int j=k;j<MX;j+=i){
vec[j]++;
}
}
for(int i : arr)
cout << (k ? vec[i] : vec[i]-1) << ' ';
}
signed main()
{
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// int test;
// cin >> test;
// while(test--)
solve();
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |