The program must accept N integers as the input. The program must print the maximum possible sum S of integers which are having the same unit digit among the N integers.
Boundary Condition(s):
1 <= N <= 100
1 <= Each integer value <= 10^6
Input Format:
The first line contains N.
The second line contains N integers separated by a space.
Output Format:
The first line contains S.
Example Input/Output 1:
Input:
5
60 69 39 98 20
Output:
108
Explanation:
The sum of integers which are having 9 as the unit digit is 108 (69 + 39).
The sum of integers which are having 0 as the unit digit is 80 (60 + 20).
The only integer which is having 8 as the unit digit is 98.
Among the above sum values, 108 is maximum. So 108 is printed as the output.
Example Input/Output 2:
Input:
8
15 98 67 95 18 93 48 97
Output:
164
# Read the input values
n = int(input())
numbers = list(map(int, input().split()))
# Initialize a dictionary to store the sums of numbers by their unit digit
unit_digit_sums = {}
# Iterate through the numbers and calculate the sums based on unit digits
for number in numbers:
unit_digit = number % 10
if unit_digit not in unit_digit_sums:
unit_digit_sums[unit_digit] = number
else:
unit_digit_sums[unit_digit] += number
# Find the maximum sum from the unit digit sums
max_sum = max(unit_digit_sums.values())
# Print the maximum sum
print(max_sum)
