Submission #198967

#TimeUsernameProblemLanguageResultExecution timeMemory
198967virchau13Spiderman (COCI20_spiderman)C++17
49 / 70
2092 ms12408 KiB
#include <iostream>
#include <algorithm>
#include <set>
#include <deque>
using namespace std;

const long long SIZE = 1000007;

bool v[1000007] = {};
long long ans[1000007] = {};

int main(){
    long long n, k;
    cin >> n >> k;
    long long arr[n];
    for(long long i = 0; i < n; i++){
        cin >> arr[i];
        v[arr[i]] = 1;
    }
    for(long long i = 0; i < n; i++){
        if(arr[i] > k) for(long long j = k; j < SIZE; j += arr[i]) ans[j]++;
    }
    for(long long i = 0; i < n; i++){
        cout << ans[arr[i]] << ' ';
    }
    cout << '\n';
}
#Verdict Execution timeMemoryGrader output
Fetching results...