theoludwig/programming-challenges
1
1
Fork 0
mirror of https://github.com/theoludwig/programming-challenges.git synced 2025-05-18 12:02:53 +02:00
Code Issues Releases Activity

feat(solutions): add find-closest-number/python/function

Browse Source
This commit is contained in:
Divlo
2022-05-01 19:07:49 +02:00
parent 4e7cad4a70
commit 530f433028
4 changed files with 22 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
challenges/cakes-swerc-2020-2021/solutions/python/function/solution.py
View File

@ -6,7 +6,7 @@ next(sys.stdin)
for line in sys.stdin:
quantity_per_cake, quantity_available = list(map(int, line.split(' ')))
cake_possible = quantity_available // quantity_per_cake
if maximum_number_of_cake_possible == None or cake_possible < maximum_number_of_cake_possible:
if maximum_number_of_cake_possible is None or cake_possible < maximum_number_of_cake_possible:
maximum_number_of_cake_possible = cake_possible
print(maximum_number_of_cake_possible)