Calculate the number of grains of wheat on a chessboard given that the number on each square doubles.
There once was a wise servant who saved the life of a prince. The king promised to pay whatever the servant could dream up. Knowing that the king loved chess, the servant told the king he would like to have grains of wheat. One grain on the first square of a chess board, with the number of grains doubling on each successive square.
There are 64 squares on a chessboard (where square 1 has one grain, square 2 has two grains, and so on).
Write code that shows:
In Euphoria an atom can hold any kind of number, with the subtype integer meant for whole numbers.
It is possible to solve this exercise in C-like languages by returning an unsigned 64 bit integer.
However integers in Euphoria are signed and one bit smaller than the machine word, hence too small for this exercise, whereas atoms can hold larger integers with the needed 64 bits of precision.
There is a 32-bit version of Euphoria, which still exists so that legacy applications can continue to use pre-built 32-bit dll/so when no 64-bit version is available, or the wrapper for such is full of hard-coded 32-bit offsets. It is however entirely inadequate to solve this task (since atoms on that only have 53 bits of precision). The exercism site uses a 64-bit version of Euphoria, but if struggling in the CLI check that got installed on that machine too.
Edit via GitHub
Sign up to Exercism to learn and master Euphoria with 48 exercises, and real human mentoring, all for free.
