Showing posts with label competitive solution. Show all posts
Showing posts with label competitive solution. Show all posts

Monday, October 7, 2019

Simple Array Sum

Simple Array Sum

Given an array of integers, find the sum of its elements.
For example, if the array , , so return .
Function Description
Complete the simpleArraySum function in the editor below. It must return the sum of the array elements as an integer.
simpleArraySum has the following parameter(s):
  • ar: an array of integers
Input Format
The first line contains an integer, , denoting the size of the array.
The second line contains space-separated integers representing the array's elements.
Constraints
Output Format
Print the sum of the array's elements as a single integer.
Sample Input
6
1 2 3 4 10 11
Sample Output
31

Explanation
We print the sum of the array's elements: .
Solution:
n=int(input())
ar=list(map(int,input().split()))
total=0
for i in ar:
total=total+i
print(total)

Solution Explanation:
  1. first input the number which is size (n) of an array.
  2. Second line of programe contain n space separeted array's element.
  3. assigne total to zero(0).
  4. take loop to calculate sum of array's element.
  5. And print the total.


Diagonal Difference

Diagonal Difference Given a square matrix, calculate the absolute difference between the sums of its diagonals. For example,...