Submission #643887

#TimeUsernameProblemLanguageResultExecution timeMemory
643887MuntherCarrotSpiderman (COCI20_spiderman)C++14
70 / 70
540 ms6312 KiB
#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 timeMemoryGrader output
Fetching results...