Challenges

Bitwise for Dummies
This is to provide you with an introductory experience of bit-wise ope...
Max. Marks: 6
Solved By : 109
Double the Number
Given an array A of size N and K. count all the number of elements suc...
Max. Marks: 8
Solved By : 187
Rotate Array
You are given an array of N length. You have to rotate the array right...
Max. Marks: 6
Solved By : 1579
Floating Number
Bob has a floating point number N. He wants to set the precision for 2...
Max. Marks: 4
Solved By : 5066
SwapMaster solves Symmetric Swap
The SwapMaster is known to be the greatest and fastest swapper of all ...
Max. Marks: 4
Solved By : 4187
String Matching
Cody has a sequence of characters N. He likes a sequence if it contain...
Max. Marks: 3
Solved By : 2347
Leap Year
Steve is playing a quiz game with his brother John. As Steve just lear...
Max. Marks: 6
Solved By : 3622
Project Teams
There are N students in a class and Teacher want to divide these stude...
Max. Marks: 5
Solved By : 4319
Circle of Numbers
All numbers in NumberLand are standing in a circle for a dancing cerem...
Max. Marks: 6
Solved By : 2978
Happy String
A happy string is a string in which each character is lexicographicall...
Max. Marks: 4
Solved By : 2235
Array Sum
Please select a challenge
Problem Statement
You are given an integer array and you have to find the sum of the elements of the array and find the remainder when the sum is divided by the largest number of the array.

Input
First line contains N, the number of elements. Next line contains N space separated integers (elements of the array).

Output
Print the remainder when sum is divided by the maximum element.

Constraints
1 ≤ n ≤ 100 0 ≤ A[i] ≤ 1000

Sample Input
5
1 2 3 4 5

Sample Output

0

Dcoded By: Mrudul Sankhere

Solved By: 3615

Maximum Marks: 4