Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cmath>
- #include <set>
- #include <map>
- #pragma GCC optimize("Ofast")
- #pragma GCC target("sse,sse2,sse3,ssse3,sse4,avx")
- #pragma GCC optimization("O3")
- #pragma GCC optimization("unroll-loops")
- typedef long long ll;
- int main() {
- ll t, n, curr;
- scanf("%lld", &t);
- for (int _ = 0; _ < t; ++_) {
- scanf("%lld", &n);
- ll ans = 0;
- std::set<ll> a;
- for (int i = 0; i < n; ++i) {
- scanf("%lld", &curr);
- if (curr % 2 == 0) { a.insert(curr); }
- }
- //printf("Here\n");
- while (!a.empty()) {
- curr = *a.rbegin();
- a.erase(curr);
- if (curr / 2 % 2 == 0) { a.insert(curr / 2); }
- ++ans;
- //printf("%lld\n", curr);
- }
- printf("%lld\n", ans);
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement