oj.uz

Submission #643881

# Submission time Handle Problem Language Result Execution time Memory
643881 2022-09-23T07:45:24 Z MuntherCarrot Spiderman (COCI20_spiderman) C++14
70 / 70
 722 ms 6320 KB 
#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> frq(MX, 0);
    for(int &i : arr)
        cin >> i;
    for(int i : arr){
        if(i <= k) continue;
        for(int j=k;j<MX;j+=i){
            frq[j]++;
        }
    }
    for(int i : arr)
        cout << (k ? frq[i] : frq[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;
}

Subtask #1
70.0 / 70.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 4180 KB Output is correct
2 Correct 9 ms 4224 KB Output is correct
3 Correct 311 ms 4840 KB Output is correct
4 Correct 722 ms 6320 KB Output is correct
5 Correct 51 ms 4736 KB Output is correct
6 Correct 138 ms 6176 KB Output is correct
7 Correct 47 ms 4684 KB Output is correct
8 Correct 54 ms 4812 KB Output is correct
9 Correct 178 ms 6028 KB Output is correct
10 Correct 137 ms 6028 KB Output is correct