Submission #3620140

---

Source Code Expand

#include <algorithm>
#include <cmath>
#include <functional>
#include <iostream>
#include <string>
#include <vector>
#define rep(i, n) for(int i = 0; i < (int)(n); i++)
#define repR(i, n) for(int i = (n) - 1; i > -1; i--)
#define rep1(i, n) for(int i = 1; i < (int)(n + 1); i++)
#define rep1R(i, n) for(int i = (n); i > 0; i--)
typedef long long ll;
typedef unsigned long long ull;
using namespace std;

int main() {
  int N; cin >> N;
  vector<int> a(N);
  rep(i, N) cin >> a[i];
  int ans = 0;
  rep(i, N) {
    while(a[i] % 2 == 0) {
      ans++;  
      a[i] /= 2;
    }
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result