Language: C++

/*
    Author:zeke
    
    pass System Test!
    GET AC!!
*/
#include <iostream>
#include <queue>
#include <vector>
#include <iostream>
#include <vector>
#include <string>
#include <cassert>
#include <algorithm>
#include <functional>
#include <cmath>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <map>
#include <iomanip>
#include <utility>
#include <stack>
#include <bitset>
using ll = long long;
using ld = long double;
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(x) (x).begin(), (x).end()
#define rep3(var, min, max) for (ll(var) = (min); (var) < (max); ++(var))
#define repi3(var, min, max) for (ll(var) = (max)-1; (var) + 1 > (min); --(var))
#define Mp(a, b) make_pair((a), (b))
#define F first
#define S second
#define Icin(s) \
    ll(s);      \
    cin >> (s);
#define Scin(s) \
    ll(s);      \
    cin >> (s);
template <class T>
bool chmax(T &a, const T &b)
{
    if (a < b)
    {
        a = b;
        return 1;
    }
    return 0;
}
template <class T>
bool chmin(T &a, const T &b)
{
    if (b < a)
    {
        a = b;
        return 1;
    }
    return 0;
}
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef vector<V> VV;
typedef vector<P> VP;
ll mod = 1e9 + 7;
ll MOD = 1e9 + 7;
ll INF = 1e18;
long long modMult(long long a, long long b, long long m)
{
    long long res = 0;
    long long exp = a % m;
    while (b)
    {
        if (b & 1)
        {
            res += exp;
            if (res > m)
                res -= m;
        }
        exp <<= 1;
        if (exp > m)
            exp -= m;
        b >>= 1;
    }
    return res;
}
long long powMod(long long a, long long b, long long m)
{
    long long res = 1;
    long long exp = a % m;
    while (b)
    {
        if (b & 1)
            res = modMult(res, exp, m);
        exp = modMult(exp, exp, m);
        b >>= 1;
    }
    return res;
}
//powMod(a,b,MOD)
//O(log(b))?
int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    unsigned long long n;
    cin >> n;
    vector<unsigned long long> vec(n);
    vector<unsigned long long> reg(100,0);
    rep(i, n) cin >> vec[i];
    rep(i, n)
    {
        for(ll j=59;j>=0;j--)
        {
            if(pow(2,j)<=vec[i]){
                reg[j]++;
                vec[i]-=pow(2,j);
            }
        }
    }
   // rep(i,60)cout<<reg[i]<<" ";
    //cout<<endl;
    //  cout<<endl;
   // cout<<pow(2,60)<<endl;
    unsigned long long res=0;
    rep(i, 60)
    {
        unsigned long long k = pow(2,i)%MOD ;
        k*=reg[i];
        k%=MOD;
        k*= (n - reg[i]);
        k%=MOD;
        res += k;
      //  cout<<setprecision(20)<<pow(2,i) * (reg[i]) * (n - reg[i]+1)<<" "<<res%MOD<<endl;
        res %= MOD;
      //  cout << res << endl;
    }
    cout << res%MOD << endl;
}


Compiler output:
a.cc: In function 'int main()':
a.cc:129:40: error: invalid operands of types '__gnu_cxx::__promote<double>::__type' {aka 'double'} and 'll' {aka 'long long int'} to binary 'operator%'
  129 |         unsigned long long k = pow(2,i)%MOD ;
      |                                ~~~~~~~~^~~~
      |                                   |     |
      |                                   |     ll {aka long long int}
      |                                   __gnu_cxx::__promote<double>::__type {aka double}