#pragma region cp-helper
#include <bits/stdc++.h>
using namespace std;
#define AC ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
#define ll long long
#define ull unsigned long long
#define ii pair<int, int>
#define lll pair<ll, ll>
#define vi vector<int>
#define vvi vector<vi>
#define vl vector<ll>
#define vll vector<lll>
#define vvl vector<vl>
#define vii vector<ii>
#define all(a) a.begin(), a.end()
#define qsort(a) sort(all(a))
#define qsortd(a) sort(all(a), greater<>())
#define qsortf(a, f) sort(all(a), f)
#define pb(n) push_back(n)
#define eb(n) emplace_back(n)
#define pp(a, b) emplace_back(a, b)
#define umap unordered_map
#define uset unordered_set
#define nl '\n'
#define fileio(in, out) freopen(in, "r", stdin); freopen(out, "w", stdout)
#define qmod %mod
#define pls int
#define give main()
const int mod = 1000000007;
#pragma endregion
const int N = 300005;
int n, k, arr[N], ans[1000005];
pls give {
AC;
cin >> n >> k;
for (int i=0; i<n; i++) {
cin >> arr[i];
if (k and arr[i] > k) for (int j=k; j<1000005; j += arr[i]) ans[j]++;
else if (!k) for (int j=k; j<1000005; j += arr[i]) ans[j]++;
}
for (int i=0; i<n; i++) cout << (k ? ans[arr[i]] : (ans[arr[i]]-1)) << ' ';
}
Compilation message
spiderman.cpp:1:0: warning: ignoring #pragma region cp [-Wunknown-pragmas]
#pragma region cp-helper
spiderman.cpp:30:0: warning: ignoring #pragma endregion [-Wunknown-pragmas]
#pragma endregion
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
11 ms |
4216 KB |
Output is correct |
| 2 |
Correct |
16 ms |
4216 KB |
Output is correct |
| 3 |
Correct |
390 ms |
5000 KB |
Output is correct |
| 4 |
Correct |
728 ms |
6520 KB |
Output is correct |
| 5 |
Correct |
55 ms |
4856 KB |
Output is correct |
| 6 |
Correct |
135 ms |
6392 KB |
Output is correct |
| 7 |
Correct |
49 ms |
4856 KB |
Output is correct |
| 8 |
Correct |
49 ms |
4856 KB |
Output is correct |
| 9 |
Correct |
142 ms |
6308 KB |
Output is correct |
| 10 |
Correct |
129 ms |
6136 KB |
Output is correct |
