Retired
Chessboard legend (retired)
137achambily
Description:
If a chessboard were to have wheat placed upon each square such that one grain were placed on the first square, two on the second, four on the third, and so on (doubling the number of grains on each subsequent square), how many grains of wheat would be on the chessboard at the finish?
We suppose that our chessboard is nxn (n rows and n columns) Write a function grains(n) which computes the number of grains on the chessboard.
Fundamentals
Similar Kata:
Stats:
Created | Feb 20, 2021 |
Warriors Trained | 225 |
Total Skips | 26 |
Total Code Submissions | 327 |
Total Times Completed | 137 |
Python Completions | 137 |
Total Stars | 3 |
% of votes with a positive feedback rating | 70% of 82 |
Total "Very Satisfied" Votes | 47 |
Total "Somewhat Satisfied" Votes | 21 |
Total "Not Satisfied" Votes | 14 |
Total Rank Assessments | 83 |
Average Assessed Rank | 7 kyu |
Highest Assessed Rank | 5 kyu |
Lowest Assessed Rank | 8 kyu |