-
Notifications
You must be signed in to change notification settings - Fork 0
/
D.cpp
83 lines (71 loc) · 1.68 KB
/
D.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
//https://codeforces.com/contest/1368/problem/D
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
typedef vector<vpi> vvpi;
typedef vector<vpl> vvpl;
typedef set<int> si;
typedef multiset<int> msi;
typedef set<ll> sl;
typedef multiset<ll> msl;
#define clrcin cin.ignore(numeric_limits<streamsize>::max(),'\n');
#define GOGOGO ios::sync_with_stdio(false); cin.tie(nullptr);
#define BYEBYE return 0;
#define all(cn) (cn).begin(), (cn).end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define repk(i, k, n) for(int i = k; i < n; ++i)
#define mp make_pair
#define pb push_back
#define fi first
#define se second
#define popcnt __builtin_popcount
#define gcd std::__detail::__gcd
#define lcm std::__detail::__lcm
const int INFI = 1e9 + 5;
const ll INFL = 4e18 + 5;
const int maxn = 2e5;
int cnt[21] = { 0 };
int main()
{
GOGOGO
int n; cin >> n;
ll out = 0;
ll curr;
rep(i, n)
{
cin >> curr;
for(int j = 0; j <= 20; ++j)
{
if((curr & (ll)(1 << j)))
{
cnt[j]++;
}
}
}
bool found = true;
while (found)
{
ll x = 0;
found = false;
rep(j, 21)
{
if (cnt[j])
{
found = true;
x |= 1 << j;
--cnt[j];
}
}
out += x * x;
}
cout << out << endl;
BYEBYE
}