Chief Hopper

                            Solution in C :

In  C :





#include <stdio.h>
#include <stdlib.h>

int main() {
  int n, *h, i;
  unsigned long long tot;
  
  scanf("%d",&n);
  h = malloc(n * sizeof(int));
  for (i=0; i<n; i++) scanf("%d",&h[i]);
  
  tot = 0;
  i--;
  while (i>=0) {
    tot += h[i];
    if (tot & 1) tot++;
    tot /= 2;
    i--;
  }
  
  printf("%lld\n",tot);
  
  return 0;
}
                        

                        Solution in C++ :

In  C++  :







#include <vector>
#include <list>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <limits>
#include <cstring>
#include <string>
using namespace std;

#define pairii pair<int, int>
#define llong long long
#define pb push_back
#define sortall(x) sort((x).begin(), (x).end())
#define INFI  numeric_limits<int>::max()
#define INFLL numeric_limits<llong>::max()
#define INFD  numeric_limits<double>::max()
#define FOR(i,s,n) for (int (i) = (s); (i) < (n); (i)++)
#define FORZ(i,n) FOR((i),0,(n))

const int MAXN = 100005;
int ar[MAXN];

void solve() {
  int n;
  scanf("%d",&n);
  FORZ(i,n) scanf("%d",ar+i);
  int res = 0;
  for (int i = n-1; i >= 0; i--) {
    int x = res + ar[i];
    res = x/2 + x%2;
  }
  printf("%d",res);
}

int main() {
#ifdef DEBUG
  freopen("in.txt", "r", stdin);
  freopen("out.txt", "w", stdout);
#endif
  solve();
  return 0;
}
                    

                        Solution in Java :

In  Java :





import java.util.Scanner;

public class Solution {

    public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		String s = in.nextLine();
		int[] heights = new int[n];
		for(int i = 0; i < n; i++) {
			heights[i] = in.nextInt();
		}
		System.out.println(calcMinEnergy(heights));
	}

	public static long calcMinEnergy(int[] heights) {
		if(heights.length < 1) return 0;
		long energy = 0;
		for(int i = 0; i < heights.length; i++) {
			long tmp = energy + heights[heights.length - 1 - i];
			int one = (int)(tmp % 2);
			energy = tmp / 2 + one;
		}
		return energy;
	}
}
                    

                        Solution in Python : 
                            
In  Python3 :





N = int(input())
heights = [int(n) for n in input().split()]

max_h = max(heights)

interval = [1, max_h]

def get_final_energy(e, heights):
	for h in heights:
		e = 2 * e - h
	return e

while interval[0] < interval[1] - 1:
	mid = (interval[0] + interval[1]) // 2
	fe = get_final_energy(mid, heights)
	if fe >= 0:
		interval[1] = mid
	else:
		interval[0] = mid

if get_final_energy(interval[0], heights) >= 0:
	print(interval[0])
else:
	print(interval[1])