If a chessboard were to have wheat placed upon each square such that x grains were placed on the first square and each successive square after had y times the amount of grains as the square before. How many grains of wheat would be on the chessboard at the finish?
Assume the chess board is n by n squares.
consider using isequalwithequalnans (isequaln) against NaN instead of isequal against 'NaN' in test 7.
n=-1 ???
This should also be slimmed down somehow.
Someone can easily beat this lead.
2368 Solvers
Find state names that end with the letter A
506 Solvers
Reverse the Words (not letters) of a String
228 Solvers
Sum all integers from 1 to 2^n
5681 Solvers
187 Solvers