Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <cstdio>
- #include <algorithm>
- #include <cstring>
- #include <string>
- #include <cctype>
- #include <stack>
- #include <bitset>
- #include <queue>
- #include <list>
- #include <vector>
- #include <map>
- #include <set>
- #include <iterator>
- #include <sstream>
- #include <stdlib.h>
- #include <cmath>
- #define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
- #define debug( x ) cout << #x << " = " << x << endl
- #define clr(v,x) memset( v, x , sizeof v )
- #define all(x) (x).begin() , (x).end()
- #define rall(x) (x).rbegin() , (x).rend()
- #define TAM 110
- using namespace std;
- typedef pair<int,int> ii ;
- typedef long long ll ;
- typedef long double ld ;
- typedef pair<int,ii> pii ;
- vector<int> v;
- int t,n,aux;
- int mas_cercano(int d){
- int cont=1;
- while(cont<d){
- cont=cont*2;
- }
- return cont;
- }
- int main() {
- scanf("%d",&t);
- while(t--){
- scanf("%d",&n);
- for(int i=0;i<n;i++){
- scanf("%d",&aux);v.push_back(aux);
- }
- vector <int> vols;
- for(int i=0;i<v.size();i++){
- vols.push_back(mas_cercano(v[i]));
- }
- /*for(int i=0;i<v.size();i++){
- printf("%d ",vols[i]);
- }*/
- int mas=0;
- for(int i=0;i<vols.size();i++){
- mas+=vols[i];
- }
- mas=mas_cercano(mas);
- printf("%d\n",mas);
- v.clear();
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement