Retired

Chessboard legend (retired)

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

Stats:

CreatedFeb 20, 2021
Warriors Trained225
Total Skips26
Total Code Submissions327
Total Times Completed137
Python Completions137
Total Stars3
% of votes with a positive feedback rating70% of 82
Total "Very Satisfied" Votes47
Total "Somewhat Satisfied" Votes21
Total "Not Satisfied" Votes14
Total Rank Assessments83
Average Assessed Rank
7 kyu
Highest Assessed Rank
5 kyu
Lowest Assessed Rank
8 kyu
Ad
Contributors
  • achambily Avatar
Ad