Sha256: 84ab5c8fbaf5c80679fd8f87812be5e8fb8ceedff66ed0553992b757238f4671
Contents?: true
Size: 898 Bytes
Versions: 77
Compression:
Stored size: 898 Bytes
Contents
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. Two grains on the next. Four on the third, and so on. There are 64 squares on a chessboard. Write code that shows: - how many grains were on each square, and - the total number of grains ## For bonus points Did you get the tests passing and the code clean? If you want to, these are some additional things you could try: - Optimize for speed. - Optimize for readability. Then please share your thoughts in a comment on the submission. Did this experiment make the code better? Worse? Did you learn anything from it?
Version data entries
77 entries across 77 versions & 1 rubygems