# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
679214 | Vladth11 | Spiderman (COCI20_spiderman) | C++14 | 98 ms | 10208 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>
#pragma GCC optimize("Ofast")
#define debug(x) cerr << #x << " " << x << "\n"
#define debugs(x) cerr << #x << " " << x << " "
using namespace std;
typedef pair <int, int> pii;
typedef long long ll;
const int NMAX = 1000001;
const int VMAX = 41;
const int INF = 1e9;
const int MOD = 1000000009;
const int BLOCK = 318;
const int base = 31;
const int nrbits = 21;
int c[NMAX];
int f[NMAX];
int v[NMAX];
int main() {
#ifdef HOME
ifstream cin(".in");
ofstream cout(".out");
#endif // HOME
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n, k, i;
cin >> n >> k;
for(i = 1; i <= n; i++){
int x;
cin >> x;
f[x]++;
v[i] = x;
}
for(i = k + 1; i < NMAX; i++){
for(int j = k; j < NMAX; j += i){
c[j] += f[i] - (i == j);
}
}
for(i = 1; i <= n; i++){
cout << c[v[i]] << " ";
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |