Equal Stacks

                            Solution in C :

In C++ :




#include<bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i = (a); i <= (b); ++i)
#define FORD(i,a,b) for(int i = (a); i >= (b); --i)
#define RI(i,n) FOR(i,1,(n))
#define REP(i,n) FOR(i,0,(n)-1)
#define mini(a,b) a=min(a,b)
#define maxi(a,b) a=max(a,b)
#define mp make_pair
#define pb push_back
#define st first
#define nd second
#define sz(w) (int) w.size()
typedef vector<int> vi;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> pii;
const int inf = 1e9 + 5;
const int nax = 1e6 + 5;



int main() {
	int aa, bb, cc;
	scanf("%d%d%d", &aa, &bb, &cc);
	vi a, b, c;
	REP(_, aa) {
		int x;
		scanf("%d", &x);
		a.pb(x);
	}
	REP(_, bb) {
		int x;
		scanf("%d", &x);
		b.pb(x);
	}
	REP(_, cc) {
		int x;
		scanf("%d", &x);
		c.pb(x);
	}
	reverse(a.begin(), a.end());
	reverse(b.begin(), b.end());
	reverse(c.begin(), c.end());
	ll A = 0, B = 0, C = 0;
	for(int x : a) A += x;
	for(int x : b) B += x;
	for(int x : c) C += x;
	while(A != B || A != C) {
		if(A == max(max(A, B), C)) {
			A -= a.back();
			a.pop_back();
		}
		else if(B == max(max(A, B), C)) {
			B -= b.back();
			b.pop_back();
		}
		else {
			C -= c.back();
			c.pop_back();
		}
	}
	printf("%lld\n", A);
	return 0;
}









In Java :




/* Andy Rock
 * June 25, 2016
 * 
 * World CodeSprint #4
 */

import java.io.*;
import java.math.*;
import java.util.*;

public class Main
{
	public static void main(String[] args) throws IOException
	{
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));

		StringTokenizer st = new StringTokenizer(in.readLine());
		int[] n =
		{
			Integer.parseInt(st.nextToken()),
			Integer.parseInt(st.nextToken()),
			Integer.parseInt(st.nextToken())
		};

		int[][] h = new int[3][];
		int[] sum = new int[3];
		for(int i=0;i<3;i++)
		{
			st = new StringTokenizer(in.readLine());
			h[i] = new int[n[i]];
			for(int j=0;j<n[i];j++)
			{
				h[i][j] = Integer.parseInt(st.nextToken());
				sum[i] += h[i][j];
			}
		}

		int[] pos = new int[3];
		while(true)
		{
			for(int i=0;i<3;i++)
				if(sum[i] > Math.min(sum[0], Math.min(sum[1], sum[2])))
				{
					sum[i] -= h[i][pos[i]];
					pos[i]++;
				}
			if(sum[0] == sum[1] && sum[1] == sum[2])
				break;
		}

		System.out.println(sum[0]);
	}
}








In C :




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

int main() {
    int n1,n2,n3,i,j=0,k=0,s1=0,s2=0,s3=0;
    scanf("%d %d %d",&n1,&n2,&n3);
    int arr1[n1];
    int arr2[n2];
    int arr3[n3];
    for(i=0;i<n1;i++){
        scanf("%d",&arr1[i]);
        s1+=arr1[i];
    }
    for(i=0;i<n2;i++){
        scanf("%d",&arr2[i]);
        s2+=arr2[i];
    }
    for(i=0;i<n3;i++){
        scanf("%d",&arr3[i]);
        s3+=arr3[i];
    }
    i=0;
    while(1){
        if((s1==s2 && s2==s3) || s1==0 || s2==0 || s3==0)
            break;
        if(s1>=s2 && s1>=s3)
            s1-=arr1[i++];
        else if(s2>=s1 && s2>=s3)
            s2-=arr2[j++];
        else
            s3-=arr3[k++];
    }
    if(s1==0 || s2==0 || s3==0)
        printf("0");
    else
        printf("%d",s1);
    return 0;
}









In Python3 :





def read_stack():
    stack = [int(x) for x in input().split(' ')]
    stack = list(reversed(stack))
    sum_stack = set()
    psum = 0
    for i in range(len(stack)):
        psum += stack[i]
        sum_stack.add(psum)
    return sum_stack

input()

ans = read_stack()
ans &= read_stack()
ans &= read_stack()
if len(ans) > 0:
    print(max(ans))
else:
    print(0)