mirror of
https://github.com/TheAlgorithms/Python.git
synced 2024-10-07 06:09:28 +00:00
267b5eff40
* Added doctest and more explanation about Dijkstra execution. * tests were not passing with python2 due to missing __init__.py file at number_theory folder * Removed the dot at the beginning of the imported modules names because 'python3 -m doctest -v data_structures/hashing/*.py' and 'python3 -m doctest -v data_structures/stacks/*.py' were failing not finding hash_table.py and stack.py modules. * Moved global code to main scope and added doctest for project euler problems 1 to 14. * Added test case for negative input. * Changed N variable to do not use end of line scape because in case there is a space after it the script will break making it much more error prone. * Added problems description and doctests to the ones that were missing. Limited line length to 79 and executed python black over all scripts. * Changed the way files are loaded to support pytest call. * Added __init__.py to problems to make them modules and allow pytest execution. * Added project_euler folder to test units execution * Changed 'os.path.split(os.path.realpath(__file__))' to 'os.path.dirname()'
37 lines
771 B
Python
37 lines
771 B
Python
"""
|
|
Problem Statement:
|
|
Work out the first ten digits of the sum of the following one-hundred 50-digit
|
|
numbers.
|
|
"""
|
|
from __future__ import print_function
|
|
import os
|
|
|
|
try:
|
|
raw_input # Python 2
|
|
except NameError:
|
|
raw_input = input # Python 3
|
|
|
|
|
|
def solution(array):
|
|
"""Returns the first ten digits of the sum of the array elements.
|
|
|
|
>>> sum = 0
|
|
>>> array = []
|
|
>>> with open(os.path.dirname(__file__) + "/num.txt","r") as f:
|
|
... for line in f:
|
|
... array.append(int(line))
|
|
...
|
|
>>> solution(array)
|
|
'5537376230'
|
|
"""
|
|
return str(sum(array))[:10]
|
|
|
|
|
|
if __name__ == "__main__":
|
|
n = int(input().strip())
|
|
|
|
array = []
|
|
for i in range(n):
|
|
array.append(int(input().strip()))
|
|
print(solution(array))
|