Sha256: b224568b56fda6867c677b8cfd9d26ac6141de1f54838e244c5b174bfb221c41
Contents?: true
Size: 1.52 KB
Versions: 183
Compression:
Stored size: 1.52 KB
Contents
# Grains 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? ## Hints For this exercise the following F# features come in handy: - [BigInt](https://msdn.microsoft.com/en-us/visualfsharpdocs/conceptual/numerics.biginteger-structure-%5Bfsharp%5D) - [Seq.sumBy](https://msdn.microsoft.com/en-us/visualfsharpdocs/conceptual/seq.sumby%5B't,%5Eu%5D-function-%5Bfsharp%5D) is a condensed format to apply a function to a sequence and then sum the results ## Source JavaRanch Cattle Drive, exercise 6 [http://www.javaranch.com/grains.jsp](http://www.javaranch.com/grains.jsp) ## Submitting Incomplete Solutions It's possible to submit an incomplete solution so you can see how others have completed the exercise.
Version data entries
183 entries across 183 versions & 1 rubygems