Submission #644824

#TimeUsernameProblemLanguageResultExecution timeMemory
6448241zaid1Spiderman (COCI20_spiderman)C++17
21 / 70
1101 ms19496 KiB
#include <bits/stdc++.h> using namespace std; #define int long long #define endl '\n'; const int M = 2e6+5, MOD = 1e9+7; int fr[M], ans[M]; signed main() { cin.tie(0)->sync_with_stdio(0); int n, k; cin >> n >> k; vector<int> v(n); for (int&i:v) cin >> i; for (int i:v) fr[i]++; for (int&i:v) i -= k; for (int i:v) { if (i < 0) continue; for (int x = 1; x*x <= i; x++) { if (i%x == 0) { if ((i+k)%x == k) ans[i] += fr[x]; if (x*x != i) if ((i+k)%(i/x) == k) ans[i] += fr[i/x]; } } } for (int i:v) ans[0] += i > 0; for (int i:v) { if (i >= 0) cout << ans[i] << ' '; else cout << 0 << ' '; } cout << endl; return 0; } /* a%b = k 6 3 4 3 12 6 8 2 0 1 2 3 4 5 6 7 8 9 10 11 12 fr:1 1 0 1 0 0 0 0 0 1 0 0 0 as:0 0 0 0 0 0 0 0 0 0 0 0 0 */
#Verdict Execution timeMemoryGrader output
Fetching results...