length = int(input())
nums = [int(x) for x in input().split()]
summ = sum(nums)
third = summ // 3
if summ % 3 == 0 and third != 0 and length > 2:
sum_temp = 0
counter = 0
for i in range(length):
sum_temp += nums[i]
if sum_temp == third:
counter = i + 1
break
if counter == length:
print(0)
else:
sum_temp = 0
zero_count1 = 1
negative_sum1 = 0
negative = True
adder = 0
for i in range(counter,length):
sum_temp += nums[i]
if nums[i] < 0 and negative:
negative_sum1 += nums[i]
if abs(negative_sum1) == third:
adder = 1
negative = False
else:
negative = False
if sum_temp == third:
counter = i + 1
break
elif sum_temp == 0:
zero_count1 += 1
if counter == length:
print(0)
else:
sum_temp = 0
zero_count2 = 1
negative = True
for i in range(counter,length):
sum_temp += nums[i]
if nums[i] < 0 and negative:
negative_sum1 += nums[i]
if abs(negative_sum1) == third:
adder += 1
negative = False
else:
negative = False
if sum_temp == 0:
zero_count2 += 1
if sum_temp != third:
print(0)
else:
print(zero_count1 * zero_count2 + adder)
elif third == 0 and length > 2:
temp_sum = 0
zero_counter = -2
for i in range(length):
temp_sum += nums[i]
if temp_sum == 0:
zero_counter += 1
print(int(zero_counter/2*(zero_counter+1)))
else:
print(0)
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |