Skip to content

[Sync Iteration] python/grains/2 #10

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
ikostan merged 2 commits into from
Aug 30, 2025
Merged

[Sync Iteration] python/grains/2 #10

Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
b831901
[Sync Iteration] python/grains/2
exercism-solutions-syncer[bot] Aug 7, 2025
c782174
Merge pull request #46 from ikostan/main
ikostan Aug 30, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
34 changes: 34 additions & 0 deletions solutions/python/grains/2/grains.py
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,34 @@
"""Grains."""


def square(number) -> int:
"""
Calculate the number of grains on a given square.

One grain on the first square of a chessboard, with the number
of grains doubling on each successive square.

:param number: A chessboard square
:type number: int
:return: number of grains on a given square.
:rtype: int
"""
if number <= 0 or number > 64:
raise ValueError("square must be between 1 and 64")

return 2 ** (number - 1)


def total() -> int:
"""
Calculate the total number of grains on the chessboard.

A chessboard has 64 squares. Square 1 has one grain,
square 2 has two grains, square 3 has four grains, and so on,
doubling each time.

:return: the total number of grains on the chessboard.
:rtype: int
"""
# return sum(square(sqr) for sqr in range(1, 65))
return 2 ** 64 - 1